Propositional Logic Language
|
|
- Jeremy Lindsey
- 6 years ago
- Views:
Transcription
1 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 or countably infinite set of nullary relation symbols A R = {p, q,...}, the set of connectives {,,,, } and the punctuation symbols ( and ). The language L of propositional logic formulas is defined as follows: Each relation symbol is a formula. If F and G are formulas, then F, (F G), (F G), (F (F G) are formulas. G) and 2 Propositional Logic 1
2 Notions, Remarks and an Example Nullary relation symbols are also called propositional variables, nullary predicate symbols and atoms. Literals are formulas of the form p or p. We define a precedence hierarchy as follows: > > > {, } >. A simple example: (p 1 p 2 ) (q 1 q 2 ). 2 Propositional Logic 2
3 Structural Induction and Recursion Theorem 2.1 (Principle of Structural Induction) Every formula of propositional logic has a certain property E provided that: 1. Basis step: Every propositional variable has property E. 2. Induction steps: If F has property E so does F. If F and G have property E so does F G, where {,,,, }. Theorem 2.2 (Principle of Structural Recursion) There is one, and only one, function h defined on the set of propositional formulas such that: 1. Basis step: The value of h is specified explicitly on propositional variables. 2. Recursion steps: The value of h on F is specified in terms of the value of h on F. The value of h on F G is specified in terms of the values of h on F and on G, where {,,,, }. 2 Propositional Logic 3
4 Subformulas The set of subformulas T (H) is the smallest set satisfying the following conditions: H T (H). If F T (H), then F T (H). If F G T (H), then F, G T (H), where {,,,, }. 2 Propositional Logic 4
5 Propositional Logic Semantics Goal: assign a meaning to formulas with the help of a function L {t, f}. Interpretation I: a total mapping A R {t, f}. Abbreviation: I A R with the understanding that I(p) = t iff p I. I models F, in symbols I = F : I = p iff I(p) = t (iff p I) I = F iff I = F I = F 1 F 2 iff I = F 1 and I = F 2 I = F 1 F 2 iff I = F 1 or I = F 2 I = F 1 F 2 iff I = F 1 or I = F 2 I = F 1 F 2 iff I = F 1 F 2 and I = F 2 F 1. 2 Propositional Logic 5
6 Connectives Unary connective: t f f t Binary connectives: t t t t t t t f f t f f f t f t t f f f f f t t 2 Propositional Logic 6
7 Models, Validity and More Notions An interpretation I for F is said to be a model for F iff I = F. Let F be a set of formulas. I is a model for F iff I is a model for each G F. F is said to be valid or a tautology iff for all I we find that I = F. F is said to be satisfiable iff there exists an I such that I = F. F is said to be falsifiable iff there exists an I such that I = F. F is said to be unsatisfiable iff for all I we find that I = F. 2 Propositional Logic 7
8 Logical Entailment A set of formulas F logically entails G (or G is a logical consequence of F or G is a theorem of F), in symbols F = G, iff each model for F is also a model for G. A satisfiable set of formulas together with all its theorems is said to be a theory. Truth tabling: {p q r} = p r? p q r q r p q r p r t t t t t t t t f f f f t f t f f t t f f f f f f t t t t t f t f f t t f f t f t t f f f f t t 2 Propositional Logic 8
9 Logical Consequence vs. Validity vs. Unsatisfiability Theorem 2.3: F {G} = H iff F = G H. {F 1,..., F n } = F iff {F 1,..., F n 1 } = F n F iff... iff = F 1 (F 2... (F n F )...). Logical consequence is related to validity. Abbreviation: = F = F. Theorem 2.4: F is valid iff F is unsatisfiable. Validity is related unsatisfiability. Logical consequence is related to unsatisfiability 2 Propositional Logic 9
10 Semantic Equivalence F G if for all interpretations I we find that I = F iff I = G. Some equivalences: (F F ) F (F F ) F idempotency (F G) (G F ) (F G) (G F ) commutativity ((F G) H) (F (G H)) ((F G) H) (F (G H)) associativity ((F G) F ) F ((F G) F ) F absorption (F (G H)) ((F G) (F H)) (F (G H)) ((F G) (F H)) distributivity 2 Propositional Logic 10
11 More Equivalences F F double negation (F G) ( F G) (F G) ( F G) de Morgan (F G) F, if F tautology (F G) G, if F tautology tautology (F G) G, if F unsatisfiable (F G) F, if F unsatisfiable unsatisfiability (F G) (F G) (G F ) equivalence (F G) ( F G) implication 2 Propositional Logic 11
12 The Replacement Theorem F [G]: formula F, in which the occurrences of the formula G are important. F [G/H]: formula obtained from F by replacing all occurrences of G by H. Theorem 2.5: If G H, then F [G] F [G/H]. 2 Propositional Logic 12
13 Normal Forms Negation normal form: the formula is built solely by literals, conjunctions and disjunctions. Conjunctive normal form: the formula has the form F 1... F n, n 0, where each of F 1,..., F n is a disjunction of literals. case n = 0: denoting a valid formula. Disjunctive normal form: the formula has the form F 1... F n, n 0, where each of F 1,..., F n is a conjunction of literals. case n = 0: [ ] denoting an unsatisfiable formula. Clause form: set notation of formulas in conjunctive normal form; Clauses: elements of these sets. Dual clause form: set notation of formulas in disjunctive normal form; Dual clauses: elements of these sets. 2 Propositional Logic 13
14 Normal Form Transformation Input A propositional logic formula F. Output A propositional logic formula G in conjunctive normal form which is equivalent to F. 1. Eliminate all equivalence signs using the equivalence law. 2. Eliminate all implication signs using the implication law. 3. Eliminate all negation signs except those in literals using the de Morgan and the double negation laws. 4. Distribute all disjunctions over conjunctions using the second distributivity, the commutativity and the associativity laws. 2 Propositional Logic 14
15 Normal Form Transformation - Example (p (q r)) s (p ( q r)) s by implication (p ( q r)) s by implication ( p ( q r)) s by de Morgan ( p ( q r)) s by de Morgan ( p (q r)) s by double negation (( p q) ( p r)) s by distributivity s (( p q) ( p r)) by commutativity (s ( p q)) (s ( p r) by distributivity (s p q) (s p r) by associativity 2 Propositional Logic 15
16 Clause Form Conjunctive normal form: Clause form: Unit clause: clause which contains only one literal. (L L 1n1 )... (L m1... L mn m), {{L 11,..., L 1n1 },..., {L m1,..., L mn m}}. Horn clause: clause which contains at most one positive literal (L L 1... L n ). Goal clause: Horn clause which contains only negative literals ( L 1... L n ). Definite clause: Horn clause which contains a positive literal. Fact: definite unit clause. [ ]: denotes the empty clause. 2 Propositional Logic 16
17 Propositional Logic Programs Procedural vs. declarative reading of definite clauses. Definite propositional logic program F: set of definite clauses. Proposition 2.1: If I 1 and I 2 are models of F then so is I 1 I 2. There exists a least model M F of F. Theorem 2.6: Let F be a logic program. M F = {p F = p}. Meaning function: T F (I) = {p p p 1... p n F {p 1,..., p n } I}. T F 0 = T F (n + 1) = T F (T F n) for all n 0. T F admits a least fixed point lfp(t F ). Theorem 2.7: M F = lfp(t F ) = lub({t F n n N}). 2 Propositional Logic 17
18 Calculus Logic: A, L, =. Calculus: A, L, Γ, Π, where Γ is a set of formulas called axioms and Π is a set of inference rules. F F : inference relation defined by Γ and Π. Soundness: If F F then F = F. Completeness: If F = F then F F 2 Propositional Logic 18
19 Classification of Calculi A calculus is said to be negative if its axioms are unsatisfiable. positive if its axioms are valid, generating if theorems are derived from the axioms using the inference rules, analyzing if theorems are reduced to the axioms using the inference rules. 2 Propositional Logic 19
20 Natural Deduction Gentzen 1935: How to represent logical reasoning in mathematics? Calculus of natural deduction. Alphabet: propositional logic. [ ] denotes some unsatisfiable formula. denotes some valid formula. Language: propositional logic formulas. Axioms: { }. 2 Propositional Logic 20
21 Natural Deduction - Inference Rules Constant Rules: [ ] F Negation Rules: Introduction Rules for Binary Connectives: F F [ ] F. [ ] F F. [ ] F I F G F G I F. G F G G. F F G I F. G F G G. F F G Elimination Rules for Binary Connectives: E F G F F G G E F F G G G F G F E F F G G G F G F 2 Propositional Logic 21
22 Deductions and Proofs A deduction in the calculus of natural deduction is a sequence of formulas possibly enclosed in (open or closed) boxes such that each element is either the axiom, follows from earlier elements occurring in open boxes at this stage by one of the rules of inference or is a formula different from and does not follow by one of the rules of inference, in which case the formula is called assumption and a new box is opened. A proof of F in the calculus of natural deduction is a deduction in which all boxes are closed and F is the last element in the deduction. 2 Propositional Logic 22
23 Lemmas The lemmas: F F (F G) F G (F G) G F (F G) ( F G) represent the sequence of formulas: F F [ ] F (F G) F G (F G) [ ] G (F G) G F (F G) [ ] F (F G) ( F G) G F F (F G) [ ] ( F G) Lemmas shorten proofs, but enlarge the search space. 2 Propositional Logic 23
24 Natural Deduction - Soundness and Completeness Theorem 2.8: The calculus of natural deduction is sound and complete. Human readable proofs vs. machine generated proofs. Sequent calculus. Proof theory. 2 Propositional Logic 24
25 Sequent Calculus Sequent: F G, where F and G are multisets of formulas. Notation: {F1,..., F n } F1,..., F n. F {F } F, F. Inference rules: S 1... S n r S or S r 2 Propositional Logic 25
26 Sequent Calculus: Axiom, Cut and Structural Rules Axiom Cut H, F G, H ax F G, H F G H, F G cut Structural rules H, H, F G H, F G cl F G, H, H F G, H cr 2 Propositional Logic 26
27 Sequent Calculus: Logical Rules Rules for the left hand side Rules for the right hand side F G, H 1 H 2, F G (H 1 H 2 ), F G l H 1, F G, H 2 F G, (H 1 H 2 ) r H 1, H 2, F G (H 1 H 2 ), F G l F G, H 1 F G, H 2 r F G, (H 1 H 2 ) H 1, F G H 2, F G (H 1 H 2 ), F G l F G, H 1, H 2 F G, (H 1 H 2 ) r F G, H H, F G l H, F G F G, H r 2 Propositional Logic 27
28 Sequent Calculus: Soundness and Completeness A proof of the sequent S in the sequent calculus is defined as follows: An axiom of the form r is a proof of S. S If T 1,..., T n are proofs of S 1,..., S n respectively and the sequent calculus contains a rule of the form S 1... S n r, then T 1... T n r is a proof of S. S S Theorem 2.9: The propositional sequent calculus is sound and complete. Subformula property: all formulas occurring in the condition of a rule occur as subformulas in the conclusion of the rule. Only the cut rule violates this property. Gentzen s Hauptsatz : Cuts can be removed in sequent calculus proofs. 2 Propositional Logic 28
29 Resolution Let C 1 = {L, L 1,..., L n } and C 2 = { L, K 1,..., K m } be two clauses. Then is called a resolvent of C 1 and C 2. {K 1,..., K m, L 1,..., L n, } {C 1, C 2 } = {K 1,..., K m, L 1,..., L n, }. A deduction of C from F is a finite sequence C 1,..., C k = C of clauses such that C i, 1 i k, either is a clause from F or a resolvent of clauses preceding C i. A deduction of [ ] from F is called a refutation. Theorem 2.11 The resolution calculus for propositional logic is sound and complete. 2 Propositional Logic 29
30 Monotonicity A logic is monotonic iff F = F implies F F = F. Propositional logic is monotonic. A logic which obeys the law is not monotonic. for each atom p we find F = p iff p F. 2 Propositional Logic 30
3 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 informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationLogic: Propositional Logic (Part I)
Logic: Propositional 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 informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationChapter 11: Automated Proof Systems (1)
Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More informationChapter 11: Automated Proof Systems
Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
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 informationPropositional Calculus: Formula Simplification, Essential Laws, Normal Forms
P Formula Simplification, Essential Laws, Normal Forms Lila Kari University of Waterloo P Formula Simplification, Essential Laws, Normal CS245, Forms Logic and Computation 1 / 26 Propositional calculus
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 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 informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
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 informationWarm-Up Problem. Is the following true or false? 1/35
Warm-Up Problem Is the following true or false? 1/35 Propositional Logic: Resolution Carmen Bruni Lecture 6 Based on work by J Buss, A Gao, L Kari, A Lubiw, B Bonakdarpour, D Maftuleac, C Roberts, R Trefler,
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
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 information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
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 informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationPropositional Logic Sequent Calculus
1 / 16 Propositional Logic Sequent Calculus Mario Alviano University of Calabria, Italy A.Y. 2017/2018 Outline 2 / 16 1 Intuition 2 The LK system 3 Derivation 4 Summary 5 Exercises Outline 3 / 16 1 Intuition
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationLOGIC PROPOSITIONAL REASONING
LOGIC PROPOSITIONAL REASONING WS 2017/2018 (342.208) Armin Biere Martina Seidl biere@jku.at martina.seidl@jku.at Institute for Formal Models and Verification Johannes Kepler Universität Linz Version 2018.1
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 informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationThe Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna
The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)
More informationPropositional and Predicate Logic. jean/gbooks/logic.html
CMSC 630 February 10, 2009 1 Propositional and Predicate Logic Sources J. Gallier. Logic for Computer Science, John Wiley and Sons, Hoboken NJ, 1986. 2003 revised edition available on line at http://www.cis.upenn.edu/
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
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 informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationINF3170 Logikk Spring Homework #8 For Friday, March 18
INF3170 Logikk Spring 2011 Homework #8 For Friday, March 18 Problems 2 6 have to do with a more explicit proof of the restricted version of the completeness theorem: if = ϕ, then ϕ. Note that, other than
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
More informationPropositional Logic: Gentzen System, G
CS402, Spring 2017 Quiz on Thursday, 6th April: 15 minutes, two questions. Sequent Calculus in G In Natural Deduction, each line in the proof consists of exactly one proposition. That is, A 1, A 2,...,
More information2.5.2 Basic CNF/DNF Transformation
2.5. NORMAL FORMS 39 On the other hand, checking the unsatisfiability of CNF formulas or the validity of DNF formulas is conp-complete. For any propositional formula φ there is an equivalent formula in
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 informationThe non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω
1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the
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 informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationComputation and Logic Definitions
Computation and Logic Definitions True and False Also called Boolean truth values, True and False represent the two values or states an atom can assume. We can use any two distinct objects to represent
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
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 information7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring
109 7 LOGICAL AGENS We now turn to knowledge-based agents that have a knowledge base KB at their disposal With the help of the KB the agent aims at maintaining knowledge of its partially-observable environment
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
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 informationOverview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.
Overview I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Propositional formulas Grammar: ::= p j (:) j ( ^ )
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 informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationInfinitary Equilibrium Logic and Strong Equivalence
Infinitary Equilibrium Logic and Strong Equivalence Amelia Harrison 1 Vladimir Lifschitz 1 David Pearce 2 Agustín Valverde 3 1 University of Texas, Austin, Texas, USA 2 Universidad Politécnica de Madrid,
More informationMarie Duží
Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language
More informationPropositional Logic Part 1
Propositional Logic Part 1 Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Louis Oliphant, Andrew Moore, Jerry Zhu] slide 1 5 is even
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationIntelligent Systems. Propositional Logic. Dieter Fensel and Dumitru Roman. Copyright 2008 STI INNSBRUCK
Intelligent Systems Propositional Logic Dieter Fensel and Dumitru Roman www.sti-innsbruck.at Copyright 2008 STI INNSBRUCK www.sti-innsbruck.at Where are we? # Title 1 Introduction 2 Propositional Logic
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationMathematics for linguists
Mathematics for linguists WS 2009/2010 University of Tübingen January 7, 2010 Gerhard Jäger Mathematics for linguists p. 1 Inferences and truth trees Inferences (with a finite set of premises; from now
More informationIntroduction to Artificial Intelligence. Logical Agents
Introduction to Artificial Intelligence Logical Agents (Logic, Deduction, Knowledge Representation) Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Knowledge-based
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationCritical Reading of Optimization Methods for Logical Inference [1]
Critical Reading of Optimization Methods for Logical Inference [1] Undergraduate Research Internship Department of Management Sciences Fall 2007 Supervisor: Dr. Miguel Anjos UNIVERSITY OF WATERLOO Rajesh
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
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 informationPropositional Logic: Evaluating the Formulas
Institute for Formal Models and Verification Johannes Kepler University Linz VL Logik (LVA-Nr. 342208) Winter Semester 2015/2016 Propositional Logic: Evaluating the Formulas Version 2015.2 Armin Biere
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 informationClassical Propositional Logic
Classical Propositional Logic Peter Baumgartner http://users.cecs.anu.edu.au/~baumgart/ Ph: 02 6218 3717 Data61/CSIRO and ANU July 2017 1 / 71 Classical Logic and Reasoning Problems A 1 : Socrates is a
More informationLogical Agents (I) Instructor: Tsung-Che Chiang
Logical Agents (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010 編譯有誤
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationPropositional Resolution Introduction
Propositional Resolution Introduction (Nilsson Book Handout) Professor Anita Wasilewska CSE 352 Artificial Intelligence Propositional Resolution Part 1 SYNTAX dictionary Literal any propositional VARIABLE
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
More informationIntroduction to Intuitionistic Logic
Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A
More informationResolution In Propositional Logic
Chapter 4 Resolution In Propositional Logic 4.1 Introduction In Chapter 3, a procedure for showing whether or not a given proposition is valid was given. This procedure, which uses a Gentzen system, yields
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationProving Completeness for Nested Sequent Calculi 1
Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there
More informationArtificial Intelligence. Propositional Logic. Copyright 2011 Dieter Fensel and Florian Fischer
Artificial Intelligence Propositional Logic Copyright 2011 Dieter Fensel and Florian Fischer 1 Where are we? # Title 1 Introduction 2 Propositional Logic 3 Predicate Logic 4 Reasoning 5 Search Methods
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 informationNormal Forms of Propositional Logic
Normal Forms of Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 12, 2017 Bow-Yaw Wang (Academia Sinica) Normal Forms of Propositional Logic September
More informationTitle: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)
B.Y. Choueiry 1 Instructor s notes #12 Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) Introduction to Artificial Intelligence CSCE 476-876, Fall 2018 URL: www.cse.unl.edu/ choueiry/f18-476-876
More informationLogic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae
Logic and Discrete Mathematics Section 3.5 Propositional logical equivalence Negation of propositional formulae Slides version: January 2015 Logical equivalence of propositional formulae Propositional
More informationUNIT-I: Propositional Logic
1. Introduction to Logic: UNIT-I: Propositional Logic Logic: logic comprises a (formal) language for making statements about objects and reasoning about properties of these objects. Statements in a logical
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationPropositional Logic. Logic. Propositional Logic Syntax. Propositional Logic
Propositional Logic Reading: Chapter 7.1, 7.3 7.5 [ased on slides from Jerry Zhu, Louis Oliphant and ndrew Moore] Logic If the rules of the world are presented formally, then a decision maker can use logical
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
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 information