First Order Logic. Introduction to AI Bert Huang
|
|
|
- Myrtle Walker
- 5 years ago
- Views:
Transcription
1 First Order Logic Introduction to AI Bert Huang
2 Review Propositional logic syntax and semantics Inference in propositional logic: table, inference rules, resolution Horn clauses, forward/backward chaining
3 First Order Logic Terminology: predicates, arity, terms, functions, atoms Quantifiers: universal, existential Inference: differences from propositional logic
4 Terminology Predicates: functions that map variables to truth values is_woman(marge), is_mother_of(lisa, Marge) is_woman is a predicate, Marge is a term/constant, and is_woman(marge) is a formula Can have any arity: binary, 3-ary, 4-ary n-ary Functions map from terms to terms: e.g., motherof(bart) Marge
5 Simple Propositionalization Define propositional logic variables for every atomic formula M1 = is_mother_of(bart, Homer), M2 = is_mother_of(lisa, Snowball), W1 = is_woman(marge), W2 = is_woman(lisa), W3 = is_woman(homer), Perform inference as in propositional logic Child Mother is_mother_of Bart Homer F Lisa Snowball F Bart Marge T Homer Mona T Name Lisa Marge Homer Bart is_woman T T F F
6 Quantifiers More general knowledge: e.g., all mothers are people x, y, is_mother_of(x, y) is_person(y) For all x and y, if y is x s mother, then y is a person. Universal quantifier: Existential quantifier: (there exists) x, y, is_mother_of(x, y)
7 Propositionalizing is Expensive Lisa Lisa is_mother_of(lisa, Lisa) Maggie Maggie is_mother_of(lisa, Maggie) Marge is_mother_of Marge is_mother_of(lisa, Marge) Bart Bart is_mother_of(lisa, Bart) Homer Homer is_mother_of(lisa, Homer) is_mother_of(maggie, Lisa) is_mother_of(maggie, Maggie) is_mother_of(maggie, Marge) is_mother_of(maggie, Bart) is_mother_of(maggie, Homer) is_mother_of(marge, Lisa) is_mother_of(marge, Maggie)
8 Horn Clauses pred1(v11, ) pred2(v21, ) predn(vn1, ) predr(vr1, ) antecedent consequent
9 Inference: Forward Chaining Input: set of known atoms Input: set of Horn clauses Input: target formula to prove (or disprove) Implication where all antecedents (i.e., conditions) and consequent (i.e., result) are positive E.g., x, y, is_mother_of(x, y) is_person(y) Generate new knowledge using generalized modus ponens
10 Generalized Modus Ponens E.g., A, B, C, is_mother_of(a, B) is_mother_of(a, C) sibling(b, C) pred1(v11, ) pred2(v21, ) predn(vn1, ) predr(vr1, ) KB pred1(a, ) pred2(b, ) pred1(c, ) Substitution v11 = A v21 = C v22 = A v31 = B
11 Generalized Modus Ponens E.g., A, B, C, is_mother_of(a, B) is_mother_of(a, C) sibling(b, C) KB Substitution is_mother_of(marge, Maggie) is_mother_of(marge, Bart) A = Marge B = Maggie C = Bart
12 Handling Quantifiers Universal ( ): replace with any constant during substitution Existential ( ): replace existential variable with new constant
13 (Skolem) Constants Replace existentially quantified variables with arbitrary constant x, is_mother_of(x, Bart) is_mother_of(c, Bart)
14 Forward Chaining, High Level For each sentence r in KB, For each substitution s that satisfies the conditions of r Add the consequent of r with substitution s to KB Check if target sentence is in KB or if contradiction
15 Backward Chaining High-Level For target sentence Look for substitution s that would imply target Add unsatisfied clauses in antecedent of substituted sentence to frontier Search for clauses that imply unsatisfied classes from frontier
16 Book Example The law says that it is a crime for an American to sell weapons to hostile nations. The country Nono, an enemy of America, has some missiles, and all of its missiles were sold to it by Colonel West, who is American. Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America)
17 Book Example: Forward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Sells(West, M1, Nono)
18 Book Example: Forward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Sells(West, M1, Nono) Weapon(M1) Hostile(Nono)
19 Book Example: Forward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Sells(West, M1, Nono) Weapon(M1) Hostile(Nono)
20 Book Example: Backward Chaining
21 Book Example: Backward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Weapon(y) Sells(West, y, z) Hostile(z)
22 Book Example: Backward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Weapon(y) Sells(West, y, z) Hostile(z)
23 Book Example: Backward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Weapon(M1) Sells(West, M1, z) Hostile(z)
24 Book Example: Backward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Weapon(M1) Sells(West, M1, Nono) Hostile(Nono)
25 Book Example: Backward Chaining Is West a criminal? x, y, z, American(x) Weapon(y) Sells(x, y, z) Hostile(z) Criminal(x), x, Owns(Nono, x) Missile(x) x, Missile(x) Weapon(x) Owns(Nono, M1) x, Enemy(x, America) Hostile(x) Missile(M1) American(West) x, Missile(x) Owns(Nono, x) Sells(West, x, Nono) Enemy(Nono, America) Weapon(M1) Sells(West, M1, Nono) Hostile(Nono) Enemy(Nono, America)
26 First Order Logic Terminology: predicates, arity, terms, functions, atoms Quantifiers: universal, existential Inference: differences from propositional logic Requires handling quantifiers, finding substitutions Forward and Backward chaining
Resolution in FOPC. Deepak Kumar November Knowledge Engineering in FOPC
Resolution in FOPC Deepak Kumar November 2017 Knowledge Engineering in FOPC Identify the task Assemble relevant knowledge Decide on a vocabulary of predicates, functions, and constants Encode general knowledge
Inf2D 12: Resolution-Based Inference
School of Informatics, University of Edinburgh 09/02/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Last time Unification: Given α and β, find θ such that αθ = βθ Most general unifier
CS S-10 First Order Logic 1
CS662-2013S-10 First Order Logic 1 10-0: Representation Propositional Logic has several nice features Lets us easily express disjunction and negation There is a pit in (1,1) or in (2,2) There is not a
Implementation Techniques
Web Science & Technologies University of Koblenz Landau, Germany Implementation Techniques Acknowledgements to Angele, Gehrke, STI Word of Caution There is not the one silver bullet In actual systems,
Foundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
INF5390 Kunstig intelligens. First-Order Logic. Roar Fjellheim
INF5390 Kunstig intelligens First-Order Logic Roar Fjellheim Outline Logical commitments First-order logic First-order inference Resolution rule Reasoning systems Summary Extracts from AIMA Chapter 8:
Outline. Forward chaining Backward chaining Resolution. West Knowledge Base. Forward chaining algorithm. Resolution-Based Inference.
Resolution-Based Inference Outline R&N: 9.3-9.6 Michael Rovatsos University of Edinburgh Forward chaining Backward chaining Resolution 10 th February 2015 Forward chaining algorithm West Knowledge Base
INFERENCE IN FIRST-ORDER LOGIC
A-PDF Split DEMO : Purchase from www.a-pdf.com to remove the watermark 9 INFERENCE IN FIRST-ORDER LOGIC In which we dejine eflective procedures for answering questions posed in jirstorder logic. Chapter
CS 8520: Artificial Intelligence
CS 8520: Artificial Intelligence Logical Agents and First Order Logic Paula Matuszek Spring 2013 1 References These slides draw from a number of sources, including: Hwee Tou Ng, http://aima.eecs.berkeley.edu/
Inference in First-Order Logic
Inference in First-Order Logic Proofs Unification Generalized modus ponens Forward and backward chaining Completeness Resolution Logic programming CS 561, Session 16-18 1 Inference in First-Order Logic
Knowledge Representation. CS 486/686: Introduction to Artificial Intelligence
Knowledge Representation CS 486/686: Introduction to Artificial Intelligence 1 Outline Knowledge-based agents Logics in general Propositional Logic& Reasoning First Order Logic 2 Introduction So far we
(More) Propositional Logic and an Intro to Predicate Logic. CSCI 3202, Fall 2010
(More) Propositional Logic and an Intro to Predicate Logic CSCI 3202, Fall 2010 Assignments Next week: Guest lectures (Jim Martin and Nikolaus Correll); Read Chapter 9 (but you can skip sections on logic
Notes for Chapter 12 Logic Programming. The AI War Basic Concepts of Logic Programming Prolog Review questions
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions The AI War How machines should learn: inductive or deductive? Deductive: Expert => rules =>
Inference in First-Order Logic
Inference in First-Order Logic Proofs Unification Generalized modus ponens Forward and backward chaining Completeness Resolution Logic programming CS 460, Session 16-18 1 Inference in First-Order Logic
CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
COMP4418 Knowledge Representation and Reasoning
COMP4418 Knowledge Representation and Reasoning Week 3 Practical Reasoning David Rajaratnam Click to edit Present s Name Practical Reasoning - My Interests Cognitive Robotics. Connect high level cognition
Lecture 17 of 41. Clausal (Conjunctive Normal) Form and Resolution Techniques
Lecture 17 of 41 Clausal (Conjunctive Normal) Form and Resolution Techniques Wednesday, 29 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Chapter 9,
Resolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
Automated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
CS221 / Autumn 2017 / Liang & Ermon. Lecture 17: Logic II
CS221 / Autumn 2017 / Liang & Ermon Lecture 17: Logic II Review: ingredients of a logic Syntax: defines a set of valid formulas (Formulas) Example: Rain Wet Semantics: for each formula, specify a set of
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Lecture 4: January 12, 2015
32002: AI (First Order Predicate Logic, Interpretation and Inferences) Spring 2015 Lecturer: K.R. Chowdhary Lecture 4: January 12, 2015 : Professor of CS (VF) Disclaimer: These notes have not been subjected
Lecture 7: January 15, 2014
32002: AI (First order Predicate Logic, Syntax and Semantics) Spring 2014 Lecturer: K.R. Chowdhary Lecture 7: January 15, 2014 : Professor of CS (GF) Disclaimer: These notes have not been subjected to
Chapter 16. Logic Programming Languages
Chapter 16 Logic Programming Languages Chapter 16 Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic Programming The Origins of
Logic Programming Languages
Logic Programming Languages Introduction Logic programming languages, sometimes called declarative programming languages Express programs in a form of symbolic logic Use a logical inferencing process to
Constraint Solving. Systems and Internet Infrastructure Security
Systems and Internet Infrastructure Security Network and Security Research Center Department of Computer Science and Engineering Pennsylvania State University, University Park PA Constraint Solving Systems
Logic (or Declarative) Programming Foundations: Prolog. Overview [1]
![Logic (or Declarative) Programming Foundations: Prolog. Overview [1]](/thumbs/75/72923579.jpg "Logic (or Declarative) Programming Foundations: Prolog. Overview [1]")
Logic (or Declarative) Programming Foundations: Prolog In Text: Chapter 12 Formal logic Logic programming Prolog Overview [1] N. Meng, S. Arthur 2 1 Logic Programming To express programs in a form of symbolic
Chapter 2 & 3: Representations & Reasoning Systems (2.2)
Chapter 2 & 3: A Representation & Reasoning System & Using Definite Knowledge Representations & Reasoning Systems (RRS) (2.2) Simplifying Assumptions of the Initial RRS (2.3) Datalog (2.4) Semantics (2.5)
Deduction Rule System vs Production Rule System. Prof. Bob Berwick. Rules Rule
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2003 Recitation 2, September 11/12 Rules Rule Prof. Bob Berwick Agenda
What is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
Chapter 16. Logic Programming Languages ISBN
Chapter 16 Logic Programming Languages ISBN 0-321-49362-1 Chapter 16 Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic Programming
Markov Logic: Representation
Markov Logic: Representation Overview Statistical relational learning Markov logic Basic inference Basic learning Statistical Relational Learning Goals: Combine (subsets of) logic and probability into
Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) 6.1 Instructional Objective Students should understand the advantages of first order logic as a knowledge representation language Students
CSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
CSE 473 Lecture 12 Chapter 8. First-Order Logic. CSE AI faculty
CSE 473 Lecture 12 Chapter 8 First-Order Logic CSE AI faculty What s on our menu today? First-Order Logic Definitions Universal and Existential Quantifiers Skolemization Unification 2 Propositional vs.
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
Knowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
CS 416, Artificial Intelligence Midterm Examination Fall 2004
CS 416, Artificial Intelligence Midterm Examination Fall 2004 Name: This is a closed book, closed note exam. All questions and subquestions are equally weighted. Introductory Material 1) True or False:
Overview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
SECTION 1.5: LOGIC PROGRAMMING
SECTION 1.5: LOGIC PROGRAMMING William DeMeo williamdemeo@gmail.com University of South Carolina February 7, 2013 SPECIFYING FACTS AND RULES We populate our Prolog database with facts using predicates,
ECE Spring 2018 Problem Set #2 Due: 3/14/18
ECE 45234 - Spring 2018 Problem Set #2 Due: 3/14/18 The purpose of this problem set is to gain experience with logic-based methods. In the engineering design section you will be simulating the wumpus world.
Logic and its Applications
Logic and its Applications Edmund Burke and Eric Foxley PRENTICE HALL London New York Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Contents Preface xiii Propositional logic 1 1.1 Informal introduction
First-Order Predicate Logic. CSCI 5582, Fall 2007
First-Order Predicate Logic CSCI 5582, Fall 2007 What Can t We Do in FOPL? We can t take anything back once we ve asserted it. We can t make statements about relations themselves (e.g., Brother is a commutative
Logical reasoning systems
Logical reasoning systems Theorem provers and logic programming languages Production systems Frame systems and semantic networks Description logic systems CS 561, Session 19 1 Logical reasoning systems
logic with quantifiers (informally)
EDAA40 Discrete Structures in Computer Science 8: Quantificational logic Jörn W. Janneck, Dept. of Computer Science, Lund University logic with quantifiers (informally) Given a logical formula that depends
Propositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
CSE 311: Foundations of Computing. Lecture 8: Predicate Logic Proofs
CSE 311: Foundations of Computing Lecture 8: Predicate Logic Proofs Last class: Propositional Inference Rules Two inference rules per binary connective, one to eliminate it and one to introduce it Elim
Introduction to Logic Programming
Introduction to Logic Programming York University CSE 3401 Vida Movahedi York University CSE 3401 V. Movahedi 1 Overview Programming Language Paradigms Logic Programming Functional Programming Brief review
Propositional Logic Formal Syntax and Semantics. Computability and Logic
Propositional Logic Formal Syntax and Semantics Computability and Logic Syntax and Semantics Syntax: The study of how expressions are structured (think: grammar) Semantics: The study of the relationship
Formal Predicate Calculus. Michael Meyling
Formal Predicate Calculus Michael Meyling May 24, 2013 2 The source for this document can be found here: http://www.qedeq.org/0_04_07/doc/math/qedeq_formal_logic_v1.xml Copyright by the authors. All rights
Practice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
Integrity Constraints (Chapter 7.3) Overview. Bottom-Up. Top-Down. Integrity Constraint. Disjunctive & Negative Knowledge. Proof by Refutation
CSE560 Class 10: 1 c P. Heeman, 2010 Integrity Constraints Overview Disjunctive & Negative Knowledge Resolution Rule Bottom-Up Proof by Refutation Top-Down CSE560 Class 10: 2 c P. Heeman, 2010 Integrity
Diagnosis through constrain propagation and dependency recording. 2 ATMS for dependency recording
Diagnosis through constrain propagation and dependency recording 2 ATMS for dependency recording Fundamentals of Truth Maintenance Systems, TMS Motivation (de Kleer): for most search tasks, there is a
Logic as a Programming Language
Logic as a Programming Language! Logic can be considered the oldest programming language! Aristotle invented propositional logic over 2000 years ago in order to prove properties of formal arguments! Propositions
Logic: TD as search, Datalog (variables)
Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from Chpt 12) June, 8, 2017 CPSC 322, Lecture 23 Slide 1 Lecture Overview Recap Top
PdOd Kev Events I Re-world war I1 rwa
I PdOd Kev Events I Re-world war I rwa LECTURE: Knowledge Representation Overview 0 'Qpes of knowledge: objects, events, meta-knowledge, etc. 0 Characteristics of representation: expressive adequacy vs.
Constraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems
Constraint Processing Offers Improved Expressiveness and Inference for Interactive Expert Systems James Bowen Cork Constraint Computation Centre UCC, Cork, Ireland Email: j.bowen@4c.ucc.ie Abstract. Expert
Chapter 16. Logic Programming Languages ISBN
Chapter 16 Logic Programming Languages ISBN 0-321-49362-1 Chapter 16 Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic Programming
logic importance logic importance (2) logic importance (3) specializations of logic Horn logic specializations of logic RDF and OWL
logic importance - high-level language for expressing knowledge - high expressive power - well-understood formal semantics - precise notion of logical consequence - systems that can automatically derive
CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
CPS 506 Comparative Programming Languages. Programming Language Paradigm
CPS 506 Comparative Programming Languages Logic Programming Language Paradigm Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic
CS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 16 Cornell Cinema Thursday, April 13 7:00pm Friday, April 14 7:00pm Sunday, April 16 4:30pm Cornell Cinema
Introduction to Artificial Intelligence 2 nd semester 2016/2017. Chapter 8: First-Order Logic (FOL)
Introduction to Artificial Intelligence 2 nd semester 2016/2017 Chapter 8: First-Order Logic (FOL) Mohamed B. Abubaker Palestine Technical College Deir El-Balah 1 Introduction Propositional logic is used
Logic Languages. Hwansoo Han
Logic Languages Hwansoo Han Logic Programming Based on first-order predicate calculus Operators Conjunction, disjunction, negation, implication Universal and existential quantifiers E A x for all x...
Programming Systems in Artificial Intelligence Introduction
Click to add Text Programming Systems in Artificial Intelligence Introduction Siegfried Nijssen 23/02/16 Discover thediscover world at the Leiden world University at Leiden University Programming Paradigms
CSCI 4150: Intro. to Artificial Intelligence Midterm Examination
CSCI 4150: Intro. to Artificial Intelligence Midterm Examination Tuesday October 17, 000 Name: 1 Assorted search questions The following questions explore differences in the number of nodes evaluated for
Logic Programming and Resolution Lecture notes for INF3170/4171
Logic Programming and Resolution Lecture notes for INF3170/4171 Leif Harald Karlsen Autumn 2015 1 Introduction This note will explain the connection between logic and computer programming using Horn Clauses
Derived from PROgramming in LOGic (1972) Prolog and LISP - two most popular AI languages. Prolog programs based on predicate logic using Horn clauses
Prolog Programming Derived from PROgramming in LOGic (1972) Good at expressing logical relationships between concepts Prolog and LISP - two most popular AI languages Execution of a Prolog program is a
For next Tuesday. Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday
For next Tuesday Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday Any questions? Program 1 Imperfect Knowledge What issues arise when we don t know
Introductory logic and sets for Computer scientists
Introductory logic and sets for Computer scientists Nimal Nissanke University of Reading ADDISON WESLEY LONGMAN Harlow, England II Reading, Massachusetts Menlo Park, California New York Don Mills, Ontario
15-780: Graduate AI Lecture 2. Proofs & FOL. Geoff Gordon (this lecture) Tuomas Sandholm TAs Byron Boots, Sam Ganzfried
15-780: Graduate AI Lecture 2. Proofs & FOL Geoff Gordon (this lecture) Tuomas Sandholm TAs Byron Boots, Sam Ganzfried 1 Admin 2 Audits http://www.cmu.edu/hub/forms/esg-audit.pdf 3 Matlab tutorial When
THE PREDICATE CALCULUS
2 THE PREDICATE CALCULUS Slide 2.1 2.0 Introduction 2.1 The Propositional Calculus 2.2 The Predicate Calculus 2.3 Using Inference Rules to Produce Predicate Calculus Expressions 2.4 Application: A Logic-Based
CS 561: Artificial Intelligence
CS 561: Artificial Intelligence Instructor: TAs: Sofus A. Macskassy, macskass@usc.edu Nadeesha Ranashinghe (nadeeshr@usc.edu) William Yeoh (wyeoh@usc.edu) Harris Chiu (chiciu@usc.edu) Lectures: MW 5:00-6:20pm,
Introduction to predicate calculus
Logic Programming Languages Logic programming systems allow the programmer to state a collection of axioms from which theorems can be proven. Express programs in a form of symbolic logic Use a logical
6.034 Notes: Section 11.1
6.034 Notes: Section 11.1 Slide 11.1.1 We've now spent a fair bit of time learning about the language of first-order logic and the mechanisms of automatic inference. And, we've also found that (a) it is
Towards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
First Order Logic and Resolution
Artificial Intelligence CS 6364 Professor Dan Moldovan Section 6 First Order Logic and Resolution First Order Logic (First Order Predicate Calculus) n n There is need to access components of a sentence.
CSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Computation Club: Gödel s theorem
Computation Club: Gödel s theorem The big picture mathematicians do a lot of reasoning and write a lot of proofs formal systems try to capture the ideas of reasoning and proof in a purely mechanical set
15-780: Graduate AI Lecture 2. Proofs & FOL. Geoff Gordon (this lecture) Tuomas Sandholm TAs Byron Boots, Sam Ganzfried
15-780: Graduate AI Lecture 2. Proofs & FOL Geoff Gordon (this lecture) Tuomas Sandholm TAs Byron Boots, Sam Ganzfried 1 Admin 2 Audits http://www.cmu.edu/hub/forms/esg-audit.pdf 3 Review 4 What is AI?
Introduction & Review
Introduction & Review York University Department of Computer Science and Engineering 1 Why this course? Overview Programming Language Paradigms Brief review of Logic Propositional logic Predicate logic
First-Order Logic (FOL)
First-Order Logic (FOL) FOL consists of the following parts: Objects/terms Quantified variables Predicates Logical connectives Implication Objects/Terms FOL is a formal system that allows us to reason
Set 7: Predicate logic Chapter 8 R&N. ICS 271 Fall 2015
Set 7: Predicate logic Chapter 8 R&N ICS 271 Fall 2015 Outline New ontology objects, relations, properties, functions New Syntax Constants, predicates, properties, functions New semantics meaning of new
Using first order logic (Ch. 8-9)
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation
Deductive Methods, Bounded Model Checking
Deductive Methods, Bounded Model Checking http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Deductive methods Pavel Parízek Deductive Methods, Bounded
Automated Reasoning. Natural Deduction in First-Order Logic
Automated Reasoning Natural Deduction in First-Order Logic Jacques Fleuriot Automated Reasoning Lecture 4, page 1 Problem Consider the following problem: Every person has a heart. George Bush is a person.
Recap Datalog Datalog Syntax Datalog Semantics. Logic: Datalog. CPSC 322 Logic 6. Textbook Logic: Datalog CPSC 322 Logic 6, Slide 1
Logic: Datalog CPSC 322 Logic 6 Textbook 12.2 Logic: Datalog CPSC 322 Logic 6, Slide 1 Lecture Overview 1 Recap 2 Datalog 3 Datalog Syntax 4 Datalog Semantics Logic: Datalog CPSC 322 Logic 6, Slide 2 Top-down
Th(N, +) is decidable
Theorem 6.12 Th(N, +) is decidable Presented by: Brian Lee Two Domains 1. We can give an algorithm to decide truth 2. A problem is undecidable First Order Logic Also known as First order predicate calculus
Using first order logic (Ch. 8-9)
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation
T H E S I S. Rule-based query answering method for a knowledge base of economic crimes
Poznan University of Technology T H E S I S to obtain the degree of Doctor of Philosophy at the Council of the Faculty of Computing by Jarosław Ksawery BAK Rule-based query answering method for a knowledge
Question 1: 25% of students lost more than 2 points Question 2: 50% of students lost 2-4 points; 50% got it entirely correct Question 3: 95% of
Question 1: 25% of students lost more than 2 points Question 2: 50% of students lost 2-4 points; 50% got it entirely correct Question 3: 95% of students got this problem entirely correct Question 4: Only
Propositional logic (Ch. 7)
Propositional logic (Ch. 7) Announcements Writing 3 due Sunday - ideally use for project - if you haven't decided project by then, you will have to redo this work Logic: definitions We say that two sentences
Answers. The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 3 MODULE, AUTUMN SEMESTER KNOWLEDGE REPRESENTATION AND REASONING
Answers The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 3 MODULE, AUTUMN SEMESTER 2016-2017 KNOWLEDGE REPRESENTATION AND REASONING Time allowed TWO hours Candidates may complete the front
DATABASE THEORY. Lecture 11: Introduction to Datalog. TU Dresden, 12th June Markus Krötzsch Knowledge-Based Systems
DATABASE THEORY Lecture 11: Introduction to Datalog Markus Krötzsch Knowledge-Based Systems TU Dresden, 12th June 2018 Announcement All lectures and the exercise on 19 June 2018 will be in room APB 1004
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 37 Resolution Rules
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 37 Resolution Rules If some literals can be unified, the same algorithm should be able
2SAT Andreas Klappenecker
2SAT Andreas Klappenecker The Problem Can we make the following boolean formula true? ( x y) ( y z) (z y)! Terminology A boolean variable is a variable that can be assigned the values true (T) or false
Introduction to Logic Programming
Introduction to Logic Programming Foundations, First-Order Language Temur Kutsia RISC, Johannes Kepler University Linz, Austria kutsia@risc.jku.at What is a Logic Program Logic program is a set of certain
For Wednesday. No reading Chapter 9, exercise 9. Must be proper Horn clauses
For Wednesday No reading Chapter 9, exercise 9 Must be proper Horn clauses Same Variable Exact variable names used in sentences in the KB should not matter. But if Likes(x,FOPC) is a formula in the KB,
What is a Logic Program. Introduction to Logic Programming. Introductory Examples. Introductory Examples. Foundations, First-Order Language
What is a Logic Program Introduction to Logic Programming Foundations, First-Order Language Temur Kutsia Research Institute for Symbolic Computation Johannes Kepler University Linz, Austria kutsia@risc.jku.at