Hamm / Richter: Algorithmic Semantics (SS 10)

General Information on the Course

• Course Description in the Campus system
• Time: Our class meets Tuesdays, 16ct-17.45 (SfS, seminar room 1.13), and Thursdays, 16ct-17.45 (SfS, seminar room 1.13)
• Language: The course language is English.
• Office Hours:
  Fritz Hamm: Thursdays, 14.00-15.00, SfS, friedrich.hamm@uni-tuebingen.de
  Frank Richter: Mondays, 11.00-12.00, SfS, Room 2.17, f.richter@em.uni-frankfurt.de
  
• Official statement to be included (and signed) in every Schriftliche Hausarbeit or written summary

Hand-outs and Slides

• Syntax and Semantics of First Order Predicate Logic
• Fritz Hamm: Referential Intensions and Referential Synonymy: Moschovakis' Theory of Meaning
• Fritz Hamm: Konditionale und die Logik des "Suppression Effekts"

Software

• Patrick Blackburn & Johan Bos: Representation and Inference for Natural Language: Software Requirements and Downloads

Student Presentations

• Nomi Meixner: Propositional Tableaus
• Andreas Rudin: Propositional Resolution
• Johannes Dellert: First Order Tableaux

Essential Course Readings

• Patrick Blackburn & Johan Bos: Representation and Inference for Natural Language. A First Course in Computational Semantics. CSLI Publications, 2005
• Yiannis N. Moschovakis: A Logical Calculus of Meaning and Synonymy. Linguistics and Philosophy, vol 29 (2006), pp. 27--89.
• Yiannis N. Moschovakis: Sense and Denotation as Algorithm and Value.
• Yiannis N. Moschovakis: What Is an Algorithm?
• Fritz Hamm, Yiannis Moschovakis: Sense and Denotation as Algorithm and Value. Advanced Course. ESSLLI 2010 CPH

Recommended Additional Readings

• List of papers on logic programming
• For an introduction to the notion of unification:
  Leon Sterling and Ehud Shapiro (1994): The Art of Prolog. The MIT Press, Cambridge, Massachusetts, 2nd edition. Chapter 4, The Computation Model of Logic Programs, in particular Section 4.1