AI Principles, Semester 2, Week 2, Lecture 4 Introduction to Logic Thinking, reasoning and deductive logic Validity of arguments, Soundness of

Similar documents
Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Handout #1: Mathematical Reasoning

CHAPTER 7 GENERAL PROOF SYSTEMS

Lecture 13 of 41. More Propositional and Predicate Logic

A Few Basics of Probability

CS510 Software Engineering

DEDUCTIVE & INDUCTIVE REASONING

CSE 459/598: Logic for Computer Scientists (Spring 2012)

2. The Language of First-order Logic

Rigorous Software Development CSCI-GA

Cosmological Arguments for the Existence of God S. Clarke

Course Outline Department of Computing Science Faculty of Science. COMP Applied Artificial Intelligence (3,1,0) Fall 2015

3. Mathematical Induction

Beyond Propositional Logic Lukasiewicz s System

Correspondence analysis for strong three-valued logic

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

Mathematical Induction

Introduction to formal semantics -

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Logic in general. Inference rules and theorem proving

One natural response would be to cite evidence of past mornings, and give something like the following argument:

Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

INDUCTIVE & DEDUCTIVE RESEARCH APPROACH

Mathematical Induction. Lecture 10-11

The Refutation of Relativism

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

General Philosophy. Dr Peter Millican, Hertford College. Lecture 3: Induction

Invalidity in Predicate Logic

Summary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)

Background Biology and Biochemistry Notes A

DISCRETE MATH: LECTURE 3

Quine on truth by convention

Basic Proof Techniques

Fixed-Point Logics and Computation

Algorithmic Software Verification

CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

P1. All of the students will understand validity P2. You are one of the students C. You will understand validity

Machine Learning: Overview

The epistemic structure of de Finetti s betting problem

Student Learning Outcome - The 15 Best Based Performance Criteria

Software Modeling and Verification

Computational Logic and Cognitive Science: An Overview

SECTION 10-2 Mathematical Induction

Logic and Reasoning Practice Final Exam Spring Section Number

The Syntax of Predicate Logic

Five High Order Thinking Skills

Predicate Logic Review

Introduction to Logic: Argumentation and Interpretation. Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D

SQL INJECTION ATTACKS By Zelinski Radu, Technical University of Moldova

ENGLISH PLACEMENT TEST

SEARCHING AND KNOWLEDGE REPRESENTATION. Angel Garrido

Full and Complete Binary Trees

The History of Logic. Aristotle ( BC) invented logic.


8. Inductive Arguments

LESSON TITLE: Jesus is the Way, the Truth, and the Life

A first step towards modeling semistructured data in hybrid multimodal logic

6.3 Conditional Probability and Independence

IAI : Expert Systems

Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.

Slippery Slopes and Vagueness

Sudoku puzzles and how to solve them

Is Justified True Belief Knowledge?

IAI : Knowledge Representation

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

University of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees

Building a Better Argument

FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE KNOWLEDGE REPRESENTATION AND NETWORKED SCHEMES

Last time we had arrived at the following provisional interpretation of Aquinas second way:

Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

Read this syllabus very carefully. If there are any reasons why you cannot comply with what I am requiring, then talk with me about this at once.

1.2 Forms and Validity

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Formal Verification and Linear-time Model Checking

Philosophical argument

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

Refer to: Present & future If-clause Main clause. ZERO Present + Present. If you can meet me at the car, that s easiest for me.

What Is Circular Reasoning?

Basic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX Semantics I September 11, 2008

California Treasures High-Frequency Words Scope and Sequence K-3

EFFICIENT KNOWLEDGE BASE MANAGEMENT IN DCSP

Iterated Dynamic Belief Revision. Sonja Smets, University of Groningen. website:

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

6.080/6.089 GITCS Feb 12, Lecture 3

! " # The Logic of Descriptions. Logics for Data and Knowledge Representation. Terminology. Overview. Three Basic Features. Some History on DLs

Scientific Reasoning: A Solution to the Problem of Induction

Fry Phrases Set 1. TeacherHelpForParents.com help for all areas of your child s education

Lecture 2. What is the Normative Role of Logic?

Neighborhood Data and Database Security

Inductive Reasoning Page 1 of 7. Inductive Reasoning

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

The Classes P and NP

Managerial Economics Prof. Trupti Mishra S.J.M. School of Management Indian Institute of Technology, Bombay. Lecture - 13 Consumer Behaviour (Contd )

Lecture 8 The Subjective Theory of Betting on Theories

Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1

Deductive reasoning is the application of a general statement to a specific instance.

Trust but Verify: Authorization for Web Services. The University of Vermont

Using sentence fragments

BBC LEARNING ENGLISH 6 Minute Grammar Future perfect continuous

APPENDIX 1 PROOFS IN MATHEMATICS. A1.1 Introduction 286 MATHEMATICS

Transcription:

AI Principles, Semester 2, Week 2, Lecture 4 Introduction to Logic Thinking, reasoning and deductive logic Validity of arguments, Soundness of arguments Formal systems Axioms, Inference, and Proof Propositional Logic and Predicate Logic are formal systems Semantics 1

Review of logic from last semester What did you learn about logic in last semesters lectures, (or know from elsewhere)? 2

Different kinds of movement of thought (from Guttenplan 1986, chapter 1) Three descriptions of an episode of thinking. One could characterise them as movements of thought. The subject in each case has one, and then other thoughts, which together form a series through which there is a kind of motion. Logic could be seen as containing laws of this sort of motion. Not all movements of thought of thought are the concern of logic 3

How do thoughts differ? (from Guttenplan 1986, chapter 1) Example 1: Brown is sitting at his desk gazing out of the window. He notices that the buds are just beginning to open on the trees. This reminds him of the unusually warm weather which was experienced last year at this time. That thought prompts the further thought that he must have his central heating boiler seen to as soon as possible. 4

How do thoughts differ? (from Guttenplan 1986, chapter 1) Example 2: Smith finds that her car won t start. She remembers that when Jones s car failed to start, it was because the distributor was wet. She also recalls reading that distributor problems are common in the sort of car she has. She is aware of how damp it is today. She concludes, therefore, that a wet distributor is the cause of the trouble. 5

How do thoughts differ? (from Guttenplan 1986, chapter 1) Example 3: Green is planning his summer holiday. He knows that he can go by aeroplane or car. If he goes by aeroplane, he will get there faster, but will be unable to take much luggage. If he goes by car, he can take much more. He recognises that the success of his holiday depends on his having the right sort of clothing for the unpredictable weather. He could not take the needed clothing on the aeroplane. He concludes that if the holiday is to be successful, he will have to go by car. 6

Questions to ponder about the three descriptions of thought What is the difference between Brown s thoughts, and the other two kinds of thoughts? Which thoughts might be described as making arguments? How do Smith and Green s thoughts differ? Which of these three kinds of thought shows reasoning? Which of these kinds of thought shows deductive reasoning? 7

Describing the three styles of thought Brown s thoughts. We might describe Brown s thoughts as associative thinking or thought by spreading activation. Patterns in his perceptual stimuli gives rise to a chain of thoughts which activate further thoughts. This kind of pattern recognition is not usually studied as part of logic reasoning, but may be studied with other AI representations, such as Semantic Networks or Artificial Neural Networks. Smith s thoughts. We might describe Smith s thoughts as a form of inductive reasoning. Smith relies upon past events and consideration of probabilities to inform her decisions. This kind of thought is termed inductive logic. Green s thoughts. Green s thoughts might be described as using deductive reasoning. In the description of Green s thought has Ifthen statements and facts, and makes conclusions after reasoning about these conditional statements and facts. 8

Inductive and deductive reasoning both share the concept of truth and falsity that may not be shared by other types of thinking. Inductive reasoning is going from true statements to true statements but it is a shaky process Deductive reasoning assumes the premises to true. Then if the premises are true the conclusions have to be true. There is nothing shaky about the transition. For deductive reasoning we can see that the process of going from premise to conclusions is independent of the truth of any assumptions. Arguments have premises and conclusions that may be true or false. When reasoning is deductive there is only one case that can be ruled out: that is when the premises for the argument are all true and the conclusion is false. 9

Valid and invalid deductive arguments Validity = An argument is VALID if and only if it is necessary that if all it premises are true, its conclusion is true The intuitive idea captured by this definition is this: If it is possible for the conclusion of an argument to be false when its premises are all true, then the argument is not reliable (that is, it is invalid) If true premises guarantee a true conclusion then the argument is valid. Alternatively, an argument is VALID if and only if it is impossible for all the premises to be true while the conclusion is false. When an argument is valid its premises ENTAIL its conclusion. 10

Examples of deductive arguments? The sun has shone every day for thousands of years, therefore the sun will shine tomorrow The sun is using up fuel which has a finite supply, therefore one day the sun will no longer shine If he is Napolean Bonaparte, then he is the Emperor of France He believes he is Napolean Bonaparte, therefore he believes he is Emperor of France (modal logic for reasoning about beliefs in 4 th logic lecture) 11

Sound arguments An argument is SOUND if and only if it is valid and all its premises are true. All sound arguments have true conclusions. An argument may be unsound in two ways: if it is invalid, or it has one or more false premises. 12

More on validity and soundness of arguments Why are the concepts of validity and soundness important in automated reasoning? If you have a reasoning system where all the arguments it produces are valid, how can you ensure that they are also sound? 13

Representing arguments in formal systems Logical deductive arguments have been represented in natural language since the time of Classical Greek philosophers. However, what drawbacks are there in using natural language to automate reasoning? 14

Representing arguments in formal systems Logical deductive arguments have been represented in natural language since the time of Classical Greek philosophers. However, what drawbacks are there in using natural language to automate reasoning? Natural language is ambigous, the automated processing of natural language is a difficult challenge in its own right. An answer is to represent argument and reasoning within formal systems 15

Formal Systems Formal systems in mathematics possess a number of elements: 1. A finite set of symbols 2. A grammar (syntax), that is a way of constructing well-formed formulae (wff) out of the symbols. (There should exist a decision procedure that can always tell whether a formulae is a wff) 3. A set of axioms 4. A set of inference rules 5. A set of theorems. This set includes all the axioms, plus all wffs which can be derived from previous-derived theorems by means of rules of inference. (There may not exist a decision procedure for deciding whether a wff is a theorem or not) *a formal system does not require any axioms to start with 16

The MU Puzzle In the MU puzzle, what were the: 1. set of symbols 2. grammar, 3. set of axioms 4. set of inference rules 5. set of theorems. 17

Definition of Proof within a formal system A sequence of wffs [ω 1, ω 2,...ω n is called a proof (or a deduction) of ω n from a set of wffs iff each ω i in the sequence is either in or can be inferred from a wff (or wffs) earlier in the sequence by using one of the rules of inference. If there is a proof of ω n from, we say that ω n is a theorem of the set ω n (ω n can be proved from ) R ω n (ω n can be proved from using the inference rules in R) (Nilsson page 221) 18

Definition of Proof within a formal system and linking inference with entailment A proof in a formal system is a sequence of well formed formulas leading from the initial set of well formed formulae to the new well formed formulae that is the subject of the proof 19

Propositional Logic and Predicate Logic are formal systems Both Propositional Logic and Predicate Logic are types of formal system, and we will spend the next few lectures learning how to form and use expressions in these logics. In the final lecture we will take a brief look at how to automate reasoning in Propositional Logic, and look at some other logics, which include Modal Logic, Temporal Logic, and Fuzzy Logic. What all these different logics possess in addition to syntax and rules of inference is semantics 20

Semantics Semantics has to do with associating elements of a logical language with aspects of the real world. In propositional logic, logical atoms are associated with propositions about the world. An association of atoms with propositions is called an interpretation. (Russel and Norvig page 203, Nilsson page 222) 21

Sentences Entails Sentences Semantics Representation World Semantics Aspect of the real world Follows Aspect of the real world 22

Conclusion Different kinds of thought and reasoning Whats it got to do with the MU puzzle Propositional Logic and Predicate Logic are formal systems Semantics 23