Propositional Logic. Premises: If Jack knows Jill, then Jill knows Jack. Jack knows Jill. Conclusion: Is it the case that Jill knows Jack?
|
|
- Lesley Albert Peters
- 5 years ago
- Views:
Transcription
1 Relational Logic
2 Propositional Logic Premises: If Jack knows Jill, then Jill knows Jack. Jack knows Jill. Conclusion: Is it the case that Jill knows Jack?
3 Problem Premises: If one person knows another, then the second person knows the first. Jack knows Jill. Conclusion: Is it the case that Jill knows Jack? How do we represent the first premise in a way that allows us to derive the desired conclusion?
4 New Linguistic Features: Variables Quantifiers Relational Logic Sample Sentence: x. y.(knows(x,y) knows(y,x))
5 Programme Syntax Semantics Examples, Examples, Examples Properties of Sentences Logical Entailment Decidability
6 Syntax
7 Components of Syntax Words Terms Sentences a, b, g, p g(a,a) x.(p(x) p(x,g(x,x)))
8 Words Words are strings of letters, digits, and occurrences of the underscore character. Variables begin with characters from the end of the alphabet (from u through z). u, v, w, x, y, z Constants begin with digits or letters from the beginning of the alphabet (from a through t). a, b, c, 123, comp225, barack_obama
9 Constants Object constants represent objects. joe, stanford, usa, 2345 Relation constants represent relations. knows, loves
10 Arity The arity of a relation constant is the number of arguments it takes. Unary relation constant - 1 argument Binary relation constant - 2 arguments Ternary relation constant - 3 arguments n-ary relation constant - n arguments
11 Signatures A signature consist of a set of object constants and a set of relation constants together with a specification of arity for the relation constants. Object Constants: a, b Unary Relation Constant: p Binary Relation Constant: q
12 Terms A term is either a variable or an object constant,. Terms represent objects. Terms are analogous to noun phrases in natural language.
13 Sentences Three types of sentences in Relational Logic: Relational sentences - analogous to the simple sentences in natural language Logical sentences - analogous to the logical sentences in natural language Quantified sentences - sentences that express the significance of variables
14 Relational Sentences A relational sentence is an expression formed from an n- ary relation constant and n terms enclosed in parentheses and separated by commas. q(a,y) Relational sentences are not terms and cannot be nested in relational sentences. No! q(a,q(a,y)) No!
15 Logical Sentences Logical sentences in Herbrand Logic are analogous to those in Propositional Logic. ( q(a,b)) (p(a) p(b)) (p(a) p(b)) (q(x,y) q(y,x)) (q(x,y) q(y,x))
16 Quantified Sentences Universal sentences assert facts about all objects. ( x.(p(x) q(x,x))) Existential sentence assert the existence of objects with given properties. ( x.(p(x) q(x,x))) Quantified sentences can be nested within other sentences. ( x.p(x)) ( x.q(x,x)) ( x.( y.q(x,y)))
17 Parentheses Parentheses can be removed when precedence allows us to reconstruct sentences correctly. Precedence relations same as in Propositional Logic with quantifiers being of higher precedence than logical operators. x.p(x) q(x,x) ( x.p(x)) q(x,x) x.p(x) q(x,x) ( x.p(x)) q(x,x)
18 Ground and Non-Ground Expressions An expression is ground if and only if it contains no variables. Ground sentence: Non-Ground Sentence: p(a) x.p(x)
19 Bound and Free Variables An occurrence of a variable is bound if and only if it lies in the scope of a quantifier of that variable. Otherwise, it is free. y.q(x,y) In this example, x is free and y is bound.
20 Open and Closed Sentences A sentence is open if and only if it has free variables. Otherwise, it is closed. Open sentence: Closed Sentence: y.q(x,y) x. y.q(x,y)
21 Semantics
22 Herbrand Base The Herbrand base for a Relational language is the set of all ground relational sentences that can be formed from the vocabulary of the language.
23 Object Constants: a, b Unary Relation Constant: p Binary Relation Constant: q Herbrand Base: Example {p(a), p(b), q(a,a), q(a,b), q(b,a), q(b,b)}
24 Truth Assignment A truth assignment is an association between ground atomic sentences and the truth values true or false. As with Propositional Logic, we use 1 as a synonym for true and 0 as a synonym for false. p(a) i = 1 p(b) i = 0 q(a,a) i = 1 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0
25 Sentential Truth Assignment A sentential truth assignment is an association between arbitrary sentences in a Herbrand language and the truth values 1 and 0. Truth Assignment Sentential Truth Assignment p(a) i = 1 (p(a) p(b)) i = 1 p(b) i = 0 (p(a) p(b)) i = 1 Each base truth assignment leads to a particular sentential truth assignment based on the type of sentence.
26 Logical Sentences ( ϕ) i = 1 if and only if ϕ i = 0 (ϕ ψ) i = 1 if and only if ϕ i = 1 and ψ i = 1 (ϕ ψ) i = 1 if and only if ϕ i = 1 or ψ i = 1 (ϕ ψ) i = 1 if and only if ϕ i = 0 or ψ i = 1 (ϕ ψ) i = 1 if and only if ϕ i = ψ i
27 Instances An instance of an expression is an expression in which all free variables have been consistently replaced by ground terms. Consistent replacement here means that, if one occurrence of a variable is replaced by a ground term, then all occurrences of that variable are replaced by the same ground term.
28 Quantified Sentences A universally quantified sentence is true for a truth assignment if and only if every instance of the scope of the quantified sentence is true for that assignment. An existentially quantified sentence is true for a truth assignment if and only if some instance of the scope of the quantified sentence is true for that assignment.
29 Example Truth Assignment: p(a) i = 1 q(a,a) i = 1 p(b) i = 0 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0 Sentence: x.(p(x) q(x,x)) Instances: p(a) q(a,a) p(b) q(b,b)
30 Example Truth Assignment: p(a) i = 1 q(a,a) i = 1 p(b) i = 0 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0 Sentence: x.(p(x) q(x,x)) Instances: p(a) q(a,a) p(b) q(b,b)
31 Example Truth Assignment: p(a) i = 1 q(a,a) i = 1 p(b) i = 0 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0 Sentence: x.(p(x) q(x,x)) Instances: p(a) q(a,a) p(b) q(b,b)
32 Example Truth Assignment: p(a) i = 1 q(a,a) i = 1 p(b) i = 0 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0 Sentence: x.(p(x) q(x,x)) Instances: p(a) q(a,a) p(b) q(b,b)
33 Example Truth Assignment: p(a) i = 1 q(a,a) i = 1 p(b) i = 0 q(a,b) i = 0 q(b,a) i = 1 q(b,b) i = 0 Sentence: x. y.q(x,y) Instances: y.q(a,y) y.q(b,y) q(a,a) q(b,a) q(a,b) q(b,b)
34 Open Sentences A truth assignment satisfies a sentence with free variables if and only if it satisfies every instance of that sentence. (In other words, we can think of all free variables as being universally quantified.) ( y.q(x,y)) i = ( x. y.q(x,y)) i A truth assignment satisfies a set of sentences if and only if it satisfies every sentence in the set.
35 Example - Sorority World
36 Sorority World
37 Signature Object Constants: abby, bess, cody, dana Binary Relation Constant: likes Herbrand base has 16 ground relational sentences.
38 Data likes(abby,abby) likes(bess,abby) likes(abby,bess likes(bess,bess) likes(abby,cody) likes(bess,cody) likes(abby,dana) likes(bess,dana) likes(cody,abby) likes(dana,abby) likes(cody,bess) likes(dana,bess) likes(cody,cody) likes(dana,cody) likes(cody,dana) likes(dana,dana)
39 Sentences Abby likes everyone Bess likes. If Bess likes a girl, then Abby also likes her. y.(likes(bess,y) likes(abby,y)) Cody likes everyone who likes her. If some girl likes Cody, then Cody likes that girl. x.(likes(x,cody) likes(cody,x))
40 Sentences Cody likes somebody who likes her. There is someone who likes cody and is liked by Cody. y.(likes(cody,y) likes(y,cody)) Nobody likes herself. It is not the case that someone likes herself. x.likes(x,x)
41 Everybody likes somebody. Sentences x. y.likes(x,y) There is somebody whom everybody likes. y. x.likes(x,y)
42 Example Abby Bess Cody Dana
43 Everybody Likes Somebody Abby Bess Cody Dana
44 Everybody Likes Somebody Abby Bess Cody Dana
45 Everybody Likes Somebody Abby Bess Cody Dana
46 Everybody Likes Somebody Abby Bess Cody Dana
47 Everybody Likes Somebody Abby Bess Cody Dana
48 There is Somebody Whom Everyone Likes Abby Bess Cody Dana
49 Example - Blocks World
50 Blocks World
51 Object Constants: a, b, c, d, e Signature Unary Relation Constants: clear - blocks with no blocks on top. table - blocks on the table. Binary Relation Constants: on - pairs of blocks in which first is on the second. above - pairs in which first block is above the second. Ternary Relation Constant: stack - triples of blocks arranged in a stack.
52 Data on(a,a) on(b,a) on(c,a) on(a,b) on(b,b) on(c,b) on(a,c) on(b,c) on(c,c) on(a,d) on(b,d) on(c,d) on(a,e) on(b,e) on(c,e) on(d,a) on(e,a) on(d,b) on(e,b) on(d,c) on(e,c) on(d,d) on(e,d) on(d,e) on(e,e)
53 Definitions Definition of clear: y.(clear(y) x.on(x,y)) Definition of table: x.(table(x) y.on(x,y))
54 Definitions Definition of stack: x. y. z.(stack(x,y,z) on(x,y) on(y,z)) Definition of above: x. z.(above(x,z) on(x,z) y.(on(x,y) above(y,z))) x. above(x,x)
55 Example - Modular Arithmetic
56 Modular Arithmetic In Modular Arithmetic of modulus 4 there are just 4 numbers (0,1, 2, 3). 0+0=01+0=1 2+0=2 3+0=3 0+1=11+1=2 2+1=3 3+1=0 0+2=21+2=3 2+2=0 3+2=1 0+3=31+3=0 2+3=1 3+3=2
57 Object Constants: 0, 1, 2, 3 Signature Binary Relation Constants: same - the first and second arguments are identical next - the second argument is number after the first Ternary Relation Constant: plus - the third argument is the sum of the first two plus(1,2,3)
58 Same Ground Relational Data: same(0,0) same(1,0) same(2,0) same(3,0) same(0,1) same(1,1) same(2,1) same(3,1) same(0,2) same(1,2) same(2,2) same(3,2) same(0,3) same(1,3) same(2,3) same(3,3)
59 Next Ground Relational Data: next(0,0) next(1,0) next(2,0) next(3,0) next(0,1) next(1,1) next(2,1) next(3,1) next(0,2) next(1,2) next(2,2) next(3,2) next(0,3) next(1,3) next(2,3) next(3,3)
60 Next Ground Relational Data: next(0,1) next(1,2) next(2,3) next(3,0) Deal with negative literals by saying that all other cases are false. How do we do this?
61 Functionality Axiom For every x, there is just one y such that next(x,y): x. y. z.(next(x,y) next(x,z) same(y,z) Logically equivalent formulation: x. y. z.(next(x,y) same(y,z) next(x,z))
62 Ground Relational Data: Addition plus(0,0,0) plus(1,0,1) plus(2,0,2) plus(3,0,3) plus(0,1,1) plus(1,1,2) plus(2,1,3) plus(3,1,0) plus(0,2,2) plus(1,2,3) plus(2,2,0) plus(3,2,1) plus(0,3,3) plus(1,3,0) plus(2,3,1) plus(3,3,2) Functionality Axiom: x. y. z. w.(plus(x,y,z) plus(x,y,w) same(z,w)
63 Identity: Successor: Alternative Definition of Addition y.plus(0,y,y) x. y. z.(plus(x,y,z) next(x,x2) next(z,z2) plus(x2,y,z2)) Functionality: x. y. z. w.(plus(x,y,z) plus(x,y,w) same(z,w)
64 Properties of Sentences
65 Properties of Sentences Valid Contingent Unsatisfiable A sentence is valid if and only if every interpretation satisfies it. A sentence is contingent if and only if some interpretation satisfies it and some interpretation falsifies it. A sentence is unsatisfiable if and only if no interpretation satisfies it.
66 Properties of Sentences Valid Contingent } } A sentences is satisfiable if and only if it is either valid or contingent. A sentences is falsifiable if and only if it is contingent or unsatisfiable. Unsatisfiable
67 Logical Validities Law of the Excluded Middle: p(a) p(a) Double Negation: p(a) p(a) demorgan's Laws: (p(a) q(a,b)) ( p(a) q(a,b)) (p(a) q(a,b)) ( p(a) q(a,b))
68 Quantificational Validities Common Quantifier Reversal: x. y.q(x,y) y. x.q(x,y) x. y.q(x,y) y. x.q(x,y) Existential Distribution: y. x.q(x,y) x. y.q(x,y) Negation Distribution: x.p(x) x. p(x) x.p(x) x. p(x)
69 Logical Entailment
70 Logical Entailment A set of premises Δ logically entails a conclusion ϕ (written as Δ = ϕ) if and only if every interpretation that satisfies the premises also satisfies the conclusion. {p(a)} = (p(a) p(b)) {p(a)} # (p(a) p(b)) {p(a), p(b)} = (p(a) p(b))
71 Examples With Quantification y. x.q(x,y) = x. y.q(x,y) x. y.q(x,y) = y. x.q(x,y) x. y.q(x,y) = x. y.q(y,x)
72 Examples With Free Variables q(x,y) = q(y,x) x. y.q(x,y) = y. x.q(y,x)
73 Relational Logic and Propositional Logic
74 Mapping There is a simple procedure for mapping RL sentences to equivalent PL sentences. (1) Convert to Prenex form. (2) Compute the grounding. (3) Rewrite from FHL to PL.
75 Prenex Form A sentence is in prenex form if and only if (1) it is closed and (2) all of the quantifiers are outside of all logical operators. Sentence in Prenex Form: x. y. z.(p(x,y) q(z)) Sentences not in Prenex Form: x. y.p(x,y) y.q(y) x.(p(x,y) q(x))
76 Conversion to Prenex Form Rename duplicate variables. y.p(x,y) y.q(y) y.p(x,y) z.q(z) Distribute logical operators over quantifiers. y.p(x,y) z.q(z) y. z.(p(x,y) q(z)) Quantify any free variables. y. z.(p(x,y) q(z)) x. y. z.(p(x,y) q(z))
77 Grounding Let Δ 0 =Δ and Γ 0 ={}. On each step, process ϕ in Δ until Δ is empty. If ϕ is ground, we remove from Δ i and add to Γ i Δ i+1 = Δ i - {ϕ} Γ i+1 = Γ i {ϕ} If υ.ϕ[υ], replace on Δ i with all instances Δ i+1 = Δ i - { υ.ϕ[υ]} {ϕ[τ i ] τ i a constant} Γ i+1 = Γ i If υ.ϕ[υ], replace on Δ i with disjunction of instances Δ i+1 = Δ i - { υ.ϕ[υ]} {ϕ[τ 1 ] ϕ[τ n ]} Γ i+1 = Γ i
78 Example I Δ 0 ={p(a), x.(p(x) q(x)), x.q(x)} Γ 0 ={} Δ 1 ={ x.p(x) q(x)), x.q(x)} Γ 1 ={p(a)} Δ 2 ={p(a) q(a), p(b) q(b), x.q(x)} Γ 2 ={p(a)} Δ 3 ={p(b) q(b), x.q(x)} Γ 3 ={p(a), p(a) q(a)} Δ 4 ={ x.q(x)} Γ 4 ={p(a), p(a) q(a), p(b) q(b)}
79 Example II Δ 4 ={ x.q(x)} Γ 4 ={p(a), p(a) q(a), p(b) q(b)} Δ 5 ={q(a) q(b)} Γ 5 ={p(a), p(a) q(a), p(b) q(b)} Δ 6 ={} Γ 6 ={p(a), p(a) q(a), p(b) q(b), q(a) q(b)}
80 Renaming RL to PL Select a proposition for each ground relational sentence and rewrite the grounding from FHL to PL. FHL Grounding: {p(a), p(a) q(a), p(b) q(b), q(a) q(b)} Corresponding PL: p(a) pa q(a) qa p(b) pb q(b) qb Corresponding PL: {pa, pa qa, pb qb, qa qb}
81 Decidability Unsatisfiability and logical entailment for Propositional Logic (PL) is decidable. Given our mapping, we also know that unsatisfiability logical entailment for Relational Logic (RL) is also decidable.
82 Compactness A logic is compact if and only if every unsatisfiable set of sentences (including infinite sets) has a finite subset that is unsatisfiable. Propositional Logic is compact. Given our mapping, we know that RL must also be compact.
83
Predicate 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 informationPropositional Functions. Quantifiers. Assignment of values. Existential Quantification of P(x) Universal Quantification of P(x)
Propositional Functions Rosen (6 th Ed.) 1.3, 1.4 Propositional functions (or predicates) are propositions that contain variables. Ex: P(x) denote x > 3 P(x) has no truth value until the variable x is
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
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 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 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 informationPropositional Languages
Propositional Logic Propositional Languages A propositional signature is a set/sequence of primitive symbols, called proposition constants. Given a propositional signature, a propositional sentence is
More informationThinking of Nested Quantification
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers. Translating
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
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 informationPredicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59
Predicate Calculus Lila Kari University of Waterloo Predicate Calculus CS245, Logic and Computation 1 / 59 Predicate Calculus Alternative names: predicate logic, first order logic, elementary logic, restricted
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 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 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 information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More information! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers
Sec$on Summary (K. Rosen notes for Ch. 1.4, 1.5 corrected and extended by A.Borgida)! Predicates! Variables! Quantifiers! Universal Quantifier! Existential Quantifier! Negating Quantifiers! De Morgan s
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 informationPredicate Logic Thursday, January 17, 2013 Chittu Tripathy Lecture 04
Predicate Logic Today s Menu Predicate Logic Quantifiers: Universal and Existential Nesting of Quantifiers Applications Limitations of Propositional Logic Suppose we have: All human beings are mortal.
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
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 informationProposi'onal Logic Not Enough
Section 1.4 Proposi'onal Logic Not Enough If we have: All men are mortal. Socrates is a man. Socrates is mortal Compare to: If it is snowing, then I will study discrete math. It is snowing. I will study
More informationLogical Entailment A set of premises Δ logically entails a conclusion ϕ (Δ = ϕ) if and only if every interpretation that satisfies Δ also satisfies ϕ.
Relational Proofs Logical Entailment A set of premises Δ logically entails a conclusion ϕ (Δ = ϕ) if and only if every interpretation that satisfies Δ also satisfies ϕ. Propositional Truth Assignments
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 informationIntroduction to first-order logic:
Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
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 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 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 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 informationCSI30. Chapter 1. The Foundations: Logic and Proofs Nested Quantifiers
Chapter 1. The Foundations: Logic and Proofs 1.9-1.10 Nested Quantifiers 1 Two quantifiers are nested if one is within the scope of the other. Recall one of the examples from the previous class: x ( P(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 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 informationSemantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic
Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, 2018 Predicate logic 1. Why propositional logic is not enough? Discussion: (i) Does (1a) contradict (1b)? [Two sentences are contradictory
More informationCS157 Greatest Hits. The Top 100 Slides of the Course
Computational Logic Lecture 20 CS157 Greatest Hits The Top 100 Slides of the Course Michael Genesereth Autumn 2008 Syntax Propositional Constants: raining, snowing, cloudy Negations: raining Conjunctions:
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 informationNotes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the
More informationOutline. Formale Methoden der Informatik First-Order Logic for Forgetters. Why PL1? Why PL1? Cont d. Motivation
Outline Formale Methoden der Informatik First-Order Logic for Forgetters Uwe Egly Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Motivation Syntax of PL1
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
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 informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationLogic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form.
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 Revision: CNF and DNF of propositional
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
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 informationPredicate Calculus - Semantics 1/4
Predicate Calculus - Semantics 1/4 Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Introduction to predicate calculus (1/2) Propositional logic (sentence logic) dealt quite satisfactorily with sentences
More informationFirst-Order Logic. Chapter Overview Syntax
Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts
More informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationLogic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam
Logic and Modelling Introduction to Predicate Logic Jörg Endrullis VU University Amsterdam Predicate Logic In propositional logic there are: propositional variables p, q, r,... that can be T or F In predicate
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 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 informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/26)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/26) Propositional Logic - algorithms Complete calculi for deciding logical
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationCSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Predicate Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Predicates A function P from a set D to the set Prop of propositions is called a predicate.
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 informationProblem With Natural Deduction
Herbrand Resolution Problem With Natural Deduction Assumption p(a) p(f(a)) p(x) => q(x) ~p(x) => q(x) Universal Elimination x. y.q(x,y) q(a,a) q(x,a) q(a,y) q(x,y) q(a, f(a)) q(x, f(a)) 2 Resolution Principle
More informationFirst-Order Predicate Logic. Basics
First-Order Predicate Logic Basics 1 Syntax of predicate logic: terms A variable is a symbol of the form x i where i = 1, 2, 3.... A function symbol is of the form fi k where i = 1, 2, 3... und k = 0,
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationLecture 3 : Predicates and Sets DRAFT
CS/Math 240: Introduction to Discrete Mathematics 1/25/2010 Lecture 3 : Predicates and Sets Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed propositions, which are
More informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
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 informationNotes on Satisfiability-Based Problem Solving. First Order Logic. David Mitchell October 23, 2013
Notes on Satisfiability-Based Problem Solving First Order Logic David Mitchell mitchell@cs.sfu.ca October 23, 2013 Preliminary draft. Please do not distribute. Corrections and suggestions welcome. In this
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationHandout #7 Predicate Logic Trees
Handout #7 Predicate Logic Trees Predicate trees: Decomposition Rules Negated Existential Decomposition ( D) ( x)p ( x) P Existential Decomposition ( D) ( x)p P(a/x) where a is an individual constant (name)
More informationPREDICATE LOGIC. Schaum's outline chapter 4 Rosen chapter 1. September 11, ioc.pdf
PREDICATE LOGIC Schaum's outline chapter 4 Rosen chapter 1 September 11, 2018 margarita.spitsakova@ttu.ee ICY0001: Lecture 2 September 11, 2018 1 / 25 Contents 1 Predicates and quantiers 2 Logical equivalences
More informationInfinite Truth-Functional Logic
28 Notre Dame Journal of Formal Logic Volume 29, Number 1, Winter 1988 Infinite Truth-Functional Logic THEODORE HAILPERIN What we cannot speak about [in K o or fewer propositions] we must pass over in
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 informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationSection Summary. Predicates Variables Quantifiers. Negating Quantifiers. Translating English to Logic Logic Programming (optional)
Predicate Logic 1 Section Summary Predicates Variables Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Logic Programming
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 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 informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
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 informationPropositional, First-Order And Higher-Order Logics: Basic Definitions, Rules of Inference, and Examples
Propositional, First-Order And Higher-Order Logics: Basic Definitions, Rules of Inference, and Examples Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo, The State
More informationChapter 1, Part II: Predicate Logic
Chapter 1, Part II: Predicate Logic With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill
More informationAll psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates
Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is
More informationG52DOA - Derivation of Algorithms Predicate Logic
G52DOA - Derivation of Algorithms Predicate Logic Venanzio Capretta Predicate Logic So far, we studied propositional logic, in which we started with unspecified propositional variables A, B, C, and combined
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 informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationA Little Logic. Propositional Logic. Satisfiability Problems. Solving Sudokus. First Order Logic. Logic Programming
A Little Logic International Center for Computational Logic Technische Universität Dresden Germany Propositional Logic Satisfiability Problems Solving Sudokus First Order Logic Logic Programming A Little
More informationLloyd-Topor Completion and General Stable Models
Lloyd-Topor Completion and General Stable Models Vladimir Lifschitz and Fangkai Yang Department of Computer Science The University of Texas at Austin {vl,fkyang}@cs.utexas.edu Abstract. We investigate
More informationDefinite Logic Programs
Chapter 2 Definite Logic Programs 2.1 Definite Clauses The idea of logic programming is to use a computer for drawing conclusions from declarative descriptions. Such descriptions called logic programs
More informationFirst Order Logic (FOL)
First Order Logic (FOL) Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel based on slides by Prof. Ruzica Piskac, Nikolaj Bjorner, and others References Chpater 2 of Logic for
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationCSC165 Mathematical Expression and Reasoning for Computer Science
CSC165 Mathematical Expression and Reasoning for Computer Science Lisa Yan Department of Computer Science University of Toronto January 21, 2015 Lisa Yan (University of Toronto) Mathematical Expression
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationCS-E4800 Artificial Intelligence
CS-E4800 Artificial Intelligence Jussi Rintanen Department of Computer Science Aalto University March 1, 2017 Second Assignment (out on February 3) Model your problem in the propositional logic (expressed
More information