Filters








325 Hits in 3.8 sec

Autoepistemic logic

Wiktor Marek, Mirosław Truszczyński
1991 Journal of the ACM  
Autoepistemic logic is one of the principa~modes of nonmonotonic reasoning. It umties several other modes of nonmonotonic reasoning and has important applications in logic programming.  ...  Then, the nature of nonmonotonicity is studied by investigating how membership of autoepistemic statements in autoepistemic theories depends on the underlying objective theory.  ...  Forcing captures the mechanism of nonmonotonicity in autoepistemic logic.  ... 
doi:10.1145/116825.116836 fatcat:ngrivoxco5czdfx36etcwcjmoy

Notes on Nonmonotonic Autoepistemic Propositional Logic

Marek A. Suchenek
2011 Zeszyty Naukowe  
It begins with a brief review of semantics of common patterns of nonmonotonic deduction arising from a lack of knowledge, including autoepistemic deduction, in terms of the fixed-point equation φ(T,E)=  ...  This paper comprises an in-depth study of semantics of autoepistemic logic that is based on author's may years of research in the subject matter.  ...  Corresponding autoepistemic consequence operation was given by Cn S−exp (T ) = {E | E is an S-expansion of T }. (19) This approach yielded a variety of nonmonotonic logic which, however, did not comprise  ... 
doi:10.26348/znwwsi.6.74 doaj:c6340de35be34085b8bb73eec7d6a7e1 fatcat:li3oy2wacfgffklqj7cpniycpy

Translating Multi-Agent Autoepistemic Logic into Logic Program

Toyama Katsuhiko, Kojima Takahiro, Inagaki Yasuyoshi
2002 Electronical Notes in Theoretical Computer Science  
Our approach has the following advantages: (1) We can obtain all extensions of a MAEL theory if we compute all stable models of the translated logic program. (2) We can fully use efficient techniques or  ...  In order to develop a proof procedure of multi-agent autoepistemic Logic (MAEL), a natural framework to formalize belief and reasoning including inheritance, persistence, and causality, we introduce a  ...  Preliminaries Multi-Agent Autoepistemic Logic MAEL [19] is a nonmonotonic logic for multi-agent systems and is formalized by extending AEL [13] to the one with multi-modality and multi-theory.  ... 
doi:10.1016/s1571-0661(04)80588-7 fatcat:klxrczxzh5debpoeol5bp26kdy

Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination [article]

Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2010 arXiv   pre-print
Autoepistemic logic (AEL) is an attractive formalism which allows to overcome these limitations, by serving as a uniform host language to embed ontologies and nonmonotonic logic programs into it.  ...  In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic and rule bases, have been proposed.  ...  Autoepistemic logic (AEL) [Moore 1985] , which extends classical logic with a single nonmonotonic modal belief operator, being essentially the nonmonotonic variant of the modal logic kd45 [Shvarts 1990  ... 
arXiv:0811.0359v3 fatcat:rqwms2zzu5hfpnaluooi7mwv4m

Uniform semantic treatment of default and autoepistemic logics

Marc Denecker, Victor W. Marek, Mirosław Truszczyński
2003 Artificial Intelligence  
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning.  ...  For each logic, we introduce a monotone operator on the lattice of belief pairs.  ...  Thus, the autoepistemic logic of Moore could be viewed as a nonmonotonic logic of belief and the default logic of Reiter could be viewed as a nonmonotonic logic of justified belief.  ... 
doi:10.1016/s0004-3702(02)00293-x fatcat:zpyvjdfugngkxloqxh6ma4pl7m

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too [article]

Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
2011 arXiv   pre-print
A fact apparently not observed earlier in the literature of nonmonotonic reasoning is that Reiter, in his default logic paper, did not directly formalize informal defaults.  ...  We argue that Reiter's default logic is a better formalization of Moore's intuitions about autoepistemic propositions than Moore's own autoepistemic logic.  ...  Acknowledgments The work of the first author was partially supported by FWO-Vlaanderen under project G.0489.10N. The work of the third author was partially supported by the NSF grant IIS-0913459.  ... 
arXiv:1108.3278v1 fatcat:5an7m6atife55dq4sk6vyff46q

Embedding nonground logic programs into autoepistemic logic for knowledge-base combination

Jos De Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2011 ACM Transactions on Computational Logic  
Autoepistemic logic (AEL) is an attractive formalism which allows to overcome these limitations, by serving as a uniform host language to embed ontologies and nonmonotonic logic programs into it.  ...  In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been proposed.  ...  Autoepistemic logic (AEL) [Moore, 1985] , which extends classical logic with a single nonmono-tonic modal belief operator, being essentially the nonmonotonic variant of the modal logic kd45 [Shvarts,  ... 
doi:10.1145/1929954.1929957 fatcat:qsowrks2lvcw7hwz2lci2js47m

On the Parameterized Complexity of Default Logic and Autoepistemic Logic [article]

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2011 arXiv   pre-print
for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems.  ...  We investigate the application of Courcelle's Theorem and the logspace version of Elberfeld etal. in the context of the implication problem for propositional sets of formulae, the extension existence problem  ...  Gottlob [7] proved that this problem is complete for the class Σ p 2 . Autoepistemic Logic.  ... 
arXiv:1110.0623v2 fatcat:hafvzwowunafdktnbjpfagxucu

Autoepistemic logics as a unifying framework for the semantics of logic programs

Piero A. Bonatti
1995 The Journal of Logic Programming  
Stable Semantics In [16] , Gelfond's autoepistemic semantics has been entirely rephrased in terms of logic programming concepts. This led to the notion of stable model.  ...  the atomic part of T provides the canonical model of P.  ...  (ii) It follows immediately from (i) and the definition of As. (iii) We have 99 E •s(B)-:  ... 
doi:10.1016/0743-1066(94)00022-x fatcat:7hpxcnl4ebe2jgnytqit45j4ta

Autoepistemic logic of first order and its expressive power

Li-Yan Yuan
1994 Journal of automated reasoning  
Our study demonstrates that autoepistemic logic of rst order is a very powerful framework for nonmonotonic reasoning, logic programming, deductive databases, and knowledge representation.  ...  in autoepistemic logic of rst order, Moore's AE logic, and Reiter's default logic.  ...  Acknowledgements The author would like to thank reviewers for providing valuable suggestions and constructive criticism to improve the presentation of the paper.  ... 
doi:10.1007/bf00881912 fatcat:mhgxvqicj5dgfizeekntr2i3ja

On the Parameterized Complexity of Default Logic and Autoepistemic Logic [chapter]

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2012 Lecture Notes in Computer Science  
problem for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems.  ...  algorithms (even in the sense of the large class XPnu), unless P = NP. * Work supported by DFG grant VO 630/6-2. † Work performed while employed at  ...  Gottlob [7] proved that this problem is complete for the class Σ p 2 . Autoepistemic Logic.  ... 
doi:10.1007/978-3-642-28332-1_33 fatcat:zwsu36kl6ff7tekwbnh4s63kmy

Fuzzy autoepistemic logic and its relation to fuzzy answer set programming

Marjon Blondeel, Steven Schockaert, Martine De Cock, Dirk Vermeir
2014 Fuzzy sets and systems (Print)  
Autoepistemic logic is an important formalism for nonmonotonic reasoning. It extends propositional logic by offering the ability to reason about an agent's (lack of) beliefs.  ...  We also define a fuzzy logic of minimal belief and negation-as-failure and use this as a tool to show that fuzzy autoepistemic logic generalizes fuzzy answer set programming.  ...  Both ASP and autoepistemic logic are nonmonotonic forms of commonsense reasoning.  ... 
doi:10.1016/j.fss.2012.09.012 fatcat:mfbvgiydovesrpruo2v5xn3avu

The relationship between stable, supported, default and autoepistemic semantics for general logic programs

W. Marek, V.S. Subrahmanian
1992 Theoretical Computer Science  
Acknowledgment We are grateful to an anonymous referee for his/her insightful comments which led us to strengthen many of the results of the paper.  ...  We thank Howard Blair for comments which helped simplify and improve many of the proofs as well as the presentation.  ...  In this paper, we study the connection between the supported model semantics for logic programming as developed by Apt, Blair and Walker [2] , and nonmonotonic logic based semantics for logic programming  ... 
doi:10.1016/0304-3975(92)90019-c fatcat:gfesc7l4efgllmsnjkulliliwy

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
He shows that autoepistemic logics of closed beliefs of Moore coincides with autoepistemic logic of closed beliefs in which the negative introspection operator used is Reiter's CWA.  ...  Moore [153] developed autoepistemic logic @EL), which is an improvement of the work by McDermott and Doyle. Instead of using a "possibly" modal operator, he uses a "necessarily" modal operator L.  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Semantic Matchmaking of Web Resources with Local Closed-World Reasoning

Stephan Grimm, Pascal Hitzler
2007 International Journal of Electronic Commerce  
In Section 2 we will briefly introduce OWL and approaches to local closed-world reasoning with the DL underlying OWL, namely autoepistemic description logics and description logics with circumscription  ...  It presents an application of two particular nonmonotonic extensions to DL, namely autoepistemic DL and DL with circumscription, to the problem of matchmaking with respect to their suitability for realising  ...  Autoepistemic Description Logics We now introduce the first nonmonotonic extension of description logics which we will study in this paper.  ... 
doi:10.2753/jec1086-4415120204 fatcat:jwanagqouvg35bio5vfctl4dua
« Previous Showing results 1 — 15 out of 325 results