Human interpretation and reasoning about conditionals
|
|
- Ilene Taylor
- 5 years ago
- Views:
Transcription
1 Human interpretation and reasoning about conditionals Niki Pfeifer 1 Munich Center for Mathematical Philosophy Language and Cognition Ludwig-Maximilians-Universität München 1 FWF-project Mental probability logic
2 Outline Mental probability logic
3 Outline Mental probability logic Assertability/acceptability vs. truth conditions Classification of tasks involving conditionals
4 Outline Mental probability logic Assertability/acceptability vs. truth conditions Classification of tasks involving conditionals 2 experiments on Aristotle s thesis Motivation: Clarifying interpretation and scope ambiguity in reasoning about conditionals
5 Mental probability logic (Pfeifer & Kleiter, 2005, 2009a, 2009b, 2010) competence uncertain indicative If A, then B is interpreted as P(B A) B A is partially truth-functional (void, if A is false and undefined if A is a logical contradiction) premises are assessed by point values, intervals or second order probability distributions uncertainty is transmitted deductively from the premises to the conclusion coherence based probability logic framework
6 Coherence de Finetti, and {Coletti, Gilio, Lad, Regazzini, Scozzafava, Walley,...} degrees of belief complete algebra is not required conditional probability, P(B A), is primitive zero probabilities are exploited to reduce the complexity imprecision bridges to possibility, DS-belief functions, fuzzy sets, default reasoning,... provides semantics for System P (Gilio, 2002)
7 How people interpret indicative conditionals Prominent psychological predictions of the interpretation of indicative conditionals: Conjunction Material conditional Conditional event Material Conjunction Conditional conditional event A B A B A B B A s 1 true true true true true s 2 true false false false false s 3 false true true false void s 4 false false true false void
8 How people interpret indicative conditionals Prominent psychological predictions of the interpretation of indicative conditionals: Conjunction Material conditional Conditional event Material Conjunction Conditional conditional event A B A B A B B A s 1 true true true true true s 2 true false false false false s 3 false true true false void s 4 false false true false void
9 Assertability/acceptability vs. truth conditions (Douven, in press) Conditionals do not have truth conditions (e.g., Adams, 1975) Adams Thesis: Indicative conditionals are not truth-functional and their acceptability/assertability is equal to P(B A).
10 Assertability/acceptability vs. truth conditions (Douven, in press) Conditionals do not have truth conditions (e.g., Adams, 1975) Adams Thesis: Indicative conditionals are not truth-functional and their acceptability/assertability is equal to P(B A). Advantages: avoiding the paradoxes of the material conditional, intuitively plausible Disadvantages: conditionals are restricted to simple conditionals (no iteration, no nesting except quasi-conjunction)
11 Assertability/acceptability vs. truth conditions (Douven, in press) Conditionals have truth conditions. Are the truth conditions truth functional? yes material conditional (Lewis, 1976; Jackson, 1979; Grice, 1975) A B is assertable/acceptable iff (1) P(A B) is high, and (2) P(A B A) is high (and close to P(A B)).
12 Assertability/acceptability vs. truth conditions (Douven, in press) Conditionals have truth conditions. Are the truth conditions truth functional? yes material conditional (Lewis, 1976; Jackson, 1979; Grice, 1975) A B is assertable/acceptable iff (1) P(A B) is high, and (2) P(A B A) is high (and close to P(A B)). Jackson (1987, p. 31) notes that these conditions imply P(B A) is high.
13 Assertability/acceptability vs. truth conditions (Douven, in press) Conditionals have truth conditions. Are the truth conditions truth functional? yes material conditional (Lewis, 1976; Jackson, 1979; Grice, 1975) A B is assertable/acceptable iff (1) P(A B) is high, and (2) P(A B A) is high (and close to P(A B)). Jackson (1987, p. 31) notes that these conditions imply P(B A) is high. no possible worlds (e.g., Stalnaker, 1968)
14 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =?
15 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If introduction Probabilistic truth table task P(A B) = x 1 P(A B) = x 2 P( A B) = x 3 P( A B) = x 4 P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =?
16 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If introduction Probabilistic truth table task P(A B) = x 1 P(A B) = x 2 P( A B) = x 3 P( A B) = x 4 P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =?
17 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If introduction Probabilistic truth table task P(A B) = x 1 P(A B) = x 2 P( A B) = x 3 P( A B) = x 4 P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =? If the side shows a square, then the side shows black (Fugard, Pfeifer, Mayerhofer, & Kleiter, in press)
18 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If introduction Probabilistic truth table task Paradoxes of, e.g.: P(B) = x P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =?
19 Reasoning tasks from a probability-logical point of view Arguments involving conditionals If to if System P Complement: P(A B) = x P(A B) =? If introduction Probabilistic truth table task Paradoxes of, e.g.: P(B) = x P(A B) =? If elimination Conditional syllogisms (Suppression tasks) P(A) = x P(A B) = y P(B) =? P(B) = x 0 P(A B) x (conjunction) P(B) = x x P(A B) 1 (mat. cond.) P(B) = x 0 P(B A) 1 (cond. event)
20 Full vs. incomplete probabilistic knowledge Full probabilistic knowledge: e.g., probabilistic truth table task: The probability value of A B is precise Incomplete probabilistic knowledge: e.g., probabilistic modus ponens: from P(B A) = x and P(A) = y infer xy P(B) xy +1 y
21 Full vs. incomplete probabilistic knowledge Full probabilistic knowledge: e.g., probabilistic truth table task: The probability value of A B is precise Incomplete probabilistic knowledge: e.g., probabilistic modus ponens: from P(B A) = x and P(A) = y infer xy P(B) xy +1 y Sentences that are purely determined by their logical form: FO-Logic Probability logic Tautology the only coherent value: 1 Contradiction the only coherent value: 0 Sentences that are not purely determined by their logical form: FO-Logic Probability logic Contingent sentences the unit interval, [0, 1], may be coherent
22 Aristotle s Thesis
23 Aristotle s Thesis AT #1: ( A A) AT #2: (A A)
24 Aristotle s Thesis AT #1: ( A A) ( A A) AT #2: (A A) (A A)
25 Aristotle s Thesis AT #1: ( A A) ( A A) A A A AT #2: (A A) (A A) A A A
26 Aristotle s Thesis: Probability logical predictions AT #1: ( A A) P( ( A A)) = P( A)
27 Aristotle s Thesis: Probability logical predictions AT #1: ( A A) P( ( A A)) = P( A) P( ( A A)) = 1
28 Aristotle s Thesis: Probability logical predictions AT #1: ( A A) P( ( A A)) = P( A) P( ( A A)) = 1 P(A A) = 0, its negation: P( A A) = 1
29 Aristotle s Thesis: Probability logical predictions AT #1: ( A A) P( ( A A)) = P( A) P( ( A A)) = 1 P(A A) = 0, its negation: P( A A) = 1 AT #2: (A A) P( (A A)) = P(A) P( (A A)) = 1 P( A A) = 0, its negation: P( A A) = P(A A) = 1
30 Experiment 1: Abstract version, Aristotle s Thesis #1 The letter A denotes a sentence, like It is raining. There are sentences, where you can infer only on the basis of their logical form, whether they are guaranteed to be false or guaranteed to be true. For example: A and not-a is guaranteed to be false. A or not-a is guaranteed to be true. There are sentences, where you cannot infer only on the basis of their logical form, whether they are true or false. The sentence A ( It is raining. ), for example, can be true but it can just as well be false: this depends upon whether it is actually raining. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If not-a, then A. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
31 Experiment 1: Abstract version, Aristotle s Thesis #2 The letter A denotes a sentence, like It is raining. There are sentences, where you can infer only on the basis of their logical form, whether they are guaranteed to be false or guaranteed to be true. For example: A and not-a is guaranteed to be false. A or not-a is guaranteed to be true. There are sentences, where you cannot infer only on the basis of their logical form, whether they are true or false. The sentence A ( It is raining. ), for example, can be true but it can just as well be false: this depends upon whether it is actually raining. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If A, then not-a. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
32 Experiment 1: Concrete version, Aristotle s Thesis #1 There is either a dog or a cat behind the door, but not both. There are sentences, where you can infer only on the basis of their logical form, whether they are guaranteed to be false or guaranteed to be true. For example: There is a dog and a cat behind the door is guaranteed to be false. There is either a dog or a cat behind the door is guaranteed to be true. There are sentences, where you cannot infer only on the basis of their logical form, whether they are true or false. The sentence There is a dog behind the door., for example, can be true but it can just as well be false: this depends upon whether there is in fact a dog behind the door. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If there is a dog behind the door, then there is a cat behind the door. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
33 Experiment 1: Concrete version, Aristotle s Thesis #2 There is either a dog or a cat behind the door, but not both. There are sentences, where you can infer only on the basis of their logical form, whether they are guaranteed to be false or guaranteed to be true. For example: There is a dog and a cat behind the door is guaranteed to be false. There is either a dog or a cat behind the door is guaranteed to be true. There are sentences, where you cannot infer only on the basis of their logical form, whether they are true or false. The sentence There is a dog behind the door., for example, can be true but it can just as well be false: this depends upon whether there is in fact a dog behind the door. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If there is a cat behind the door, then there is a dog behind the door. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
34 Experiment 1: Participant s evaluation of the tasks Is the task clear and comprehensible? (please tick) very clear very unclear How sure are you, that your solution is correct? very sure very uncertain How difficult is the task for you? very easy very difficult
35 Experiment 1: Participant s evaluation of the tasks Is the task clear and comprehensible? (please tick) M = 35% (SD = 28%) X very clear How sure are you, that your solution is correct? very sure M = 44% (SD = 27%) X How difficult is the task for you? very easy very unclear very uncertain M = 61% (SD = 22%) X very difficult
36 Experiment 1: Sample N = 141 all psychology students 91% third semester 78% female median age: 21 (1st Qu. = 20, 3rd Qu. =23)
37 Concrete (n=71) versus abstract (n=71) task material Frequency abstract concrete FALSE TRUE CANNOT INFER
38 Task features of Aristotle s Thesis If introduction inference from the empty premise set Only one variable: A Logical form is complex: two negations, one conditional
39 Task features of Aristotle s Thesis If introduction inference from the empty premise set Only one variable: A Logical form is complex: two negations, one conditional Scope ambiguity: negating the conditional: (A A) }{{} wide scope negating the consequent: (A A) }{{} narrow scope
40 Experiment 2: Design Between participants: Explicit (n 1 = 20) vs. implicit negation (n 2 = 20) Within participants: 12 Tasks Task Name Argument form 1 Aristotle s Thesis 1 (A A) 2 Negated Reflexivity (A A) 3 Aristotle s Thesis 2 ( A A) 4 Reflexivity A A 5 Contingent Arg. 1 A B 6 Contingent Arg. 2 (A B) Probabilistic truth-table tasks 11 Paradox 1 from B infer A B 12 Neg. Paradox 1 from B infer A B
41 Experiment 2: Predictions Argument form Scope wide narrow (A A) T CT T T (A A) F F CT CT ( A A) T CT T T A A T T T CT A B CT CT CT CT (A B) CT CT CT CT from B infer A B U H U from B infer A B U T L Note: CT=can t tell, T=true, F=false, U=uninformative conclusion probability, H=high conclusion probability, L=low conclusion probability
42 Experiment 2: Predictions against wide vs. narrow scope of Argument form Scope wide narrow (A A) T CT T T (A A) F F CT CT ( A A) T CT T T A A T T T CT A B CT CT CT CT (A B) CT CT CT CT from B infer A B U H U from B infer A B U T L Note: CT=can t tell, T=true, F=false, U=uninformative conclusion probability, H=high conclusion probability, L=low conclusion probability
43 Experiment 2: Aristotle s Thesis #1, explicit version [...] Hans expects to be visited by Thea and Ida. He is sitting in his room. Suddenly someone knocks at the door. Hans is absolutely certain, that either Thea or Ida is knocking.
44 Experiment 2: Aristotle s Thesis #1, explicit version [...] Hans expects to be visited by Thea and Ida. He is sitting in his room. Suddenly someone knocks at the door. Hans is absolutely certain, that either Thea or Ida is knocking. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If Ida knocks, then Thea knocks. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
45 Experiment 2: Aristotle s Thesis #1, implicit version [...] Hans expects to be visited by Thea and Ida. He is sitting in his room. Suddenly someone knocks at the door. Hans is absolutely certain, that either Thea or Ida is knocking. Evaluate the following sentence (please tick exactly one alternative): It is not the case, that: If Ida knocks, then Ida does not knock. The sentence in the box is guaranteed to be false The sentence in the box is guaranteed to be true One cannot infer whether the sentence is true or false
46 Experiment 2: Sample N = 40 no psychology students individual tested, 5 for participation 50% female median age: 22 (1st Qu. = 21, 3rd Qu. =23)
47 Experiment 2: Results Argument form Scope Responses wide narrow in percent T F CT (A A) T CT T T (A A) F F CT CT ( A A) T CT T T A A T T T CT A B CT CT CT CT (A B) CT CT CT CT from B infer A B U H U from B infer A B U T L Note: CT=can t tell, T=true, F=false, U=uninformative conclusion probability, H=high conclusion probability, L=low conclusion probability
48 Experiment 2: Results Argument form Scope Responses wide narrow in percent T F CT (A A) T CT T T (A A) F F CT CT ( A A) T CT T T A A T T T CT A B CT CT CT CT (A B) CT CT CT CT from B infer A B U H U from B infer A B U T L Note: CT=can t tell, T=true, F=false, U=uninformative conclusion probability, H=high conclusion probability, L=low conclusion probability
49 Experiment 2: Results (consistency with interpretation) Scoring: Aristotle s thesis 1+2, (negated) reflexivity, (negated) paradox 1 (n 1+2 = 40, 6 tasks, min = 0, max = 6) Interpretation Mean SD Scope narrow wide
50 Concluding remarks New evidence against the material conditional interpretation Scope ambiguity of the negation of conditionals Most responses consistent with the conditional event interpretation
51 Concluding remarks New evidence against the material conditional interpretation Scope ambiguity of the negation of conditionals Most responses consistent with the conditional event interpretation Acceptability/assertability conditions are consistent with the conditional event interpretation Unclear, if truth conditions play any role in human reasoning about conditionals
52 Concluding remarks New evidence against the material conditional interpretation Scope ambiguity of the negation of conditionals Most responses consistent with the conditional event interpretation Acceptability/assertability conditions are consistent with the conditional event interpretation Unclear, if truth conditions play any role in human reasoning about conditionals An implication that satisfies Aristotle s theses and the Boethius theses (A B) (A B) (A B) (A B) is called a connexive implication (McCall, 1966; Angell, 2002).
53 References I Adams, E. W. (1975). The logic of conditionals. Dordrecht: Reidel. Douven, I. (in press). Indicative conditionals. In R. Pettigrew & L. Horsten (Eds.), Continuum companion to philosophical logic (pp. xx xx). London, New York: Continuum Press. Fugard, A. J. B., Pfeifer, N., Mayerhofer, B., & Kleiter, G. D. (in press). How people interpret conditionals: Shifts towards the conditional event. Journal of Experimental Psychology: Learning, Memory, and Cognition. Gilio, A. (2002). Probabilistic reasoning under coherence in System P. Annals of Mathematics and Artificial Intelligence, 34, Grice, H. P. (1975). Logic and conversation. In P. Cole & J. L. Morgan (Eds.), Syntax and semantics (Vol. 3: Speech acts.). New York: Seminar Press.
54 References II Jackson, F. (1979). On assertion and indicative conditionals. Philosophical Review, 88, (Reprint with postscript in (Jackson, 1991, ); the page references are to the reprint) Jackson, F. (1987). Conditionals. Oxford: Blackwell. Jackson, F. (Ed.). (1991). Conditionals. Oxford: Oxford University Press. Lewis, D. (1976). Probabilities of conditionals and conditional probabilities. Philosophical Review, 85, (Reprint with postscript in (Jackson, 1991, ); the page references are to the reprint) Pfeifer, N., & Kleiter, G. D. (2005). Towards a mental probability logic. Psychologica Belgica, 45(1), Pfeifer, N., & Kleiter, G. D. (2009a). Framing human inference by coherence based probability logic. Journal of Applied Logic, 7(2),
55 References III Pfeifer, N., & Kleiter, G. D. (2009b). Mental probability logic. Commentary on Oaksford & Chater: Bayesian rationality. Behavioral and Brain Sciences, 32, Pfeifer, N., & Kleiter, G. D. (2010). Uncertain deductive reasoning. In K. Manktelow, D. E. Over, & S. Elqayam (Eds.), The science of reasoning: A Festschrift for Jonathan St. BT Evans (pp ). Hove, UK: Psychology Press. Stalnaker, R. (1968). A theory of coditionals. In N. Rescher (Ed.), Studies in logical theory (pp ). Oxford: Blackwell. (Reprint in (Jackson, 1991, ); the page references are to the reprint)
Framing human inference by coherence based probability logic
Framing human inference by coherence based probability logic Pfeifer, N., & Kleiter, G. D. University of Salzburg (Austria) p. 1 Why coherence based? Degrees of belief & subjective probabilities versus
More informationOn Argument Strength. Niki Pfeifer
On Argument Strength Niki Pfeifer Abstract Everyday life reasoning and argumentation is defeasible and uncertain. I present a probability logic framework to rationally reconstruct everyday life reasoning
More informationProbabilistic experimental pragmatics beyond Bayes theorem
Probabilistic experimental pragmatics beyond Bayes theorem Niki Pfeifer 1 Munich Center for Mathematical Philosophy (LMU Munich) 1 Supported by the German Research Foundation (project grants PF 740/2-1
More informationKybernetika. Niki Pfeifer; Gernot D. Kleiter Inference in conditional probability logic. Terms of use: Persistent URL:
Kybernetika Niki Pfeifer; Gernot D. Kleiter Inference in conditional probability logic Kybernetika, Vol. 42 (2006), No. 4, 391--404 Persistent URL: http://dml.cz/dmlcz/135723 Terms of use: Institute of
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 informationTilburg University. Naturalized formal epistemology of uncertain reasoning Pfeifer, N. Publication date: Link to publication
Tilburg University Naturalized formal epistemology of uncertain reasoning Pfeifer, N. Publication date: 2012 Link to publication General rights Copyright and moral rights for the publications made accessible
More informationThe Conditional in Mental Probability Logic
The Conditional in Mental Probability Logic Pfeifer, N. & Kleiter, G. D. Department of Psychology, University of Salzburg (Austria) niki.pfeifer@sbg.ac.at, gernot.kleiter@sbg.ac.at (December 29, 2007)
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
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 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 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 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 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 informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationA SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC
Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
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 informationCSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter 4.1-4.8 p. 1/33 CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationMethods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains
Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains Anatoly Prihozhy and Liudmila Prihozhaya Information Technologies and Robotics Department,
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 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 informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationPei Wang( 王培 ) Temple University, Philadelphia, USA
Pei Wang( 王培 ) Temple University, Philadelphia, USA Artificial General Intelligence (AGI): a small research community in AI that believes Intelligence is a general-purpose capability Intelligence should
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 informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
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 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 informationArtificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers
Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers 1. When is an inference rule {a1, a2,.., an} c sound? (b) a. When ((a1 a2 an) c) is a tautology b. When ((a1
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 informationIndicative conditionals
Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationPropositional Logic Arguments (5A) Young W. Lim 10/11/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
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 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 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 information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More informationConjunction, Disjunction and Iterated Conditioning of Conditional Events
Conjunction, Disjunction and Iterated Conditioning of Conditional Events A. Gilio 1 and G. Sanfilippo 2 Abstract Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two
More informationDeliberative Agents Knowledge Representation I. Deliberative Agents
Deliberative Agents Knowledge Representation I Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
More informationPropositional Logic Arguments (5A) Young W. Lim 11/30/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
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 Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationFrom imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events
From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events Giuseppe Sanfilippo Dipartimento di Scienze Statistiche e Matematiche S. Vianelli,
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 informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationProof Methods for Propositional Logic
Proof Methods for Propositional Logic Logical equivalence Two sentences are logically equivalent iff they are true in the same models: α ß iff α β and β α Russell and Norvig Chapter 7 CS440 Fall 2015 1
More informationDeduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More informationReasoning. Inference. Knowledge Representation 4/6/2018. User
Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world
More informationLogic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014
John Nachbar Washington University December 26, 2014 Logic and Proofs 1 1 Overview. These notes provide an informal introduction to some basic concepts in logic. For a careful exposition, see, for example,
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationCS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Knowledge, Reasoning, and Planning Part 2 Logical Agents R&N: Chapter 7 1 Illustrative example: Wumpus World (Somewhat
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
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 informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More information4 Quantifiers and Quantified Arguments 4.1 Quantifiers
4 Quantifiers and Quantified Arguments 4.1 Quantifiers Recall from Chapter 3 the definition of a predicate as an assertion containing one or more variables such that, if the variables are replaced by objects
More informationPropositional logic II.
Lecture 5 Propositional logic II. Milos Hauskrecht milos@cs.pitt.edu 5329 ennott quare Propositional logic. yntax yntax: ymbols (alphabet) in P: Constants: True, False Propositional symbols Examples: P
More informationLogical agents. Chapter 7. Chapter 7 1
Logical agents Chapter 7 Chapter 7 1 Outline Knowledge-based agents Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationPROBABILISTIC LOGIC. J. Webster (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering Copyright c 1999 John Wiley & Sons, Inc.
J. Webster (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering Copyright c 1999 John Wiley & Sons, Inc. PROBABILISTIC LOGIC A deductive argument is a claim of the form: If P 1, P 2,...,andP
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 informationTOWARDS A MENTAL PROBABILITY LOGIC. Niki PFEIFER & Gernot D. KLEITER Universität Salzburg, Austria. Introduction
Psychologica Belgica 2005, 45-1, 71-99. Niki PFEIFER & Gernot D. KLEITER Universität Salzburg, Austria We propose probability logic as an appropriate standard of reference for evaluating human inferences.
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 information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
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 informationProposition logic and argument. CISC2100, Spring 2017 X.Zhang
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationWhere are my glasses?
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
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 informationCS 7180: Behavioral Modeling and Decision- making in AI
CS 7180: Behavioral Modeling and Decision- making in AI Review of Propositional Logic Prof. Amy Sliva September 7, 2012 Outline General properties of logics Syntax, semantics, entailment, inference, and
More informationComputational Intelligence Lecture 13:Fuzzy Logic
Computational Intelligence Lecture 13:Fuzzy Logic Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationHow to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.
Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,
More informationFuzzy Sets and Systems. Lecture 4 (Fuzzy Logic) Bu- Ali Sina University Computer Engineering Dep. Spring 2010
Fuzzy Sets and Systems Lecture 4 (Fuzzy Logic) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Outline Fuzzy Logic Classical logic- an overview Multi-valued logic Fuzzy logic Fuzzy proposition
More information