31,723 Hits in 4.6 sec

Characterization of logic program revision as an extension of propositional revision

2015 Theory and Practice of Logic Programming  
AbstractWe address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LPPa new LPQ.  ...  In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations  ...  We provide in Section 3 some necessary background on generalized logic programs, and we also introduce the notion on logic program revision, an axiomatic characterization of generalized logic program revision  ... 
doi:10.1017/s1471068415000101 fatcat:vdebpv7gpzgavonkaye274vv5a

Update by means of inference rules [chapter]

Teodor C. Przymusinski, Hudson Turner
1995 Lecture Notes in Computer Science  
We begin with a study of revision programming, introduced by Marek and Truszczy nski to formalize interpretation update in a language similar to logic programming.  ...  While revision programs provide a useful and natural de nition of interpretation update, they are limited to a fairly restricted set of update rules.  ...  In Section 5 we introduce an alternative characterization of revision programming, and in Section 6 we de ne the more general notion of rule update as a natural extension of this alternative characterization  ... 
doi:10.1007/3-540-59487-6_12 fatcat:bo5z6ne3xnezzofse5fslrtgky

Page 2652 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
This paper gives an abductive characterization of the ICL.  ...  Since the logic programs involved are subject to revision, a program is de- fined as consisting of a protected (or permanent) part, which cannot be affected by revision, and a revisable part.  ... 

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics [chapter]

James Delgrande, Pavlos Peppas, Stefan Woltran
2013 Lecture Notes in Computer Science  
Basing revision of logic programs on sets of SEmodels has the drawback that arbitrary sets of SE-models may not necessarily be expressed via a logic program.  ...  In the past few years, several approaches for revision (and update) of logic programs have been studied.  ...  More recently there has been work in belief revision with respect to subsets of propositional logic.  ... 
doi:10.1007/978-3-642-40564-8_27 fatcat:dnkuvxvukndavc57msnzo5a25e

Belief Base Change Operations for Answer Set Programming [chapter]

Patrick Krümpelmann, Gabriele Kern-Isberner
2012 Lecture Notes in Computer Science  
This construction is applicable in the propositional and the logic programming case.  ...  We show that many of the classic base revision postulates are applicable to the logic programming case.  ...  They made use of the semantic characterization of programs via SE-models and applied an adapted version of distance based revision operators from classic belief revision.  ... 
doi:10.1007/978-3-642-33353-8_23 fatcat:tvdrehccmfblxiwd7khdspc2pa

Possibilistic ASP Base Revision by Certain Input

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Eric Würbel
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content.  ...  The paper proposes two approaches of rule-based revision operators and presents their semantic characterization in terms of possibilistic distribution.  ...  Logical Properties In this section we go a step further in the characterization of Possibilistic ASP base revision by presenting logical properties of the proposed operators through a set of postulates  ... 
doi:10.24963/ijcai.2018/252 dblp:conf/ijcai/GarciaLPSW18 fatcat:a6ohn6jljrb3dkfnslsqoh4ori

The Truth, the Whole Truth, and Nothing But the Truth

João P. Martins
1991 The AI Magazine  
'When I was your age, I always did it for half-an-hour a day. Why, sometimes I've believed as many as six impossible things before breakfast.' Lewis Carroll, Through the Looking Glass  ...  Cravo for her help and fruitful discussions during compilation of this bibliography.  ...  [Eshghi 90 ] Describes a method for computing the stable models of propositional logic programs with negation as failure using the ATMS.  ... 
doi:10.1609/aimag.v11i4.866 dblp:journals/aim/Martins91 fatcat:23c7bhdz3jhdxhfnkjwugn6qme

Forthcoming Papers

2004 Artificial Intelligence  
We provide two kinds of semantics for this idea, give a logical characterization of the new model, study its relation with other operations of belief revision and contraction, and discuss its intuitive  ...  Revision by comparison Since the early 1980s, logical theories of belief revision have offered formal methods for the transformation of knowledge bases or "corpora" of data and beliefs.  ...  We thus arrive at an interpretation of prioritized normal free default logic as an observation logic, and we propose a semantics for this observation logic.  ... 
doi:10.1016/s0004-3702(04)00071-2 fatcat:tsabu6qxyvgvfcpkjzrkexxj3u

Nonmonotonic Logics and Their Algebraic Foundations [chapter]

Mirosław Truszczyński
2006 Lecture Notes in Computer Science  
We then point out to algebraic principles behind the two logics and present an abstract algebraic theory that unifies them and provides an effective framework to study properties of nonmonotonic reasoning  ...  We briefly discuss motivations that led to the emergence of nonmonotonic logics and introduce two major nonmonotonic formalisms, default and autoepistemic logics.  ...  Acknowledgments We acknowledge the support of NSF grant IIS-0325063 and KSEF grant 1036-RDE-008.  ... 
doi:10.1007/11874683_4 fatcat:u7klqrtejfe43c67l2vm2ga5x4

Contradiction removal semantics with explicit negation [chapter]

Luís Moniz Pereira, José J. Alferes, Joaquim N. Aparício
1994 Lecture Notes in Computer Science  
Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then a (the negation by default  ...  Let P be a logic program and J a p{interpretation. The operator x J : I!  ...  One such extension is the Answer Set semantics (AS) 4], which is shown to be an extension of Stable Model (SM) semantics 3] from the class of logic programs 8] to those with a second form of negation.  ... 
doi:10.1007/3-540-58095-6_7 fatcat:pz6rhm66qjfwvaljhxmgfzymoy

On Paraconsistent Belief Revision in LP

Nicolas Schwind, Sébastien Konieczny, Ramón Pino Pérez
Belief revision aims at incorporating, in a rational way, a new piece of information into the beliefs of an agent.  ...  In this work we discuss how to adapt these postulates when the underlying logic is Priest's LP logic, in order to model a rational change, while being a conservative extension of AGM/KM belief revision  ...  The third author has also been partially funded by the program PAUSE of Collège de France.  ... 
doi:10.1609/aaai.v36i5.20532 fatcat:wvh3ezphvjd5bhpo5oqwfthbme

Syntactic Propositional Belief Bases Fusion with Removed Sets [chapter]

Julien Hue, Odile Papini, Eric Wurbel
2007 Lecture Notes in Computer Science  
In order to efficiently implement RSF, the paper shows how RSF can be encoded into a logic program with answer set semantics, then presents an adaptation of the smodels system devoted to efficiently compute  ...  The notion of removed-set, initially defined in the context of belief revision is extended to fusion and most of the classical fusion operations are syntactically captured by RSF.  ...  Acknowledgements Work partially supported by the European Community under project VENUS (Contract IST-034924) of the "Information Society Technologies (IST) program of the 6th FP for RTD".  ... 
doi:10.1007/978-3-540-75256-1_9 fatcat:qkqxfgrorzgw3jcsu3b4tqlxmi

A Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics (Preliminary Report)

Faiq Miftakhul Falakh, Sebastian Rudolph, Kai Sauerwald
2021 Deutsche Jahrestagung für Künstliche Intelligenz  
We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics.  ...  We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM's original work). ? This is a preliminary report.  ...  Kai Sauerwald is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) Grant BE 1700/10-1 awarded to Christoph Beierle as part of the priority program "Intentional Forgetting  ... 
dblp:conf/ki/FalakhRS21 fatcat:dh7tht4gwndtfobdt5ltqqunkm

Strong and explicit negation in non-monotonic reasoning and logic programming [chapter]

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
1996 Lecture Notes in Computer Science  
Note that, as opposed to logic programs, in AEBX there is no need for recourse to a meta-linguistic declaration of revisables.  ...  This is achieved by declaring as revisables only badBattery and flatTire. u t This declaration of revisables is akin to the declaration of abducible literals in abductive logic programming.  ...  A Autoepistemic Logic of Beliefs Here we brie y recall the de nition of the Autoepistemic Logic of Beliefs, AEB, introduced by Przymusinski in 29].  ... 
doi:10.1007/3-540-61630-6_10 fatcat:poe63ccigzbibb5xu3tgyb6lxe

Page 6605 of Mathematical Reviews Vol. , Issue 92m [page]

1992 Mathematical Reviews  
More precisely, we give complete term rewriting systems for the modal propositional systems known as K, Q, T, and S5. These systems are presented as extensions of J.  ...  Logic Programming 12 (1992), no. 3, 281-298. Summary: “We explain new results relating modal propositional logic and rewrite rule systems.  ... 
« Previous Showing results 1 — 15 out of 31,723 results