The coherence principle Generalizing WFS in the same way yields unintuitive results: pacifist(X)  not hawk(X) hawk(X)  not pacifist(X) ¬ pacifist(a)

Slides:



Advertisements
Similar presentations
Joe Levines Purple Haze. Physical/Phenomenal Gaps P = the complete microphysical truth Q = a phenomenal truth Q1: Is there an epistemic gap between.
Advertisements

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Logic Programming Automated Reasoning in practice.
Machine Learning Instance Based Learning & Case Based Reasoning Exercise Solutions.
Updates plus Preferences Luís Moniz Pereira José Júlio Alferes Centro de Inteligência Artificial Universidade Nova de Lisboa Portugal JELIA’00, Málaga,
Justification-based TMSs (JTMS) JTMS utilizes 3 types of nodes, where each node is associated with an assertion: 1.Premises. Their justifications (provided.
1 Inductive Equivalence of Logic Programs Chiaki Sakama Wakayama University Katsumi Inoue National Institute of Informatics ILP
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Default Reasoning the problem: in FOL, universally-quantified rules cannot have exceptions –  x bird(x)  can_fly(x) –bird(tweety) –bird(opus)  can_fly(opus)
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
WFSX programming Prolog programming style, but with the WFSX semantics Requires: –A new proof procedure (different from SLDNF), complying with WFS, and.
Logic.
Auto-Epistemic Logic Proposed by Moore (1985) Contemplates reflection on self knowledge (auto-epistemic) Permits to talk not just about the external world,
A rewritting method for Well-Founded Semantics with Explicit Negation Pedro Cabalar University of Corunna, SPAIN.
Well-founded Semantics with Disjunction João Alcântara, Carlos Damásio and Luís Moniz Pereira Centro de Inteligência Artificial.
Logic Concepts Lecture Module 11.
Copyright © Cengage Learning. All rights reserved.
João Alcântara, Carlos Damásio and Luís Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática, Faculdade.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 4 By Herb I. Gross and Richard A. Medeiros next.
1 Basic abstract interpretation theory. 2 The general idea §a semantics l any definition style, from a denotational definition to a detailed interpreter.
The idea of completion In LP one uses “if” but mean “iff” [Clark78] This doesn’t imply that -1 is not a natural number! With this program we mean: This.
João Alcântara, Carlos Damásio and Luís Moniz Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática,
Auto-Epistemic Logic Proposed by Moore (1985) Contemplates reflection on self knowledge (auto-epistemic) Allows for representing knowledge not just about.
Existential Graphs and Davis-Putnam April 3, 2002 Bram van Heuveln Department of Cognitive Science.
LP and Non-Monotonicity LP includes a non-monotonic form of default negation not L is true if L cannot (now) be proven This feature is used for representing.
Extended LPs In Normal LPs all the negative information is implicit. Though that’s desired in some cases (e.g. the database with flight connections), sometimes.
Knoweldge Representation & Reasoning
ASP vs. Prolog like programming ASP is adequate for: –NP-complete problems –situation where the whole program is relevant for the problem at hands èIf.
ASP vs. Prolog like programming ASP is adequate for: –NP-complete problems –situation where the whole program is relevant for the problem at hands èIf.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Decision Theory CHOICE (Social Choice) Professor : Dr. Liang Student : Kenwa Chu.
CPS 170: Artificial Intelligence Propositional Logic Instructor: Vincent Conitzer.
CSNB234 ARTIFICIAL INTELLIGENCE
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
COMLLICATIONS OF CHRONIC PEPTIC ULCER
Combining Answer Sets of Nonmonotonic Logic Programs Chiaki Sakama Wakayama University Katsumi Inoue National Institute of Informatics.
Web Science & Technologies University of Koblenz ▪ Landau, Germany Stable Models See Bry et al 2007.
LDK R Logics for Data and Knowledge Representation ClassL (part 3): Reasoning with an ABox 1.
Steffen Staab Advanced Data Modeling 1 of 32 WeST Häufungspunkte Bifurkation: x n+1 = r x n (1-x n ) Startwert x 0 = 0,25.
Pattern-directed inference systems
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Actions Planning and Defeasible Reasoning Guillermo R. Simari Alejandro J. García Marcela Capobianco Dept. of Computer Science and Engineering U NIVERSIDAD.
LDK R Logics for Data and Knowledge Representation PL of Classes.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Extra slides for Chapter 3: Propositional Calculus & Normal Forms Based on Prof. Lila Kari’s slides For CS2209A, 2009 By Dr. Charles Ling;
KR A Principled Framework for Modular Web Rule Bases and its Semantics Anastasia Analyti Institute of Computer Science, FORTH-ICS, Greece Grigoris.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
LDK R Logics for Data and Knowledge Representation ClassL (part 2): Reasoning with a TBox 1.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
June 21, Reasoning about explicit strictness in a lazy language using mixed lazy/strict semantics Marko van Eekelen Maarten de Mol Nijmegen University,
October 19th, 2007L. M. Pereira and A. M. Pinto1 Approved Models for Normal Logic Programs Luís Moniz Pereira and Alexandre Miguel Pinto Centre for Artificial.
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Recovering and Exploiting Structural Knowledge from CNF Formulas
Contradiction-tolerant TMS
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
CS 416 Artificial Intelligence
Automated Reasoning in Propositional Logic
CSNB234 ARTIFICIAL INTELLIGENCE
ECE 352 Digital System Fundamentals
THE LAWS OF LOGIC Let’s be reasonable!.
Peptic Ulcer Disease Candice W. Laney Spring 2014.
Generalized Diagnostics with the Non-Axiomatic Reasoning System (NARS)
Case Report History A 44-year-old housewife presented to the emergency department with 1-day history of upper abdominal pain and vomiting. The pain came.
Logics for Data and Knowledge Representation
Presentation transcript:

The coherence principle Generalizing WFS in the same way yields unintuitive results: pacifist(X)  not hawk(X) hawk(X)  not pacifist(X) ¬ pacifist(a) –Using the same method the WFS is: {¬pacifist(a)} –Though it is explicitly stated that a is non-pacifist, not pacifist(a) is not assumed, and so hawk(a) cannot be concluded. Coherence is not satisfied... Ü Coherence must be imposed

Imposing Coherence Coherence is: ¬L  T  L  F, for objective L According to the WFS definition, everything is false that doesn’t belong to  (T) To impose coherence, when applying  (T) simply delete all rules for the objective complement of literals in T “If L is explicitly true then when computing undefined literals forget all rules with head ¬L”

WFSX definition D The semi-normal version of P, P s, is obtained by adding not ¬L to every rule of P with head L D An interpretation (T U not F) is a PSM of ELP P iff: T =  P  Ps (T) T   Ps (T) F = H P -  Ps (T) T The WFSX semantics is determined by the knowledge ordering least PSM (wrt  )

WFSX example P:pacifist(X)  not hawk(X) hawk(X)  not pacifist(X) ¬ pacifist(a) Ps:pacifist(X)  not hawk(X), not ¬pacifist(X) hawk(X)  not pacifist(X ), not ¬hawk(X) ¬pacifist(a)  not pacifist(a) T 0 = {}  s (T 0 ) = {¬p(a),p(a),h(a),p(b),h(b)} T 1 = {¬p(a)}  s (T 1 ) = {¬p(a),h(a),p(b),h(b)} T 2 = {¬p(a),h(a)} T 3 = T 2 The WFM is: {¬p(a),h(a), not p(a), not ¬h(a), not ¬p(b), not ¬h(b)}

Properties of WFSX Complies with the coherence principle Coincides with WFS in normal programs If WFSX is total it coincides with the only answer-set It is sound wrt answer-sets It is supported, cumulative, and relevant Its computation is polynomial It has sound implementations (cf. below)

Inconsistent programs Some ELPs have no WFM. E.g. { a  ¬a  } What to do in these cases? Explosive approach: everything follows from contradiction taken by answer-sets gives no information in the presence of contradiction Belief revision approach: remove contradiction by revising P computationally expensive Paraconsistent approach: isolate contradiction efficient allows to reason about the non-contradictory part

WFSXp definition The paraconsistent version of WFSx is obtained by dropping the requirement that T and F are disjoint, i.e. dropping T   Ps (T) D An interpretation, T U not F, is a PSMp P iff: T =  P  Ps (T) F = H P -  Ps (T) T The WFSXp semantics is determined by the knowledge ordering least PSM (wrt  )

WFSXp example P:c  not ba b  a ¬ a d  not e Ps:c  not b, not ¬c a  not ¬a b  a, not ¬b ¬a  not a d  not e, not ¬d T 0 = {}  s (T 0 ) = {¬a,a,b,c,d} T 1 = {¬a,a,b,d}  s (T 1 ) = {d} T 2 = {¬a,a,b,c,d} T 3 = T 2 The WFM is: {¬a,a,b,c,d, not a, not ¬a, not b, not ¬b not c, not ¬c, not ¬d, not e}

Surgery situation A patient arrives with: sudden epigastric pain; abdominal tenderness; signs of peritoneal irritation The rules for diagnosing are: –if he has sudden epigastric pain abdominal tenderness, and signs of peritoneal irritation, then he has perforation of a peptic ulcer or an acute pancreatitis –the former requires surgery, the latter therapeutic treatment –if he has high amylase levels, then a perforation of a peptic ulcer can be exonerated –if he has Jobert’s manifestation, then pancreatitis can be exonerated –In both situations, the pacient should not be nourished, but should take H 2 antagonists

LP representation perforation  pain, abd-tender, per-irrit, not high-amylase pancreat  pain, abd-tender, per-irrit, not jobert ¬nourish  perforationh2-ant  perforation ¬nourish  pancreat h2-ant  pancreat surgery  perforationanesthesia  surgery ¬surgery  pancreat pain. per-irrit. ¬high-amylase. abd-tender. ¬jobert. The WFM is: {pain, abd-tender, per-irrit, ¬high-am, ¬jobert, not ¬pain, not ¬abd-tender, not ¬per-irrit, not high-am, not jobert, ¬nourish, h2-ant, not nourish, not ¬h2-ant, surgery, ¬surgery, not surgery, not ¬surgery, anesthesia, not anesthesia, not ¬anesthesia }

Results interpretation The symptoms are derived and non-contradictory Both perforation and pancreatitis are concluded He should not be fed ( ¬nourish ), but take H 2 antagonists The information about surgery is contradictory Anesthesia though not explicitly contradictory ( ¬anesthesia doesn’t belong to WFM) relies on contradiction (both anesthesia and not anesthesia belong to WFM) The WFM is: {pain, abd-tender, per-irrit, ¬high-am, ¬jobert, …, ¬nourish, h2-ant, not nourish, not ¬h2-ant, surgery, ¬surgery, not surgery, not ¬surgery,anesthesia, not anesthesia, not ¬anesthesia }