The Logic(s) of Logic Programming João Alcântara Carlos Viegas Damásio Luís Moniz Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática,

Slides:



Advertisements
Similar presentations
Query Answering based on Standard and Extended Modal Logic Evgeny Zolin The University of Manchester
Advertisements

Lecture 11: Datalog Tuesday, February 6, Outline Datalog syntax Examples Semantics: –Minimal model –Least fixpoint –They are equivalent Naive evaluation.
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,
The coherence principle Generalizing WFS in the same way yields unintuitive results: pacifist(X)  not hawk(X) hawk(X)  not pacifist(X) ¬ pacifist(a)
Answer Set Programming Overview Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma de Guadalajara
Logic.
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.
João Alcântara, Carlos Damásio and Luís Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática, Faculdade.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
Artificial Intelligence Modal Logic
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
João Alcântara, Carlos Damásio and Luís Moniz Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática,
A Preliminary Study on Reasoning About Causes Pedro Cabalar AI Lab., Dept. of Computer Science University of Corunna, SPAIN.
Luís Moniz Pereira CENTRIA, Departamento de Informática Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and Technology.
Introduction to AI & AI Principles (Semester 1) WEEK 8 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
1 CA 208 Logic Ex3 Define logical entailment  in terms of material implication  Define logical consequence |= (here the semantic consequence relation.
José Júlio Alferes Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Dept. of.
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.
Many Valued Logic (MVL) By: Shay Erov - 01/11/2007.
Reductio ad Absurdum Argumentation in Normal Logic Programs Luís Moniz Pereira and Alexandre Miguel Pinto CENTRIA – Centro de Inteligência Artificial,
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa Pierangelo Dell’Acqua Dept. of Science and.
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.
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Dept. of Science and Technology.
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Dept. of Science and Technology.
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.
Luís Moniz Pereira Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal Pierangelo Dell’Acqua Aida Vitória Dept. of Science.
Belief Revision Lecture 1: AGM April 1, 2004 Gregory Wheeler
Integrating DLs with Logic Programming Boris Motik, University of Manchester Joint work with Riccardo Rosati, University of Rome.
1. Motivation Knowledge in the Semantic Web must be shared and modularly organised. The semantics of the modular ERDF framework has been defined model.
Logical Agents Chapter 7 (based on slides from Stuart Russell and Hwee Tou Ng)
1 CENTRIA, Dept. Informática da Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal. 2 Institute of Computer Science,
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Modelling Adaptive Controllers with Evolving Logic Programs Pierangelo Dell’Acqua Anna Lombardi Dept. of Science and Technology - ITN Linköping University,
Pattern-directed inference systems
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Preference Revision via Declarative Debugging Pierangelo Dell’Acqua Dept. of Science and Technology - ITN Linköping University, Sweden EPIA’05, Covilhã,
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
L. M. Pereira, J. J. Alferes, J. A. Leite Centro de Inteligência Artificial - CENTRIA Universidade Nova de Lisboa, Portugal P. Dell’Acqua Dept. of Science.
KR A Principled Framework for Modular Web Rule Bases and its Semantics Anastasia Analyti Institute of Computer Science, FORTH-ICS, Greece Grigoris.
MODAL LOGIC Mathematical Logic and Theorem Proving Pavithra Prabhakar.
LDK R Logics for Data and Knowledge Representation ClassL (Propositional Description Logic with Individuals) 1.
NMR98 - Logic Programming1 Learning with Extended Logic Programs Evelina Lamma (1), Fabrizio Riguzzi (1), Luís Moniz Pereira (2) (1)DEIS, University of.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
LOGIC. Logic in general  Logics are formal languages for representing information such that conclusions can be drawn  Syntax defines the sentences in.
On the Semantics of Argumentation 1 Antonis Kakas Francesca Toni Paolo Mancarella Department of Computer Science Department of Computing University of.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Learning Three-Valued Logical Programs Evelina Lamma 1, Fabrizio Riguzzi 1, Luis Moniz Pereira 2 1 DEIS, Università di Bologna 2 Centro de Inteligencia.
Logics for Data and Knowledge Representation ClassL (part 1): syntax and semantics.
Artificial Intelligence Logical Agents Chapter 7.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
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.
Propositional Logic (a.k.a. Sentential Logic)
Computability and Complexity Issues of Extended RDF
EA C461 – Artificial Intelligence Logical Agent
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Logics for Data and Knowledge Representation
Back to “Serious” Topics…
PROPOSITIONAL LOGIC - SYNTAX-
ece 720 intelligent web: ontology and beyond
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

The Logic(s) of Logic Programming João Alcântara Carlos Viegas Damásio Luís Moniz Pereira Centro de Inteligência Artificial (CENTRIA) Depto. Informática, Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa Caparica, Portugal Altea, October, 2003

Outline 1.Objectives/Motivation 2.Overview of Substructural Logics 3.Frame Semantics for Logic Programming 4.Equilibrium Logics 5.Embeddings of Logic Programming Semantics 6.Conclusions and Future Work

1. Objectives/Motivation Definition of a logical framework general enough to capture SM, AS, PAS; WFS, WFSX and WFSX P –Present version is limited to programs without disjunction and without embedded implications Challenge of characterising a logic that deals with these semantics uniformly Inspired by Pearce and Cabalar's works, and by Greg Restall's proposals for Substructural Logics

Objectives/Motivation (cont) Preliminary difficulties –WFS-based semantics use partial interpretations, whilst SM, AS and PAS use only total ones. –Coherence principle is not satisfied in PAS –WFSX P and PAS are paraconsistent –In WFSX and WFSX P, '  ' frustates some expected properties of the implication

2. Overview of Substructural Logics They allow us to draw many conclusions collapsed in classical logic –More complex semantics We can inflate the number of values for a sentence We can provide more places at which sentences are evaluated (points in frames)

Preliminary Definitions Point set P =  P,   is a set P together with a partial order  on P. The set of propositions on P is the set of all subsets X of P which are closed upwards: if x  X and x  x’ then x’  X. The extensional connectives disjunction and conjunction have the usual interpretation Accessibility relations define intensional connectives: necessity and possibility, negation, and conditionals.

Accessibility Relations for Intensional Connectives Plump positive two-place (S) – for any x,y,x',y'  P, where x S y, x'  x and y  y' it follows that x' S y' Plump negative two-place (C) – for any x,y,x',y'  P, where x C y, x'  x and y'  y it follows that x' C y' Plump three-place (R) – for any x, y, z, x',y',z'  P, where Rx y z, x'  x,y'  y and z  z' then Rx' y' z'

Frames for Substructural Logics A Frame F is a point set P together with any number of accessibility relations on P. Evaluating formulae –Intensional connectives with accessibility relations in the frame –Plump conditions guarantee that  satisfies heredity: If (M,x)  F and x  y then (M,y)  F

3. Point Set for LP (Motivation) thnttnthpttp thn ttn thpttp thnttnthpttp thnttnthpttp A, not  A A,  A, not A not A, not  A AA ww A  w A  w Symbology: a) b) c) d)

Frame for Logic Programming thn ttn thpttp P =  [hhp,htp,thp,ttp,hhn,htn,thn,ttn],   hhnhtnhhp htp 81 possible “propositions” Enough to capture SM, AS, PAS; WFS, WFSX and WFSX P

Frame for Logic Programming Syntax: given a set of atoms , if ,  are formulae, p  , , not , ^ ,  (  ),   ,   ,   ,   ,  and  are also formulas Interpretation in a point w: I w - set of atoms HT 4 -Interpretation (B h,B t ), in which B h = (I hhp,I hhn,I htp,I htn ) B t = (I thp,I thn,I ttp,I ttn ) and I hxp  I txp, I txn  I hxn, x  {h,t}

Evaluation on Frames Given an HT 4 -Interpretation M = (B h,B t ), in P =  {hhp,htp,thp,ttp,hhn,htn,thn,ttn},   with the set of points W = {hhp,htp,thp,ttp,hhn,htn,thn,ttn} we say 1. (M,w)  p iff p  I w, where p   2. (M,w)   for all w  W 3. (M,w)   for no w  W 4. (M,w)     iff (M,w)   and (M,w)   5. (M,w)     iff (M,w)   or (M,w)  

Explicit Negation - R  hhn thn htn ttn hhp thp htp ttp R  is plump negative two- place 6. (M,w)   iff for all w' s.t. w R  w' (M,w')  

Default Negation - R not htphtn hhphhn ttp ttn thp thn 7. (M,w)  not  iff for all w' s.t. w R not w' (M,w')   R not is plump negative two- place

Semi-normality Operator - R ^ htphtnhhphhn ttpttnthpthn 8. (M,w)  ^  iff exists w' s.t. w R ^ w' (M,w')  

Possibility Operator - R  htphtnhhphhn ttpttnthpthn 9. (M,w)   (  ) iff exists w' s.t. w R  w' (M,w')   R  is plump positive two- place

Conditional - R hhp, hhp, hhp hhn, hhn, hhn htp, htp, htp htn, htn, htn thp, thp, thp thn, thn, thn ttp, ttp, ttp ttn, ttn, ttn hhp,hhp,thp hhn,thn,hhn thn,hhn,hhn thn,thn,hhn htp,htp,ttp htn,ttn,htn ttn,htn,htn ttn,ttn,htn thp,hhp,thp hhp,thp,thp hhp,hhp,thp thn,thn,hhn ttp,htp,ttp htp,ttp,ttp htp,htp,ttp ttn,ttn,htn 10. (M,w)     iff for all w',w'' s.t. R ww'w'' if (M,w')  , then (M,w'')   R is plump positive three-place

Model An HT 4 -Interpretation M is a model of a theory T iff for all w  W and all formulae  in T, then (M,w)  

4. Equilibrium Logics General Stable Model General Well-founded Model A belief set B is a general stable model of a theory T iff (B,B) is h-minimal among models of T A belief set B is a general well-founded model of T iff (B,B) is t-minimal among the general stable models of T

Minimality Conditions HT 4 -Interpretation (B h,B t ), in which (B h,B t )  h (C h,C t ) iff B t = C t and B h  C h (B h,B t )  t (C h,C t ) iff B t  F C t B h  C h iff I hxp  J hxp and J hxn  I hxn, x  {h,t} B t  F C t iff I thp  J thp, J thn  I thn, J ttp  I ttp and I ttn  J ttn B h = {I hhp,I hhn,I htp,I htn }B t = {I thp,I thn,I ttp,I ttn } Standard ordering: Fitting’s ordering:

5. Embeddings of LP Semantics Difficulties –WFS-based semantics use partial interpretations, whilst SM, AS and PAS use only total ones. –Coherence principle is not satisfied in PAS –WFSX P and PAS are paraconsistent –In WFSX and WFSX P, '  ' is not interpreted in the same way as in AS and PAS.

Axioms  A  not A  (A)  A  (  )  A   (A) not  (  ) Default Consistency (DC) Definedness (DE) Coherence Principle (CP) No Negative Information (NNI)

Interpreting logic programs rules AS and PAS (Nelson's implication) B  A A  (B \/ not A) WFSX and WFSX p B  A A  (B \/ ^B)

Truth-values for SM V 1 = [hhn,htn,thn,ttn] V 2 = [hhn,htn,thn,thp,ttn,ttp] ; V 3 = [hhn,hhp,htn,htp,thn,thp,ttn,ttp] not  A not A, not  A A, not  A Axioms: NNI + DC + CP + DE

Truth-values for AS V 1 = [] ; V 2 = [hhn,htn] ; V 3 = [hhn,htn,thn,ttn] ; V 4 = [hhn,htn,thn,thp,ttn,ttp] ; V 5 = [hhn,hhp,htn,htp,thn,thp,ttn,ttp] not A, not  A A, not  A  A, not A not  A not A Axioms CP + DC + DE

Truth-Values for PAS V1 = [] ; V2 = [thp,ttp] ; V3 = [hhp,htp,thp,ttp] ; V4 = [hhn,htn] ; V5 = [hhn,htn,thp,ttp] ; V6 = [hhn,htn,thn,ttn] ; V7 = [hhn,htn,thn,thp,ttn,ttp] ; V8 = [hhn,hhp,htn,htp,thp,ttp] ; V9 = [hhn,hhp,htn,htp,thn,thp,ttn,ttp] ; Axioms DC + DE

Truth-values for WFS V 1 = [hhn,htn,thn,ttn] ; V 2 = [hhn,htn,thn,ttn,ttp] ; V 3 = [hhn,htn,thn,thp,ttn,ttp] ; V 4 = [hhn,htn,htp,thn,ttn,ttp] ; V 5 = [hhn,htn,htp,thn,thp,ttn,ttp] ; V 6 = [hhn,hhp,htn,htp,thn,thp,ttn,ttp] Axioms NNI + DC + CP

Truth-values for WFSX and WFSX p WFSX Axioms: DC + CP 15 truth-values WFSX p Axioms: CP 25 (coherent) truth-values In WFSX p semantics, all operators are closed w.r.t. available truth-values !

Results (1) SM: NNI + DC + CP + DE A belief set B is a stable model of a program P iff (B,B) is a general stable model of P AS: CP + DC + DE A belief set B is an answer set of a program P iff (B,B) is a general stable model of P PAS: DC + DE A belief set B is a paraconsistent answer set of a program P iff (B,B) is a general stable model of P

Results (2) WFS: NNI + DC + CP A belief set B is a well-founded model of a program P iff (B,B) is a general well-founded model of P WFSX: DC + CP A belief set B is a WFSX of a program P iff (B,B) is a general well-founded model of P WFSX p : CP A belief set B is a WFSX p of a program P iff (B,B) is a general well-founded model of P

6. Conclusions We have defined a logic general enough to capture SM, AS, PAS; WFS, WFSX and WFSX P It allows to characterise logically the interrelationship among the semantics

Future Work Study of the disjunction for WFS based semantics Characterisation of the notion of logical consequence and entailment Detection of minimal properties in our frame to capture the cited semantics