Results on translating defaults to circumscription
Artificial Intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programs with classical negation
Logic programming
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Handbook of logic in artificial intelligence and logic programming (vol. 3)
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Fundamenta Informaticae - Special issue on Petri nets
Proceedings of the 1999 international conference on Logic programming
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Capturing Stationary and Regular Extensions with Reiter's Extensions
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Extending the Stable Model Semantics with More Expressive Rules
LPNMR '99 Proceedings of the 5th 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
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A logical characterisation of ordered disjunction
AI Communications - Answer Set Programming
Nested Preferences in Answer Set Programming
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
| Hi-index | 0.00 |
In this paper, the expressive power of disjunctive rules involving default negation is analyzed within a framework based on polynomial, faithful and modular (PFM) translations. The analysis is restricted to the stable semantics of disjunctive logic programs. A particular interest is understanding what is the effect if default negation is allowed in the heads of disjunctive rules. It is established in the paper that occurrences of default negation can be removed from the heads of rules using a PFM translation when default negation is allowed in the bodies of rules. In this case, we may conclude that default negation appearing in the heads of rules does not affect expressive power of rules. However, in the case that default negation may not be used in the bodies of rules, such a PFM translation is no longer possible. Moreover, there is no PFM translation for removing default negation from the bodies of rules. Consequently, disjunctive logic programs with default negation in the bodies of rules are strictly more expressive than those without.