Sciweavers

74 search results - page 2 / 15
» On the Parameterized Complexity of Default Logic and Autoepi...
Sort
View
CORR
2010
Springer
202views Education» more  CORR 2010»
13 years 5 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
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 ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
IJCAI
2007
13 years 6 months ago
From Answer Set Logic Programming to Circumscription via Logic of GK
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
Fangzhen Lin, Yi Zhou
AMAI
2006
Springer
13 years 5 months ago
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
Miroslaw Truszczynski
AAAI
2000
13 years 6 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
AAAI
2006
13 years 6 months ago
Towards an Axiom System for Default Logic
Recently, Lakemeyer and Levesque proposed a logic of onlyknowing which precisely captures three forms of nonmonotonic reasoning: Moore's Autoepistemic Logic, Konolige's ...
Gerhard Lakemeyer, Hector J. Levesque