Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Results on translating defaults to circumscription
Artificial Intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
A deduction model of belief and its logics
A deduction model of belief and its logics
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
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Logic-based knowledge representation
Artificial intelligence today
The Logic Of Only Knowing As A Unified Framework For Non-Monotonic Reasoning
Fundamenta Informaticae
| Hi-index | 0.00 |
Circumscription on the one hand and autoepistemic and default logics on the other seem to have quite different characteristics as formal systems, which makes it difficult to compare them as formalizations of defeasible connmonsense reasoning. In this paper we accomplish two tasks: (1) we extend the original semantics of autoepistemic logic to a language which includes variables quantified into the context of the autoepistemic operator, and (2) we show that a certain class of autoepistemic theories in the extended language has a minimal-model semantics corresponding to circumscription. We conclude that all of the first-order consequences of parallel predicate circumscription can be obtained from this class of autoepistemic theories. The correspondence we construct also sheds light on the problematic treatment of equality in circumscription.