Ch 14. An Introduction to Prolog.ppt

Artificial Intelligence Ch 14. An Introduction to Prolog an Implementation of logic as a programming language(PROgramming in LOGig) many interesting contributions to AI problem solving declarative semantics built-in unification high-powered techniques for pattern matching and search 14.1 Syntax for Predicate Calculus Programming 14.1.1 Representing Facts and Rules 14.1.2 Creating, Changing, and Monitoring the PROLOG Environment 14.1.3 Lists and Recursion in PROLOG 14.1.4 Recursive Search in PROLOG 14.1.5 The Use of Cut 14.1.1 Representing Facts and Rules(1) English Predicate Calculus PROLOG and ù , or ú ; only if ? :- not ? not “Everyone likes Susie.” likes(X, susie). or likes(Everyone, susie). The set of people that are liked by George AND Susie likes(george, Y), likes(susie, Y). “George likes Kate OR George likes Susie.” likes(george, kate); likes(george, susie). 14.1.1 Representing Facts and Rules(2) “George likes Susie if George likes Kate.” likes(george, susie) :- likes(george, kate). “Kate does not like Susie.” not(likes(kate, susie)). A Model for the database Database - a set of specifications describing the objects and relations in a problem domain Queries to the database are patterns in the same logical syntax as the database entries. Prolog interpreter uses pattern-directed search to find whether these queries logically follow from the contents of the database. 14.1.1 Representing Facts and Rules(3) Prolog exmaple 14.1.1 Representing Facts and Rules(4) Prolog interpertations The prompts with (;) forces a backtrack on the most recent result. Continued prompts force Prolog to find all possible solutions to the query Closed world assumption or Negations as failure assumes that “anything is false if it is not known to be true.” Horn clause logic the left hand side(conclusion) of an implication must be a single positive literal. An example of a rule friends(X, Y) :- likes(X, Z), likes(Y, Z). ?- friends(george, susie). yes Prolog d