僦 o 素 又四梁娜 僦腋群2 幼 潞2 素 剞 煤炯冀 忠戎.PDF

Roland Schäfer Prolog fo r Natural Language Semantics Göttingen/Summer Course 2005 References [BB] Blackburn, P. Bos, J. 2005. Representation and Inference for Nat- ural Language . Stanford: CSLI. [CM] Clo cksin, W. F. Mellish, Ch. M. 1995. Programming in Prolog . Berlin: Springer. [Cov] Covington, M. A. 1994. Natural Language Processing for Prolog Programmers . Upp er Saddle River: Prentice Hall. [LPN] Blackburn,P. Bos, J. Striegnitz, K. 2001. Learn Prolog Now! . http://www.coli.uni-sb.de/kris/learn-prolog-now. Dates Day 1, Prolog Recap Wed, 2005/07/20 Afterno on Session @ 13.15-14.45 Evening Session @ 16.15-17.45 Day 2, Model Checking Thu, 2005/07/21 Morning Session @ 10.15-11.45 Afterno on Session @ 14.15-15.45 Day 3, Lambda Fri, 2005/07/22 Morning Session @ 10.15-11.45 Day 4, Underspecication Mon, 2005/07/25 Morning Session @ 10.15-11.45 Afterno on Session @ 14.15-15.45 This course just gives you a rst overview. Most of the semantics implementation we won t do ourselves but copy fr om BB. If you like to play with Prolog, though, keep playing! No matter what you think about implementations of grammatical theories (or of grammatical theories, for that matter), Prolog is good for your brain! Day 1: Prolog Recap 1 Afterno on session i Basics 1. Prolog programs are called knowledge bases. We sp eak of the declarative and the pro cedural meaning of denitions in the knowledge base. Knowledge bases basically contain simple facts [ sleeps(mary). ] and conditional rules [ sleeps(mary) :- isnt_awake(mary). ]. Both typ es are called predicates with functors and arguments (in round brackets, separated by commas)