Semantical considerations on nonmonotonic logic
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
Autoepistemic stable closures and contradiction resolution
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Embedding a default system into nonmonotonic logics
Fundamenta Informaticae
Towards automatic autoepistemic reasoning
JELIA '90 Proceedings of the European workshop on Logics in AI
Relating autoepistemic and default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Journal of the ACM (JACM)
Reasoning with parsimonious and moderately grounded expansions
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
A note on non-monotonic modal logic
Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Finding Extensions of Default Theories
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Epistemic Semantics for Fixed-Points Non-Monotonic Logics
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
Nonmonotonic Reasoning is Sometimes Simpler
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Decision Procedure for Autoepistemic Logic
Proceedings of the 9th International Conference on Automated Deduction
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
ACM Transactions on Database Systems (TODS)
Fixpoint 3-valued semantics for autoepistemic logic
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Revisiting quantification in autoepistemic logic
ACM Transactions on Computational Logic (TOCL)
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics
Journal of Logic, Language and Information
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Capturing Stationary and Regular Extensions with Reiter's Extensions
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Classifying Semi-Normal Default Logic on the Basis of its Expressive Power
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Generalized Default Logic: Minimal Knowledge, Autoepistemic and Default Reasoning Reconciled
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Evaluating the effect of semi-normality on the expressiveness of defaults
Artificial Intelligence
On the expressive power of semi-normal defaults in some semantic variants of default logic
AI Communications - Special issue on Artificial intelligence advances in China
On the expressive power of semi-normal defaults in some semantic variants of default logic
AI Communications - Artificial Intelligence Advances in China
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Default reasoning with preference within only knowing logic
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
First-order Non-monotonic Modal Logics
Fundamenta Informaticae
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Approximating operators and semantics for abstract dialectical frameworks
Artificial Intelligence
Hi-index | 0.01 |
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-conditions. Hence, the question naturally arises whether default logic can be translated into standard AEL at all. We show that a modular translation is not possible. However, we are able to construct a faithful polynomial-time translation from default logic into standard AEL, which is nonmodular. Our translation exploits the self-referentiality of AEL. It uses as an important intermediate step an embedding of Marek's and Truszczyn´ski's nonmonotonic logic N into standard AEL. It follows from our results that the expressive power of standard AEL is strictly greater than that of default logic.