Results 1 to 10 of about 1,092 (104)
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination [PDF]
, 2010 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.
Axel Polleres +4 more
core +6 more sources
The Complexity of Reasoning for Fragments of Autoepistemic Logic [PDF]
, 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 1985 for modeling an ideally rational agent's behavior and reasoning about his own ...
Creignou, Nadia +3 more
core +6 more sources
Implementing Default and Autoepistemic Logics via the Logic of GK [PDF]
, 2014 The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning.
Ji, Jianmin, Strass, Hannes
core +3 more sources
Notes on Nonmonotonic Autoepistemic Propositional Logic [PDF]
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki, 2011 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. It begins with a brief review of semantics of common patterns of nonmonotonic deduction arising from a lack ...
Marek A. Suchenek
doaj +2 more sources
A Knowledge Representation Framework Based on Epistemic Logic [PDF]
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki, 2014 We introduce a uniform non-monotonic framework for knowledge representation based on epistemic logic which is sufficiently general to encompass several nonmonotonic formalisms, including circumscription, autoepistemic logic, various semantics proposed ...
Teodor Przymusiński
doaj +1 more source
A Unified Algebraic Framework for Non-Monotonicity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Tremendous research effort has been dedicated over the years to thoroughly investigate non-monotonic reasoning. With the abundance of non-monotonic logical formalisms, a unified theory that enables comparing the different approaches is much called for ...
Nourhan Ehab, Haythem O. Ismail
doaj +1 more source
The Complexity of Reasoning for Fragments of Default Logic [PDF]
, 2009 Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\SigmaPtwo$-complete, and the complexity of the credulous and skeptical reasoning problem as
A.L. Selman +15 more
core +4 more sources
Reasoning about Minimal Belief and Negation as Failure
, 2011 We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including ...
Rosati, R.
core +1 more source
Characterizing and Extending Answer Set Semantics using Possibility Theory [PDF]
, 2013 Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information.
Bauters, Kim +3 more
core +2 more sources
Complexity of Non-Monotonic Logics [PDF]
, 2010 Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence.
Thomas, Michael, Vollmer, Heribert
core +1 more source