Results 1 to 10 of about 763,157 (113)

Autoepistemic logic [PDF]

open access: bronzeJournal of the ACM, 1991
Autoepistemic logic is one of the principal modes of nonmonotonic reasoning. It unifies several other modes of nonmonotonic reasoning and has important application in logic programming. In the paper, a theory of autoepistemic logic is developed. This paper starts with a brief survey of some of the previously known results. Then, the nature
Wiktor Marek, Mirosław Truszczyński
semanticscholar   +4 more sources

Translating default logic into standard autoepistemic logic [PDF]

open access: bronzeJournal of the ACM, 1995
Since Konolige's translation of default logic into strongly grounded autoepistemic logic, several other variants of Moore's original autoepistemic logic that embody default logic have been studied. All these logics differ significantly from Moore's autoepistemic logic (standard AEL) in that expansions are subject to additional groundedness-
Georg Gottlob
semanticscholar   +4 more sources

Autoepistemic equilibrium logic and epistemic specifications

open access: greenArtificial Intelligence, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ezgi Iraz Su   +2 more
semanticscholar   +8 more sources

Founded World Views with Autoepistemic Equilibrium Logic [PDF]

open access: greenInternational Conference on Logic Programming and Non-Monotonic Reasoning, 2019
Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introduces subjective literals. A subjective literal allows checking whether some regular literal is true in
Pedro Cabalar   +2 more
semanticscholar   +4 more sources

Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control [PDF]

open access: greenarXiv.org, 2023
In this paper we define and study a multi-agent extension of autoepistemic logic (AEL) called distributed autoepistemic logic (dAEL). We define the semantics of dAEL using approximation fixpoint theory, an abstract algebraic framework that unifies ...
Marcos Cramer   +3 more
openalex   +3 more sources

The Complexity of Reasoning for Fragments of Autoepistemic Logic [PDF]

open access: greenTOCL, 2010
Autoepistemic logic extends propositional logic by the modal operator L. A formula ϕ that is preceded by an L is said to be “believed.” The logic was introduced by Moore in 1985 for modeling an ideally rational agent’s behavior and reasoning about his ...
Nadia Creignou   +3 more
semanticscholar   +4 more sources

Quantification in Autoepistemic Logic

open access: yesFundamenta Informaticae, 1991
Quantification in modal logic is interesting from a technical and philosophical standpoint. Here we look at quantification in autoepistemic logic, which is a modal logic of self-knowledge. We propose several different semantics, all based on the idea that having beliefs about an individual amounts to having a belief using a certain type of name for the
K. Konolige
semanticscholar   +4 more sources

Translating Multi-Agent Autoepistemic Logic into Logic Program

open access: diamondElectronic Notes in Theoretical Computer Science, 2002
AbstractIn 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 method that translates a MAEL theory into a logic program with integrity constraints.
Takahiro Kojima   +2 more
  +5 more sources

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

open access: greenLanguage and Automata Theory and Applications, 2011
We investigate the application of Courcelle's Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, the extension existence problem for default logic, as well as the expansion ...
Arne Meier   +3 more
openalex   +2 more sources

Embedding nonground logic programs into autoepistemic logic for knowledge-base combination [PDF]

open access: closedTOCL, 2011
In the context of the Semantic Web, several approaches for combining ontologies, given in terms of theories of classical first-order logic and rule bases, have been proposed.
Jos de Bruijn   +3 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy