Chapter 16 Logic Programming Languages. Copyright © 2012 Addison-Wesley. All rights reserved.1-2 Chapter 16 Topics Introduction A Brief Introduction to.

Slides:



Advertisements
Similar presentations
First Order Logic Logic is a mathematical attempt to formalize the way we think. First-order predicate calculus was created in an attempt to mechanize.
Advertisements

Chapter 11 :: Logic Languages
Automated Reasoning Systems For first order Predicate Logic.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
1 Logic Programming. 2 A little bit of Prolog Objects and relations between objects Facts and rules. Upper case are variables. parent(pam, bob).parent(tom,bob).
CS 330 Programming Languages 12 / 02 / 2008 Instructor: Michael Eckmann.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Axiomatic Semantics.
ISBN Chapter 16 Logic Programming Languages.
Programming Languages Third Edition
CSE 452: Programming Languages
Logic Programming Languages. Objective To introduce the concepts of logic programming and logic programming languages To introduce a brief description.
CSE 452: Programming Languages Logical Programming Languages Part 2.
CSE 452: Programming Languages
CSC3315 (Spring 2009)1 CSC 3315 Programming Paradigms Prolog Language Hamid Harroud School of Science and Engineering, Akhawayn University
ISBN Chapter 16 Logic Programming Languages.
CS 330 Programming Languages 12 / 05 / 2006 Instructor: Michael Eckmann.
(9.1) COEN Logic Programming  Logic programming and predicate calculus  Prolog statements  Facts and rules  Matching  Subgoals and backtracking.
Logic Programming Tasanawan Soonklang. Programming paradigms Imperative Object-oriented Functional Logic Procedural programming Non-procedural programming.
ISBN Chapter 16 Logic Programming Languages.
Logic Programming Languages
CPS 506 Comparative Programming Languages
Formal Models of Computation Part II The Logic Model
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
CS 330 Programming Languages 12 / 04 / 2007 Instructor: Michael Eckmann.
1-1 Introduction Logic programming languages, sometimes called declarative programming languages Express programs in a form of symbolic logic Use a logical.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
1 COSC3306: Programming Paradigms Lecture 8: Declarative Programming Specifications Haibin Zhu, Ph.D. Computer Science Nipissing University (C) 2003.
Introduction to Prolog Asst. Prof. Dr. Senem Kumova Metin Revised lecture notes of “Concepts of Programmig Languages, Robert W. Sebesta, Ch. 16”
ISBN Chapter 3 Describing Semantics -Attribute Grammars -Dynamic Semantics.
CHAPTER 15 & 16 Functional & Logic Programming Languages.
1 Prolog and Logic Languages Aaron Bloomfield CS 415 Fall 2005.
Programming Languages Tucker and Noonan – 2e Chapter 15 – Part 1 Logic Programming “Q: How many legs does a dog have if you call its tail a leg? A: Four.
By: Cory Canter CSC 415 Programming Languages. History  Created by Alain Colmerauer, Phillipe Roussel and Robert Kowalski in 1971  Started as a natural.
Dr. Muhammed Al-Mulhem ICS An Introduction to Logical Programming.
Logic Programming Languages Session 13 Course : T Programming Language Concept Year : February 2011.
CS 363 Comparative Programming Languages Logic Programming Languages.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Automated Reasoning Early AI explored how to automate several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Ch. 13 Ch. 131 jcmt CSE 3302 Programming Languages CSE3302 Programming Languages (notes?) Dr. Carter Tiernan.
Prolog Harry R. Erwin, PhD COMM2M University of Sunderland.
© Kenneth C. Louden, Chapter 12 - Logic Programming Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
Programming Languages Third Edition Chapter 4 Logic Programming.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
CS 330 Programming Languages 11 / 25 / 2008 Instructor: Michael Eckmann.
Logic Programming Tarik Booker. What will we cover?  Introduction  Definitions  Predicate Calculus  Prolog  Applications.
ISBN Chapter 16 Logic Programming Languages.
Dr. Muhammed Al-Mulhem ICS An Introduction to Prolog.
1-1 An Introduction to Logical Programming Sept
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
Introduction to Prolog Asst. Prof. Dr. Senem Kumova Metin Revised lecture notes of “Concepts of Programmig Languages, Robert W. Sebesta, Ch. 16”
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
1-1 An Introduction to Prolog Sept Prolog statements Like other programming languages, Prolog consists of collection of statements. Prolog.
Copyright 1999Paul F. Reynolds, Jr. Foundations of Logic Programming.
CS 330 Programming Languages 12 / 06 / 2007 Instructor: Michael Eckmann.
Logic Programming Languages
By P. S. Suryateja Asst. Professor, CSE Vishnu Institute of Technology
Prolog a declarative language
Logic Programming Languages
CS 3304 Comparative Languages
Logic Programming Languages
Logic Programming Languages
Prolog a declarative language
Prolog a declarative language
Prolog a declarative language
Back to “Serious” Topics…
Logic Programming Language
Logic Programming Languages
Logic Programming & Prolog
UNIT-V Logic Programming Languages & Functional Programming Languages
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Chapter 16 Logic Programming Languages

Copyright © 2012 Addison-Wesley. All rights reserved.1-2 Chapter 16 Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic Programming The Origins of Prolog The Basic Elements of Prolog Deficiencies of Prolog Applications of Logic Programming

Copyright © 2012 Addison-Wesley. All rights reserved.1-3 Introduction Programs in logic languages are expressed in a form of symbolic logic Use a logical inferencing process to produce results Declarative rather that procedural: –Only specification of results are stated (not detailed procedures for producing them)

Copyright © 2012 Addison-Wesley. All rights reserved.1-4 Proposition A logical statement that may or may not be true –Consists of objects and relationships of objects to each other

Copyright © 2012 Addison-Wesley. All rights reserved.1-5 Symbolic Logic Logic which can be used for the basic needs of formal logic: –Express propositions –Express relationships between propositions –Describe how new propositions can be inferred from other propositions Particular form of symbolic logic used for logic programming called predicate calculus

Copyright © 2012 Addison-Wesley. All rights reserved.1-6 Object Representation Objects in propositions are represented by simple terms: either constants or variables Constant: a symbol that represents an object Variable: a symbol that can represent different objects at different times –Different from variables in imperative languages

Copyright © 2012 Addison-Wesley. All rights reserved.1-7 Compound Terms Atomic propositions consist of compound terms Compound term: one element of a mathematical relation, written like a mathematical function –Mathematical function is a mapping –Can be written as a table

Copyright © 2012 Addison-Wesley. All rights reserved.1-8 Parts of a Compound Term Compound term composed of two parts –Functor: function symbol that names the relationship –Ordered list of parameters (tuple) Examples: student(jon) like(seth, OSX) like(nick, windows) like(jim, linux)

Copyright © 2012 Addison-Wesley. All rights reserved.1-9 Forms of a Proposition Propositions can be stated in two forms: –Fact: proposition is assumed to be true –Query: truth of proposition is to be determined Compound proposition: –Have two or more atomic propositions –Propositions are connected by operators

Copyright © 2012 Addison-Wesley. All rights reserved.1-10 Logical Operators NameSymbolExampleMeaning negation   anot a conjunction  a  ba and b disjunction  a  ba or b equivalence  a  ba is equivalent to b implication  a  b a  b a implies b b implies a

Copyright © 2012 Addison-Wesley. All rights reserved.1-11 Quantifiers NameExampleMeaning universal  X.PFor all X, P is true existential  X.PThere exists a value of X such that P is true

Copyright © 2012 Addison-Wesley. All rights reserved.1-12 Clausal Form Too many ways to state the same thing Use a standard form for propositions Clausal form: –B 1  B 2  …  B n  A 1  A 2  …  A m –means if all the As are true, then at least one B is true Antecedent: right side Consequent: left side

Copyright © 2012 Addison-Wesley. All rights reserved.1-13 Predicate Calculus and Proving Theorems A use of propositions is to discover new theorems that can be inferred from known axioms and theorems Resolution: an inference principle that allows inferred propositions to be computed from given propositions

Copyright © 2012 Addison-Wesley. All rights reserved.1-14 Resolution Unification: finding values for variables in propositions that allows matching process to succeed Instantiation: assigning temporary values to variables to allow unification to succeed After instantiating a variable with a value, if matching fails, may need to backtrack and instantiate with a different value

Copyright © 2012 Addison-Wesley. All rights reserved.1-15 Proof by Contradiction Hypotheses: a set of pertinent propositions Goal: negation of theorem stated as a proposition Theorem is proved by finding an inconsistency

Copyright © 2012 Addison-Wesley. All rights reserved.1-16 Theorem Proving Basis for logic programming When propositions used for resolution, only restricted form can be used Horn clause - can have only two forms –Headed: single atomic proposition on left side –Headless: empty left side (used to state facts) Most propositions can be stated as Horn clauses

Copyright © 2012 Addison-Wesley. All rights reserved.1-17 Overview of Logic Programming Declarative semantics –There is a simple way to determine the meaning of each statement –Simpler than the semantics of imperative languages Programming is nonprocedural –Programs do not state now a result is to be computed, but rather the form of the result

Copyright © 2012 Addison-Wesley. All rights reserved.1-18 Example: Sorting a List Describe the characteristics of a sorted list, not the process of rearranging a list sort(old_list, new_list)  permute (old_list, new_list)  sorted (new_list) sorted (list)   j such that 1  j < n, list(j)  list (j+1)

Copyright © 2012 Addison-Wesley. All rights reserved.1-19 The Origins of Prolog University of Aix-Marseille (Calmerauer & Roussel) –Natural language processing University of Edinburgh (Kowalski) –Automated theorem proving

Copyright © 2012 Addison-Wesley. All rights reserved.1-20 Terms This book uses the Edinburgh syntax of Prolog Term: a constant, variable, or structure Constant: an atom or an integer Atom: symbolic value of Prolog Atom consists of either: –a string of letters, digits, and underscores beginning with a lowercase letter –a string of printable ASCII characters delimited by apostrophes

Copyright © 2012 Addison-Wesley. All rights reserved.1-21 Terms: Variables and Structures Variable: any string of letters, digits, and underscores beginning with an uppercase letter Instantiation: binding of a variable to a value –Lasts only as long as it takes to satisfy one complete goal Structure: represents atomic proposition functor ( parameter list )

Copyright © 2012 Addison-Wesley. All rights reserved.1-22 Fact Statements Used for the hypotheses Headless Horn clauses female(shelley). male(bill). father(bill, jake).

Copyright © 2012 Addison-Wesley. All rights reserved.1-23 Rule Statements Used for the hypotheses Headed Horn clause Right side: antecedent (if part) –May be single term or conjunction Left side: consequent (then part) –Must be single term Conjunction: multiple terms separated by logical AND operations (implied)

Copyright © 2012 Addison-Wesley. All rights reserved.1-24 Example Rules ancestor(mary,shelley):- mother(mary,shelley). Can use variables (universal objects) to generalize meaning: parent(X,Y):- mother(X,Y). parent(X,Y):- father(X,Y). grandparent(X,Z):- parent(X,Y), parent(Y,Z).

Copyright © 2012 Addison-Wesley. All rights reserved.1-25 Goal Statements For theorem proving, theorem is in form of proposition that we want system to prove or disprove – goal statement Same format as headless Horn man(fred) Conjunctive propositions and propositions with variables also legal goals father(X, mike)

Copyright © 2012 Addison-Wesley. All rights reserved.1-26 Inferencing Process of Prolog Queries are called goals If a goal is a compound proposition, each of the facts is a subgoal To prove a goal is true, must find a chain of inference rules and/or facts. For goal Q: P 2 :- P 1 P 3 :- P 2 … Q :- P n Process of proving a subgoal called matching, satisfying, or resolution

Copyright © 2012 Addison-Wesley. All rights reserved.1-27 Approaches Matching is the process of proving a proposition Proving a subgoal is called satisfying the subgoal Bottom-up resolution, forward chaining –Begin with facts and rules of database and attempt to find sequence that leads to goal –Works well with a large set of possibly correct answers Top-down resolution, backward chaining –Begin with goal and attempt to find sequence that leads to set of facts in database –Works well with a small set of possibly correct answers Prolog implementations use backward chaining

Copyright © 2012 Addison-Wesley. All rights reserved.1-28 Subgoal Strategies When goal has more than one subgoal, can use either –Depth-first search: find a complete proof for the first subgoal before working on others –Breadth-first search: work on all subgoals in parallel Prolog uses depth-first search –Can be done with fewer computer resources

Copyright © 2012 Addison-Wesley. All rights reserved.1-29 Backtracking With a goal with multiple subgoals, if fail to show truth of one of subgoals, reconsider previous subgoal to find an alternative solution: backtracking Begin search where previous search left off Can take lots of time and space because may find all possible proofs to every subgoal

Copyright © 2012 Addison-Wesley. All rights reserved.1-30 Simple Arithmetic Prolog supports integer variables and integer arithmetic is operator: takes an arithmetic expression as right operand and variable as left operand A is B / 17 + C Not the same as an assignment statement! –The following is illegal: Sum is Sum + Number.

Copyright © 2012 Addison-Wesley. All rights reserved.1-31 Example speed(ford,100). speed(chevy,105). speed(dodge,95). speed(volvo,80). time(ford,20). time(chevy,21). time(dodge,24). time(volvo,24). distance(X,Y) :- speed(X,Speed), time(X,Time), Y is Speed * Time. A query: distance(chevy, Chevy_Distance).

Copyright © 2012 Addison-Wesley. All rights reserved.1-32 Trace Built-in structure that displays instantiations at each step Tracing model of execution - four events: –Call (beginning of attempt to satisfy goal) –Exit (when a goal has been satisfied) –Redo (when backtrack occurs) –Fail (when goal fails)

Copyright © 2012 Addison-Wesley. All rights reserved.1-33 Example likes(jake,chocolate). likes(jake, apricots). likes(darcie, licorice). likes(darcie, apricots). trace. likes(jake, X), likes(darcie, X). (1) 1 Call: likes(jake, _0)? (1) 1 Exit: likes(jake, chocolate) (2) 1 Call: likes(darcie, chocolate)? (2) 1 Fail: likes(darcie, chocolate) (1) 1 Redo: likes(jake, _0)? (1) 1 Exit: likes(jake, apricots) (3) 1 Call: likes(darcie, apricots)? (3) 1 Exit: likes(darcie, apricots) X = apricots

Copyright © 2012 Addison-Wesley. All rights reserved.1-34 List Structures Other basic data structure (besides atomic propositions we have already seen): list List is a sequence of any number of elements Elements can be atoms, atomic propositions, or other terms (including other lists) [apple, prune, grape, kumquat] [] ( empty list) [X | Y] ( head X and tail Y)

Copyright © 2012 Addison-Wesley. All rights reserved.1-35 Append Example append([], List, List). append([Head | List_1], List_2, [Head | List_3]) :- append (List_1, List_2, List_3).

Copyright © 2012 Addison-Wesley. All rights reserved.1-36 More Examples reverse([], []). reverse([Head | Tail], List) :- reverse (Tail, Result), append (Result, [Head], List). member(Element, [Element | _]). member(Element, [_ | List]) :- member(Element, List). The underscore character means an anonymous variable—it means we do not care what instantiation it might get from unification

Copyright © 2012 Addison-Wesley. All rights reserved.1-37 Deficiencies of Prolog Resolution order control –In a pure logic programming environment, the order of attempted matches is nondeterministic and all matches would be attempted concurrently The closed-world assumption –The only knowledge is what is in the database The negation problem –Anything not stated in the database is assumed to be false Intrinsic limitations –It is easy to state a sort process in logic, but difficult to actually do—it doesn’t know how to sort

Copyright © 2012 Addison-Wesley. All rights reserved.1-38 Applications of Logic Programming Relational database management systems Expert systems Natural language processing

Copyright © 2012 Addison-Wesley. All rights reserved.1-39 Summary Symbolic logic provides basis for logic programming Logic programs should be nonprocedural Prolog statements are facts, rules, or goals Resolution is the primary activity of a Prolog interpreter Although there are a number of drawbacks with the current state of logic programming it has been used in a number of areas