Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form.
|
|
- Moris Doyle
- 5 years ago
- Views:
Transcription
1 Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form. Valentin Stockholm University October 2016
2 Revision: CNF and DNF of propositional formulae A literal is a propositional variable or its negation. An elementary disjunction is a disjunction of literals. An elementary conjunction is a conjunction of literals. A disjunctive normal form (DNF) is a disjunction of elementary conjunctions. A conjunctive normal form (CNF) is a conjunction of elementary disjunctions.
3 Conjunctive and disjunctive normal forms of first-order formulae An open first-order formula is in disjunctive normal form (resp., conjunctive normal form) if it is a first-order instance of a propositional formula in DNF (resp. CNF), obtained by uniform substitution of atomic formulae for propositional variables. Examples: ( P(x) Q(x, y)) (P(x) R(y)) is in CNF, as it is a first-order instance of ( p q) (p r); (P(x) Q(x, y) R(y)) P(x) is in DNF, as it is a first-order instance of ( p q r) p. and are not in either CNF or DNF. xp(x) Q(x, y) P(x) (Q(x, y) R(y)) R(y)
4 Prenex normal forms A first-order formula Q 1 x 1...Q n x n A, where Q 1,..., Q n are quantifiers and A is an open formula, is in a prenex form. The quantifier string Q 1 x 1...Q n x n is called the prefix, and the formula A is the matrix of the prenex form. Examples: is in prenex form, while x y(x > 0 (y > 0 x = y 2 )) x(x = 0) y(y < 0) and are not in prenex form. x(x > 0 y(y > 0 x = y 2 ))
5 Prenex conjunctive and disjunctive normal forms If A is in DNF then Q 1 x 1...Q n x n A is in prenex disjunctive normal form (PDNF); if A is in CNF then Q 1 x 1...Q n x n A is in prenex conjunctive normal form (PCNF). Examples: is both in PDNF and in PCNF. is in PDNF, but not in PCNF. x y( x > 0 y > 0) x y( x > 0 (y > 0 x = y 2 )) x y( P(x) (Q(x, y) R(y)) R(y)) is neither in PCNF nor in PDNF.
6 Transformation to prenex normal forms THEOREM: Every first-order formula is equivalent to a formula in a prenex disjunctive normal form (PDNF) and to a formula in a prenex conjunctive normal form (PCNF). Here is an algorithmic procedure: 1. Eliminate all occurrences of and. 2. Import all negations inside all other logical connectives. 3. Use the equivalences: (a) xp xq x(p Q), (b) xp xq x(p Q), to pull some quantifiers outwards and, after renaming one of the bound variables if necessary.
7 Transformation to prenex normal forms cont d 4. To pull all quantifiers in front of the formula and thus transform it into a prenex form, use the following equivalences, where x is not free in Q: (c) (d) (e) (f) xp Q Q xp x(p Q), xp Q Q xp x(p Q), xp Q Q xp x(p Q), xp Q Q xp x(p Q), If necessary, use renaming in order to apply these. Example: Better: xp(x) xq(x) x(p(x) xq(x)) x(p(x) yq(y)) x y(p(x) Q(y)). xp(x) xq(x) x( xp(x) Q(x)) x( yp(y) Q(x)) x y(p(y) Q(x)). 5. Finally, transform the matrix in a DNF or CNF, just like a propositional formula.
8 Transformation to prenex normal forms: example A = z( xq(x, z) xp(x)) ( xp(x) x zq(z, x)). 1. Eliminating : A z( xq(x, z) xp(x)) ( xp(x) x zq(z, x)) 2. Importing the negation: A z( xq(x, z) xp(x)) ( xp(x) x zq(z, x)) z( x Q(x, z) x P(x)) ( xp(x) x z Q(z, x)). 3. Using the equivalences (a) and (b): A z x( Q(x, z) P(x)) x(p(x) z Q(z, x)). 4. Renaming: A z x( Q(x, z) P(x)) y(p(y) w Q(w, y)). 5. Using the equivalences (c)-(f) to pull the quantifiers in front: A z x y w(( Q(x, z) P(x)) P(y) Q(w, y)). 6. The resulting formula is in a prenex DNF. For a prenex CNF we have to distribute the over : A z x y w(( Q(x, z) P(y) Q(w, y)) ( P(x) P(y) Q(w, y))).
9 Skolemization I: Skolem constants Skolemization: procedure for systematic elimination of the existential quantifiers in a first-order formula in a prenex form, by introducing new constant and functional symbols, called Skolem constants and Skolem functions, in the formula. Simple case: the result of Skolemization of the formula x y za is the formula y za[c/x], where c is a new (Skolem) constant. For instance, the result of Skolemization of the formula x y z(p(x, y) Q(x, z)) is y z(p(c, y) Q(c, z)). More generally, the result of Skolemization of the formula x 1 x k y 1 y n A is y 1 y n A[c 1 /x 1,..., c k /x k ], where c 1,..., c k are new (Skolem) constants. Note that the resulting formula is not equivalent to the original one, but is equally satisfiable with it.
10 Skolemization II: Skolem functions The result of Skolemization of y zp(y, z) is yp(y, f (y)), where f is a new unary function, called Skolem function. More generally, the result of Skolemization of y x 1 x k y 1 y n A is y y 1 y n A[f 1 (y)/x 1,..., f k (y)/x k ], where f 1,..., f k are new Skolem functions. The result of Skolemization of is x y z ua(x, y, z, u) x za[x, f (x)/y, z, g(x, z)/u), where f is a new unary Skolem function and g is a new binary Skolem function.
11 Skolemization III: the general case In the general case of Skolemization, the existential quantifiers are eliminated one by one, from left to right, by introducing at every step a Skolem function depending on all existentially quantified variables to the left of the existential quantifier that is being eliminated: is transformed to x 1... x k ya(x 1,..., x k, y,...) x 1... x k A(x 1,..., x k, y,...)[f (x 1,..., x k )/y] where f is a new k-ary Skolem function. Thus, eventually, all existential quantifiers are eliminated. Again, the resulting formula after Skolemization is generally not equivalent to the original one, but is equally satisfiable with it.
12 Clausal form of first-order formulae A literal is an atomic formula or a negation of an atomic formula. Examples: P(x), P(f (c, g(y))), Q (f (x, g(c)), g(g(g(y)))). A clause is a set of literals. Example: {P(x), P(f (c, g(y))), Q(f (x, g(c)), g(g(g(y))))}. A clausal form is a set of clauses. Example: { {P(x)}, { P(f (c)), Q(g(x, x), y)}, { P(f (y)), P(f (c)), Q(y, f (x))} }.
13 The logical meaning of first-order clauses All variables in a clause are assumed to be universally quantified. Thus, a clause represents the universal closure of the disjunction of literals in it. Example: {P(x), P(f (c, g(y))), Q(f (x, g(c)), g(g(g(y))))} represents ( ) x y P(x) P(f (c, g(y))) Q(f (x, g(c)), g(g(g(y)))) The universal quantifiers will hereafter be omitted.
14 The logical meaning of sets of first-order clauses A set of clauses represents the conjunction of the (formulae represented by the) clauses contained in it. Example: the set { } {P(x)}, { P(f (c)), Q(x, y)}, { P(f (y)), Q(y, f (x))} represents the formula xp(x) x y ( P(f (c)) Q(x, y) ) x y ( P(f (y)) Q(y, f (x)) ). Hereafter we will assume that no two clauses in a clausal form share common variables, which can always be achieved by means of renaming. Thus, the clausal form above can be re-written as: { } {P(x)}, { P(f (c)), Q(x 1, y 1)}, { P(f (y 2)), Q(y 2, f (x 2))} representing the formula xp(x) x 1 y 1 ( P(f (c)) Q(x1, y 1) ) x 2 y 2 ( P(f (y2)) Q(y 2, f (x 2)) ). Because distributes over, after the renaming the clausal form also represent the universal closure of the conjunction of the disjunctions represented by the clauses contained in it: x x 1 y 1 x 2 y 2 (P(x) ( P(f (c)) Q(x 1, y 1) ) ( P(f (y 2)) Q(y 2, f (x 2)) )).
15 Transformation of first-order formulae to clausal form Theorem: Every set of first-order formulae {A 1,..., A n } can be transformed to a set of clauses {C 1,..., C k } where no two clauses share common variables, such that {A 1,..., A n } is equally satisfiable with the universal closure (C 1 C k ) of the conjunction of all clauses, each taken as disjunction of its literals. The algorithm applies to each formula A {A 1,..., A n } as follows: 1. Transform A to a prenex CNF. 2. Eliminate all existential quantifiers by introducing Skolem constants or functions. 3. Remove all universal quantifiers. 4. Write the matrix (which is in CNF) as a set of clauses. Finally, apply in the union of all sets of clauses produced as above renaming of variables occurring in more than one clause.
1 Introduction to Predicate Resolution
1 Introduction to Predicate Resolution The resolution proof system for Predicate Logic operates, as in propositional case on sets of clauses and uses a resolution rule as the only rule of inference. The
More informationExercises 1 - Solutions
Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note
More informationLogic: First Order Logic
Logic: First Order Logic Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More informationResolution: Motivation
Resolution: Motivation Steps in inferencing (e.g., forward-chaining) 1. Define a set of inference rules 2. Define a set of axioms 3. Repeatedly choose one inference rule & one or more axioms (or premices)
More informationNormal Forms for First-Order Logic
Logic and Proof Hilary 2016 James Worrell Normal Forms for First-Order Logic In this lecture we show how to transform an arbitrary formula of first-order logic to an equisatisfiable formula in Skolem form.
More informationCOMP9414: Artificial Intelligence First-Order Logic
COMP9414, Wednesday 13 April, 2005 First-Order Logic 2 COMP9414: Artificial Intelligence First-Order Logic Overview Syntax of First-Order Logic Semantics of First-Order Logic Conjunctive Normal Form Wayne
More informationSome Rewriting Systems as a Background of Proving Methods
Some Rewriting Systems as a Background of Proving Methods Katalin Pásztor Varga Department of General Computer Science Eötvös Loránd University e-mail: pkata@ludens.elte.hu Magda Várterész Institute of
More informationLogic Part I: Classical Logic and Its Semantics
Logic Part I: Classical Logic and Its Semantics Max Schäfer Formosan Summer School on Logic, Language, and Computation 2007 July 2, 2007 1 / 51 Principles of Classical Logic classical logic seeks to model
More informationAAA615: Formal Methods. Lecture 2 First-Order Logic
AAA615: Formal Methods Lecture 2 First-Order Logic Hakjoo Oh 2017 Fall Hakjoo Oh AAA615 2017 Fall, Lecture 2 September 24, 2017 1 / 29 First-Order Logic An extension of propositional logic with predicates,
More informationCHAPTER 10. Predicate Automated Proof Systems
CHAPTER 10 ch10 Predicate Automated Proof Systems We define and discuss here a Rasiowa and Sikorski Gentzen style proof system QRS for classical predicate logic. The propositional version of it, the RS
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More informationOutline. Logic. Definition. Theorem (Gödel s Completeness Theorem) Summary of Previous Week. Undecidability. Unification
Logic Aart Middeldorp Vincent van Oostrom Franziska Rapp Christian Sternagel Department of Computer Science University of Innsbruck WS 2017/2018 AM (DCS @ UIBK) week 11 2/38 Definitions elimination x φ
More informationDisjunction/Conjunction Normal Form
Normal Forms Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper manner. E.g. ((p q) ( p r)) pq r is a disjunction
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationNormal Forms Note: all ppts about normal forms are skipped.
Normal Forms Note: all ppts about normal forms are skipped. Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationThe predicate calculus is complete
The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,
More informationFirst-Order Logic. Resolution
First-Order Logic Resolution 1 Resolution for predicate logic Gilmore s algorithm is correct and complete, but useless in practice. We upgrade resolution to make it work for predicate logic. 2 Recall:
More information2. Use quantifiers to express the associative law for multiplication of real numbers.
1. Define statement function of one variable. When it will become a statement? Statement function is an expression containing symbols and an individual variable. It becomes a statement when the variable
More informationα-formulas β-formulas
α-formulas Logic: Compendium http://www.ida.liu.se/ TDDD88/ Andrzej Szalas IDA, University of Linköping October 25, 2017 Rule α α 1 α 2 ( ) A 1 A 1 ( ) A 1 A 2 A 1 A 2 ( ) (A 1 A 2 ) A 1 A 2 ( ) (A 1 A
More informationConvert to clause form:
Convert to clause form: Convert the following statement to clause form: x[b(x) ( y [ Q(x,y) P(y) ] y [ Q(x,y) Q(y,x) ] y [ B(y) E(x,y)] ) ] 1- Eliminate the implication ( ) E1 E2 = E1 E2 x[ B(x) ( y [
More informationA DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any
Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»
More informationINF3170 / INF4171 Notes on Resolution
INF3170 / INF4171 Notes on Resolution Andreas Nakkerud Autumn 2015 1 Introduction This is a short description of the Resolution calculus for propositional logic, and for first order logic. We will only
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationComputational Logic. Recall of First-Order Logic. Damiano Zanardini
Computational Logic Recall of First-Order Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic
More informationPart 2: First-Order Logic
Part 2: First-Order Logic First-order logic formalizes fundamental mathematical concepts is expressive (Turing-complete) is not too expressive (e. g. not axiomatizable: natural numbers, uncountable sets)
More informationCOMP4418: Knowledge Representation and Reasoning First-Order Logic
COMP4418: Knowledge Representation and Reasoning First-Order Logic Maurice Pagnucco School of Computer Science and Engineering University of New South Wales NSW 2052, AUSTRALIA morri@cse.unsw.edu.au COMP4418
More informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More informationIntroduction to Logic in Computer Science: Autumn 2007
Introduction to Logic in Computer Science: Autumn 2007 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Tableaux for First-order Logic The next part of
More informationSyntax of FOL. Introduction to Logic in Computer Science: Autumn Tableaux for First-order Logic. Syntax of FOL (2)
Syntax of FOL Introduction to Logic in Computer Science: Autumn 2007 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam The syntax of a language defines the way in which
More information2-4: The Use of Quantifiers
2-4: The Use of Quantifiers The number x + 2 is an even integer is not a statement. When x is replaced by 1, 3 or 5 the resulting statement is false. However, when x is replaced by 2, 4 or 6 the resulting
More informationTwo Posts to Fill On School Board
Y Y 9 86 4 4 qz 86 x : ( ) z 7 854 Y x 4 z z x x 4 87 88 Y 5 x q x 8 Y 8 x x : 6 ; : 5 x ; 4 ( z ; ( ) ) x ; z 94 ; x 3 3 3 5 94 ; ; ; ; 3 x : 5 89 q ; ; x ; x ; ; x : ; ; ; ; ; ; 87 47% : () : / : 83
More informationPropositional Resolution
Artificial Intelligence Propositional Resolution Marco Piastra Propositional Resolution 1] Deductive systems and automation Is problem decidible? A deductive system a la Hilbert (i.e. derivation using
More informationClausal Presentation of Theories in Deduction Modulo
Gao JH. Clausal presentation of theories in deduction modulo. JOURNAL OF COMPUTER SCIENCE AND TECHNOL- OGY 28(6): 1085 1096 Nov. 2013. DOI 10.1007/s11390-013-1399-0 Clausal Presentation of Theories in
More informationPredicate Logic. Bow-Yaw Wang. Institute of Information Science Academia Sinica, Taiwan. November 22, 2017
Predicate Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan November 22, 2017 Bow-Yaw Wang (Academia Sinica) Predicate Logic November 22, 2017 1 / 157 8 The Coq Proof Assistant
More informationLOWELL WEEKLY JOURNAL
Y G y G Y 87 y Y 8 Y - $ X ; ; y y q 8 y $8 $ $ $ G 8 q < 8 6 4 y 8 7 4 8 8 < < y 6 $ q - - y G y G - Y y y 8 y y y Y Y 7-7- G - y y y ) y - y y y y - - y - y 87 7-7- G G < G y G y y 6 X y G y y y 87 G
More informationCS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:
x NOT ~x x y AND x /\ y x y OR x \/ y Figure 1: Types of gates in a digital circuit. CS2742 midterm test 2 study sheet Boolean circuits: Boolean circuits is a generalization of Boolean formulas in which
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationLogic for Computer Scientists
Logic for Computer Scientists Pascal Hitzler http://www.pascal-hitzler.de CS 499/699 Lecture, Winter Quarter 2011 Wright State University, Dayton, OH, U.S.A. [final version: 03/10/2011] Contents 1 Propositional
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationLogic for Computer Scientists
Logic for Computer Scientists Pascal Hitzler http://www.pascal-hitzler.de CS 499/699 Lecture, Spring Quarter 2010 Wright State University, Dayton, OH, U.S.A. Final version. Contents 1 Propositional Logic
More informationFormal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures
Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,
More informationNew Techniques in Clausal Form Generation
This space is reserved for the EPiC Series header, do not use it New Techniques in Clausal Form Generation Giles Reger 1, Martin Suda 2, and Andrei Voronkov 1,3,4, 1 University of Manchester, Manchester,
More informationReasoning with Quantified Boolean Formulas
Reasoning with Quantified Boolean Formulas Martina Seidl Institute for Formal Models and Verification Johannes Kepler University Linz 1 What are QBF? Quantified Boolean formulas (QBF) are formulas of propositional
More information06 From Propositional to Predicate Logic
Martin Henz February 19, 2014 Generated on Wednesday 19 th February, 2014, 09:48 1 Syntax of Predicate Logic 2 3 4 5 6 Need for Richer Language Predicates Variables Functions 1 Syntax of Predicate Logic
More informationHandout Proof Methods in Computer Science
Handout Proof Methods in Computer Science Sebastiaan A. Terwijn Institute of Logic, Language and Computation University of Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam the Netherlands terwijn@logic.at
More informationOWELL WEEKLY JOURNAL
Y \»< - } Y Y Y & #»»» q ] q»»»>) & - - - } ) x ( - { Y» & ( x - (» & )< - Y X - & Q Q» 3 - x Q Y 6 \Y > Y Y X 3 3-9 33 x - - / - -»- --
More informationCSC384: Intro to Artificial Intelligence Knowledge Representation II. Required Readings: 9.1, 9.2, and 9.5 Announcements:
CSC384: Intro to Artificial Intelligence Knowledge Representation II Required Readings: 9.1, 9.2, and 9.5 Announcements: 1 Models Examples. Environment A Language (Syntax) Constants: a,b,c,e Functions:
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationLogic for Computer Scientists
Logic for Computer Scientists Pascal Hitzler http://www.pascal-hitzler.de CS 499/699 Lecture, Winter Quarter 2012 Wright State University, Dayton, OH, U.S.A. [version: 03/01/2012] Contents 1 Propositional
More informationIntroduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1)
Introduction to Predicate Logic Part 1 Professor Anita Wasilewska Lecture Notes (1) Introduction Lecture Notes (1) and (2) provide an OVERVIEW of a standard intuitive formalization and introduction to
More informationFirst-Order Theorem Proving and Vampire. Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester)
First-Order Theorem Proving and Vampire Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) Outline Introduction First-Order Logic and TPTP Inference Systems
More informationTransparencies to accompany Rosen, Discrete Mathematics and Its Applications Section 1.3. Section 1.3 Predicates and Quantifiers
Section 1.3 Predicates and Quantifiers A generalization of propositions - propositional functions or predicates.: propositions which contain variables Predicates become propositions once every variable
More informationPredicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo
Predicate Logic CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 22 Outline 1 From Proposition to Predicate
More informationREADME - Syntax. Skolemization. Skolemization - Example 1. Skolemization - Example 1. Skolemization - Example 1. Skolemization - Example 2
README - Syntax Skolemization Logical implication is commonly included in the syntax of first-order and propositional logical languages. The symbol used to denote logical implication differs from language
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More informationFirst-Order Logic (FOL)
First-Order Logic (FOL) Also called Predicate Logic or Predicate Calculus 2. First-Order Logic (FOL) FOL Syntax variables x, y, z, constants a, b, c, functions f, g, h, terms variables, constants or n-ary
More informationIntroduction to Logic
Introduction to Logic Alwen Tiu The Australian National University Summer Schools in Logic and Learning 26 January 6 February 2009, Canberra Alwen Tiu (ANU) Introduction to Logic SSLL 2009 1 / 101 Logic
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
More informationCSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication
CSE20: Discrete Mathematics for Computer Science Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication Disjunctive normal form Example: Let f (x, y, z) =xy z. Write this function in DNF. Minterm
More informationFirst order logic. Example The deduction of statements: This reasoning is intuitively correct. Every man is mortal. Since Ade is a man, he is mortal.
First Order Logic In the propositional logic, the most basic elements are atoms. Through atoms we build up formulas. We then use formulas to express various complex ideas. In this simple logic, an atom
More informationQuantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.
Quantifiers 1-17-2008 Here is a (true) statement about real numbers: Every real number is either rational or irrational. I could try to translate the statement as follows: Let P = x is a real number Q
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationAutomated Reasoning in First-Order Logic
Automated Reasoning in First-Order Logic Peter Baumgartner http://users.cecs.anu.edu.au/~baumgart/ 7/11/2011 Automated Reasoning in First-Order Logic... First-Order Logic Can express (mathematical) structures,
More informationLogic: First Order Logic (Part I)
Logic: First Order Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationFormal (Natural) Deduction for Predicate Calculus
Formal (Natural) Deduction for Predicate Calculus Lila Kari University of Waterloo Formal (Natural) Deduction for Predicate Calculus CS245, Logic and Computation 1 / 42 Formal deducibility for predicate
More informationComputational Logic Automated Deduction Fundamentals
Computational Logic Automated Deduction Fundamentals 1 Elements of First-Order Predicate Logic First Order Language: An alphabet consists of the following classes of symbols: 1. variables denoted by X,
More informationCS156: The Calculus of Computation Zohar Manna Winter 2010
Page 3 of 35 Page 4 of 35 quantifiers CS156: The Calculus of Computation Zohar Manna Winter 2010 Chapter 2: First-Order Logic (FOL) existential quantifier x. F [x] there exists an x such that F [x] Note:
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationAgenda Artificial Intelligence. Let s Talk About the Wumpus Instead? Let s Talk About Blocks, Baby...
Agenda Artificial Intelligence 12. Predicate Logic Reasoning, Part I: Basics Do You Think About the World in Terms of Propositions? 1 Introduction Álvaro Torralba Wolfgang Wahlster 2 Syntax 3 Semantics
More informationhttps://vu5.sfc.keio.ac.jp/slide/
1 FUNDAMENTALS OF LOGIC NO.7 PREDICATE LOGIC Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical Connectives (,,, ) Truth Table Tautology
More informationIncomplete version for students of easllc2012 only. 6.6 The Model Existence Game 99
98 First-Order Logic 6.6 The Model Existence Game In this section we learn a new game associated with trying to construct a model for a sentence or a set of sentences. This is of fundamental importance
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationCS206 Lecture 03. Propositional Logic Proofs. Plan for Lecture 03. Axioms. Normal Forms
CS206 Lecture 03 Propositional Logic Proofs G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 12 Fri, Jan 03, 2003 Plan for Lecture 03 Axioms
More informationResolution for Predicate Logic
Resolution for Predicate Logic The connection between general satisfiability and Herbrand satisfiability provides the basis for a refutational approach to first-order theorem proving. Validity of a first-order
More informationResolution for Predicate Logic
Logic and Proof Hilary 2016 James Worrell Resolution for Predicate Logic A serious drawback of the ground resolution procedure is that it requires looking ahead to predict which ground instances of clauses
More informationSolutions to Homework I (1.1)
Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p
More informationarxiv: v1 [cs.lo] 1 Sep 2017
A DECISION PROCEDURE FOR HERBRAND FORMULAE WITHOUT SKOLEMIZATION arxiv:1709.00191v1 [cs.lo] 1 Sep 2017 TIMM LAMPERT Humboldt University Berlin, Unter den Linden 6, D-10099 Berlin e-mail address: lampertt@staff.hu-berlin.de
More informationLogic. Foundations of First Order Logic. franconi. Enrico Franconi
(1/41) Logic Foundations of First Order Logic Enrico Franconi franconi@inf.unibz.it http://www.inf.unibz.it/ franconi Faculty of Computer Science, Free University of Bozen-Bolzano (2/41) Motivation We
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationLogic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationMODEL THEORY FOR ALGEBRAIC GEOMETRY
MODEL THEORY FOR ALGEBRAIC GEOMETRY VICTOR ZHANG Abstract. We demonstrate how several problems of algebraic geometry, i.e. Ax-Grothendieck, Hilbert s Nullstellensatz, Noether- Ostrowski, and Hilbert s
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Homework 2- Fall 2010 Due Date: Oct. 7 2010, 3:30 pm Proofs using Predicate Logic For all your predicate logic proofs you can use only the rules given in the following tables.
More informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationOn my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
More informationDiscrete Mathematics
Department of Mathematics National Cheng Kung University 2008 2.4: The use of Quantifiers Definition (2.5) A declarative sentence is an open statement if 1) it contains one or more variables, and 1 ) quantifier:
More informationUnit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics
Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationAutomated Reasoning Lecture 5: First-Order Logic
Automated Reasoning Lecture 5: First-Order Logic Jacques Fleuriot jdf@inf.ac.uk Recap Over the last three lectures, we have looked at: Propositional logic, semantics and proof systems Doing propositional
More informationPredicate Logic - Deductive Systems
CS402, Spring 2018 G for Predicate Logic Let s remind ourselves of semantic tableaux. Consider xp(x) xq(x) x(p(x) q(x)). ( xp(x) xq(x) x(p(x) q(x))) xp(x) xq(x), x(p(x) q(x)) xp(x), x(p(x) q(x)) xq(x),
More informationNegation introduction
Negation introduction How do we prove a negation? P = P F -introduction {Assume} P (l-1) F { -intro on and (l-1)} (l) P -intro Negation elimination -elimination How do we use a negation in a proof? P (l)
More informationFirst-Order Theorem Proving and Vampire
First-Order Theorem Proving and Vampire Laura Kovács 1,2 and Martin Suda 2 1 TU Wien 2 Chalmers Outline Introduction First-Order Logic and TPTP Inference Systems Saturation Algorithms Redundancy Elimination
More informationPredicate Logic - Semantic Tableau
CS402, Spring 2016 Informal Construction of a Valid Formula Example 1 A valid formula: x(p(x) q(x)) ( xp(x) xq(x)) ( x(p(x) q(x)) ( xp(x) xq(x))) x(p(x) q(x)), ( xp(x) xq(x)) x(p(x) q(x)), xp(x), xq(x)
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
More informationPropositional Logic. Premises: If Jack knows Jill, then Jill knows Jack. Jack knows Jill. Conclusion: Is it the case that Jill knows Jack?
Relational Logic Propositional Logic Premises: If Jack knows Jill, then Jill knows Jack. Jack knows Jill. Conclusion: Is it the case that Jill knows Jack? Problem Premises: If one person knows another,
More informationarxiv: v2 [cs.lo] 22 Nov 2017
A DECISION PROCEDURE FOR HERBRAND FORMULAE WITHOUT SKOLEMIZATION arxiv:1709.00191v2 [cs.lo] 22 Nov 2017 TIMM LAMPERT Humboldt University Berlin, Unter den Linden 6, D-10099 Berlin e-mail address: lampertt@staff.hu-berlin.de
More information