PPT-Prolog

pro grammation en log ique programmation en logique UNIVERSIDADE FEDERAL DO RIO GRANDE DO NORTE Daniel Augusto da Costa Ambrósio Eduardo Agostinho Oliveira dos Santos Fernando Chaves Dantas. Intelligence programming and . Prolog Language Tutorial. Contents. What is logic programming?. Small Examples. The Basics. Another Example: Towers of Hanoi. Other Examples. What is Logic Programming?. Lecturer: Xinming (Simon) Ou. CIS 505: Programming Languages. Fall 2010. Kansas State University. 1. Z2=john. X=mary. Y=john. Y=john. X=bill. Y=mary. Example SLD resolution. ancestor(X,Y. ) :- . parent(X,Y. Organization of programming languages. Lecture . 10 . – Prolog. Review. Homework 2 due on F. Semester project will be out either F or M. C# picked as OO Language. Lists. Recursion. Objectives. Review Prolog. A Linguagem Prolog. FATOS. Os fatos permitem definir os predicados:. . - Exemplo:. um sistema ecológico para especificar a cadeia alimentar. come (urso, peixe). come (urso, raposa) % . Sandiway Fong. Lecture 5. Administrivia. Reminder. Homework 2: due . this Wednesday . by midnight. email: Ben Martin . bamartin@email.arizona.edu. Today’s . Topic:. Recursion (Chapter 3 of . learnprolognow.org. Predicate Logic. 1 Aug 2013. Predicate Logic (§1.3). Predicate logic. is an extension of propositional logic that permits concisely reasoning about whole . classes. of entities.. Propositional logic (recall) treats simple . Prolog Lecture 2 – Unification and Proof Search. Unification. From Knowledge Base 4:. woman(. mia. ).. woman(. jody. ).. woman(. yolanda. ).. …. Querying Knowledge Base 4:. 1 . ?- . woman(X).. X = . We will learn predicates for:. input and output.. Modifying the knowledge base.. Controlling backtracking process.. Output: write, . nl. , display. write: takes any prolog term and displays that term on screen.. CS164. : Introduction to Programming. Languages and Compilers, Spring 2012. UC . Berkeley. Ras, Ali, and Mangpo. . Lecture 1: Why Take . CS164?. Today. What is a programming language. Why you will write a few in your life. Not all noun phrases (NPs) are (by nature) directly referential like names. Quantifiers. : . “. something to do with indicating the quantity of something. ”. Examples. :. every. child. nobody. two. . Defaults. Foundations of AI. Given an N X N matrix, and given N colors, color the matrix in such a way that:. -all cells are colored;. - each color occurs exactly once in each row;. - each color occurs exactly once in each column;. Already seen program statement types. :. rules: p(X) :- q(X,Y), r(. Y,z. ).. facts: likes(. brian. , . madonna. ).. queries: ?- likes(. madonna. , . brian. ).. Argument forms:. 1. logical . Introduction to Prolog . CS 370 . Prolog, which stands for . PROgramming. . in . LOGic. , is the most widely . available language . in the logic . programming paradigm. .. . Prolog is a programming language for symbolic , non-numeric commutation.. . Defaults. Foundations of AI. Given an N X N matrix, and given N colors, color the matrix in such a way that:. -all cells are colored;. - each color occurs exactly once in each row;. - each color occurs exactly once in each column;.