Formalizing nonmonotonic reasoning systems
Artificial Intelligence
Results on translating defaults to circumscription
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
Towards automatic autoepistemic reasoning
JELIA '90 Proceedings of the European workshop on Logics in AI
A unifying framework for nonmonotonic reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
On the decidability and complexity of autoepistemic reasoning
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
The complexity of default reasoning under the stationary fixed point semantics
Information and Computation
On embedding default logic into Moore's autoepistemic logic
Artificial Intelligence
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Representation theory for default logic
Annals of Mathematics and Artificial Intelligence
Separating Disbeliefs from Beliefs in Autoepistemic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Nonmonotonic Reasoning by Monotonic Inference with Priority Constraints
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Infinitary Default Logic for Specification of Nonmonotonic Reasoning
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Revisiting quantification in autoepistemic logic
ACM Transactions on Computational Logic (TOCL)
Nonmonotonic Reasoning as Prioritized Argumentation
IEEE Transactions on Knowledge and Data Engineering
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
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
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
First-Order Ground Non-Monotonic Modal Logic
Fundamenta Informaticae
Default logic generalized and simplified
Annals of Mathematics and Artificial Intelligence
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
Four-Valued semantics for default logic
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
First-Order Ground Non-Monotonic Modal Logic
Fundamenta Informaticae
First-order Non-monotonic Modal Logics
Fundamenta Informaticae
Approximating operators and semantics for abstract dialectical frameworks
Artificial Intelligence
Hi-index | 0.01 |
This paper concentrates on comparing the expressive powers of five non‐monotonic logics that have appeared in the literature. For this purpose, the concept of a polynomial, faithful and modular (PFM) translation function is adopted from earlier work by Gottlob, but a weaker notion of faithfulness is proposed. The existence of a PFM translation function from one non‐monotonic logic to another is interpreted to indicate that the latter logic is capable of expressing everything that the former logic does. Several translation functions are presented in the paper and shown to be PFM. Moreover, it is shown that PFM translation functions are impossible in certain cases, which indicates that the expressive powers of the logics involved differ strictly. The comparisons made in terms of PFM translation functions give rise to an exact classification of non‐monotonic logics, which is then named as the expressive power hierarchy (EPH) of non‐monotonic logics. Three syntactically restricted variants of default logic are also analyzed, and EPH is refined accordingly. Most importantly, the classes of EPH indicate some astonishing relationships in light of earlier results on the expressive power of non‐monotonic logics presented by Gottlob as well as Bonatti and Eiter: Moore’s autoepistemic logic and prerequisite‐free default logic are of equal expressive power and less expressive than Reiter’s default logic and Marek and Truszczyński’s strong autoepistemic logic.