Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
Results on translating defaults to circumscription
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
A unifying framework for nonmonotonic reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Modal nonmonotonic logics: ranges, characterization, computation
Journal of the ACM (JACM)
Handbook of logic in artificial intelligence and logic programming (vol. 3): nonmonotonic reasoning and uncertain reasoning
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
On embedding default logic into Moore's autoepistemic logic
Artificial Intelligence
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
On the intertranslatability of non-monotonic logics
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
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
| Hi-index | 0.00 |
Normal default logic (NDL) and semi-normal default logic (SNDL) are syntactically restricted variants of Reiter's default logic (DL). Although semi-normal defaults have only a slightly more general form than normal defaults, SNDL does not share the nice properties of NDL (e.g., semi-monotonicity). In this note, we address the effect of semi-normality on the expressive power of defaults, using a classification method based on polynomial, faithful, and modular (PFM) translation functions. The resulting classification indicates that SNDL and DL are of equal expressive power, which strictly exceeds that of NDL. This strengthens an earlier result achieved by Marek and Truszczyński, who establish the equivalence of weak semi-normal defaults with general defaults. Furthermore, it is established that prerequisite-free fragments of DL and SNDL (PDL and PSNDL) are of equal expressive power. Consequently, PSNDL is less expressive than DL and SNDL, incomparable with NDL, and more expressive than preferential entailment (a generalized form of circumscription). The latter result is in sharp contrast with Imielinski's result, which states that prerequisite-free and semi-normal default theories can be modularly translated into preferential entailment.