NONMONOTONIC LOGIC AHMED SALMAN MALIK. OVERVIEW Monotonic Logic Nonmonotonic Logic Usage and Applications Comparison with other forms of logic Related.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Logic Programming Automated Reasoning in practice.
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
LING 388: Language and Computers Sandiway Fong Lecture 5: 9/8.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
The ancestor problem For the ancestor problem we have the following rules in AnsProlog: anc(X,Y)
Converting formulas into a normal form Consider the following FOL formula stating that a brick is an object which is on another object which is not a pyramid,
Knowledge Representation CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Knowledge Representation and Reasoning  Representação do Conhecimento e Raciocínio Computacional José Júlio Alferes and Carlos Viegas Damásio.
BIRDS FLY. is a bird Birds fly Tweety is a bird Tweety flies DEFEASIBLE NON-MONOTONIC PRESUMPTIVE?
Uncertain Knowledge Representation CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
For Friday Finish chapter 10 No homework (get started on program 2)
1 Chapter 13 Uncertainty Types of uncertainty Predicate logic and uncertainty Nonmonotonic logics Truth Maintenance Systems Fuzzy sets.
1 Reasoning in Uncertain Situations 9 9.0Introduction 9.1Logic-Based Abductive Inference 9.2Abduction: Alternatives to Logic 9.3The Stochastic Approach.
Reasoning System.  Reasoning with rules  Forward chaining  Backward chaining  Rule examples  Fuzzy rule systems  Planning.
Intelligent systems Lecture 6 Rules, Semantic nets.
Cs774 (Prasad)L7Negation1 Negation by Failure
1 Reasoning in Uncertain Situations 8a 8.0Introduction 8.1Logic-Based Abductive Inference 8.2Abduction: Alternatives to Logic 8.3The Stochastic Approach.
Auto-Epistemic Logic Proposed by Moore (1985) Contemplates reflection on self knowledge (auto-epistemic) Allows for representing knowledge not just about.
ARTIFICIAL INTELLIGENCE TECHNIQUES Knowledge Processing 1.
Knowledge Representation and Reasoning José Júlio Alferes Luís Moniz Pereira.
CPSC 433 Artificial Intelligence CPSC 433 : Artificial Intelligence Tutorials T01 & T02 Andrew “M” Kuipers note: please include.
Intro to AI Fall 2002 © L. Joskowicz 1 Introduction to Artificial Intelligence LECTURE 11: Nonmonotonic Reasoning Motivation: beyond FOL + resolution Closed-world.
KNOWLEDGE REPRESENTATION, REASONING AND DECLARATIVE PROBLEM SOLVING Chitta Baral Arizona State University Tempe, AZ
THE MODEL OF ASIS FOR PROCESS CONTROL APPLICATIONS P.Andreeva, T.Atanasova, J.Zaprianov Institute of Control and System Researches Topic Area: 12. Intelligent.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Artificial Intelligence Reasoning. Reasoning is the process of deriving logical conclusions from given facts. Durkin defines reasoning as ‘the process.
1 Knowledge Based Systems (CM0377) Lecture 12 (Last modified 2nd May 2002)
{ Logic in Artificial Intelligence By Jeremy Wright Mathematical Logic April 10 th, 2012.
Uncertainty1 Uncertainty Russell and Norvig: Chapter 14 Russell and Norvig: Chapter 13 CS121 – Winter 2003.
1 Knowledge Based Systems (CM0377) Lecture 13 (Last modified 2nd May 2002)
For Friday Exam 1. For Monday No reading Take home portion of exam due.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
For Wednesday Read chapter 13 Homework: –Chapter 10, exercise 5 (part 1 only, don’t redo) Progress for program 2 due.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
Logical Agents Logic Propositional Logic Summary
Grade Book Database Presentation Jeanne Winstead CINS 137.
Knowledge Processing 1. Aims of session  Introduce types of reasoning  Deterministic  Propositional logic  Predicate logic.
Artificial Intelligence 2004 Non-Classical Logics Non-Classical Logics Specific Language Constructs added to classic FOPL Different Types of Logics.
Uncertainty in AI. Birds can fly, right? Seems like common sense knowledge.
KNOWLEDGE BASED SYSTEMS
1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
For Wednesday Read chapter 13 No homework. Program 2 Any questions?
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Issues in Temporal and Causal Inference Pei Wang Temple University, USA Patrick Hammer Graz University of Technology, Austria.
Common Sense Inference Let’s distinguish between: Mathematical inference about common sense situations Example: Formalize theory of behavior of liquids.
EXPERT SYSTEMS BY MEHWISH MANZER (63) MEER SADAF NAEEM (58) DUR-E-MALIKA (55)
Knowledge Representation Lecture 2 out of 5. Last Week Intelligence needs knowledge We need to represent this knowledge in a way a computer can process.
Knowledge Representation
Chapter 7. Propositional and Predicate Logic
Limitations of First-Order Logic
Chapter 9. Rules and Expert Systems
Symbolic Reasoning under uncertainty
CSE 311: Foundations of Computing
Chapter 7: Beyond Definite Knowledge
Rules, RIF and RuleML.
Rule Exercises Status of the Ball Definitions and Rule 15
CS62S: Expert Systems Based on:
Jess Architecture Diagram WORKING MEMORY INFERENCE ENGINE EXECUTION ENGINE PATTERN MATCHER RULE BASE Here you can see how all the parts fit.
Reasoning with Uncertainty
1.1 Patterns and Inductive Reasoning
CPSC 433 : Artificial Intelligence Tutorials T01 & T02
Reasoning with Uncertainty Piyush Porwal ( ) Rohit Jhunjhunwala ( ) Srivatsa R. ( ) Under the guidance of Prof. Pushpak Bhattacharyya.
Knowledge Representation
Chapter 9. Rules and Expert Systems
Artificial Intelligence 2004 Non-Classical Logics
Answer Set Programming
Presentation transcript:

NONMONOTONIC LOGIC AHMED SALMAN MALIK

OVERVIEW Monotonic Logic Nonmonotonic Logic Usage and Applications Comparison with other forms of logic Related Topics Summary

MONOTONIC LOGIC Standard type of logic  If proven true, will be true forever  Facts provided can’t be modified Doesn’t always fit in real life.  Sidra is in Doha and Doha is in Qatar, so Sidra is in Qatar.  Sidra can always take a trip to United States

NONMONOTONIC LOGIC New facts can be added Current facts can be modified Conclusion can change  If A → B before new fact  Conclusion might change after new fact

EXAMPLE Consider the following example  All balls bounce  Football is a ball  Does football bounce Of course?  What about a football with no air filled in? Conclusions change with new facts

REAL LIFE USAGE Used in artificial intelligent systems  For its adaptability  Adding, removing and modifying facts  To reach appropriate conclusions for appropriate scenarios

APPLICATION Consider an example that can’t be handled by monotonic logic  Birds can fly Seems logical, right?

EXCEPTIONS? What about exceptions?  Ostrich, Penguins

EXCEPTIONS Bird(x) → Flies(x) How to handle exceptions?  Bird(x)  Abnormal(x) → Flies(x) Through nonmonotonic logic, we handle exceptions

HANDLING EXCEPTIONS We know  Ostrich(x) → Abnormal(x)  Ostrich is not a normal bird We conclude  Ostrich(x) → Bird(x)  Flies(x) We make all exceptions this way

SPECIFYING DEFAULTS Monotonic logic has formal systems to handle defaults  Defaults: Known facts and rules Nonmonotonic logic uses incomplete and uncertain information to form patterns for decision making  Abduction: Interpretation of the rules and facts.

REASONING Default logic  The predicate logic used as set of inferences Modal Operator - consistent with known facts   x,y: A(x,y)  B(x,y)  C (x,y)  Here B(x,y) is the Modal Operator

ABDUCTION For a given fact  A(x) → B(x) and  A(x) is sufficient for B(x)  Although, A(x) is not required for B(x)

INHERITANCE DIAGRAM Flying Things BirdsOstriches AlmaJack

COMPARISON WITH PROBABILITY Nomonontonic logic isn’t compatible with probability The uncertainty and addition of facts disturb the probability model.

COMPARISON WITH CLASSICAL LOGIC Always results in a conclusion Classical logic might loop forever with incomplete information Would return wrong answer, instead of none.

RELATED TOPICS Modal Logic  Modelling reasoning about knowledge, actions or time Epistemic Logic  Uses modal logic to reason about knowledge Deontic Logic  The representation of normative knowledge

SUMMARY Adapts with addition, removal and modification of new facts. Handling exceptions Used in artificial intelligence for decision making purposes Helpful where predicate or classic logic falls short

QUESTIONS?