Artificial Intelligence Expert Systems Logic - PowerPoint PPT Presentation

1 / 16
About This Presentation
Title:

Artificial Intelligence Expert Systems Logic

Description:

Tautology. Contradiction. Contingency. wff: Well-Formed Formula ... Tautology, ... Theorem is a Tautology. Completeness. Every Tautology is a Theorem ... – PowerPoint PPT presentation

Number of Views:125
Avg rating:3.0/5.0
Slides: 17
Provided by: justin79
Category:

less

Transcript and Presenter's Notes

Title: Artificial Intelligence Expert Systems Logic


1
Artificial Intelligence / Expert SystemsLogic
  • Justin Gaudry
  • May 29, 2007

2
Logic is
  • Reasoning
  • Determining Truth Values of Statements
  • Creating Equivalences
  • Determining Validity of Arguments

3
Propositions
  • Simple Declarative Sentences With Either a True
    or False Value at Some Given Point in Time
  • No Variables
  • No Ambiguity
  • No Opinion

4
Logical Operators
  • And
  • Or
  • Not
  • Implication
  • Xor (Not Equal)
  • Equivalence (Equal, iff)

5
Predicates
  • Allow Variables
  • Provide a Characteristic About the Variable or a
    Relationship Between Multiple Variables
  • Instantiation of a Variable Gives the Predicate a
    Truth Value
  • Quantification of a Variable Gives the Predicate
    a Truth Value

6
Propositional Statements
  • Sequence of Propositions and Logical Operators
    Resulting in a Truth Value for Each Possible Set
    of Input
  • Tautology
  • Contradiction
  • Contingency
  • wff Well-Formed Formula (Syntactically Correct)

7
Logical Equivalence
  • Two Statements are Logically Equivalent if
  • They Have the Same Truth Table
  • They Can Be Manipulated Using Laws (Equivalences)
    of Propositional Logic to Look Identical
  • Logically Equivalent Statements Can Be Freely
    Substituted for One Another

8
Laws (Equivalences)
  • Commutative, Associative, Distributive
  • Double Negation, Idempotence, DeMorgans
  • Identity, Domination (Boundness), Complement
  • Absorption
  • Proofs
  • Laws Only Apply to And, Or, Not

9
Logical Validity
  • An Argument is Composed of Premises Leading to a
    Conclusion
  • An Argument is Valid if the Conclusions are True
    whenever the Premises are True
  • Prove Validity in Two Ways
  • And Together Premises and Imply Conclusion
  • If Tautology, Logically Valid
  • Create Intermediate Conclusions Using Rules of
    Inference Which Lead to a (the) Final Conclusion

10
Logical Validity
  • Monotonic Logic
  • Every New Conclusion Is a Theorem
  • Non-Monotonic Logic
  • Discovery of New Information Can Invalidate
    Previous Conclusions

11
Deduction
  • Rules of Inference
  • Modus Ponens, Modus Tollens
  • Simplification, Conjunction, Addition
  • Hypothetical Syllogism, Disjunctive Syllogism
  • Implication Introduction

12
Proof Techniques
  • Direct Proof
  • Indirect Proof (Proof by Contrapositive)
  • Proof by Contradiction
  • Reductio Ad Absurdum

13
Predicate Quantifiers
  • Universal Quantifier
  • Existential Quantifier
  • Instantiation and Generalization
  • Deduction with Quantifiers

14
Predicate Logic
  • First-Order Predicate Logic (FOPL)
  • Only Quantify Terms
  • Constant
  • Variable
  • Higher-Order Predicate Logic
  • Can Also Quantify Predicates and Functions

15
Characteristics of Logical Systems
  • Soundness
  • Every Theorem is a Tautology
  • Completeness
  • Every Tautology is a Theorem
  • Decidability
  • Can Determine Whether Every wff Is a Theorem

16
Types of Reasoning
  • Deductive
  • Strengths Sound, Complete
  • Weakness No Factor for Uncertainty
  • Inductive
  • Strengths Allows For Uncertainty Via Predictions
    Based on History
  • Weakness Not Complete or Sound
  • Abductive
  • Strengths Possible Explanation Without Complete
    Knowledge
  • Weakness Based on B and A -gtB -gt A Fallacy
Write a Comment
User Comments (0)
About PowerShow.com