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
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
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
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
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
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The Art of Prolog: Programming Examples - Macintosh (Logic Programming)
The Art of Prolog: Programming Examples - Macintosh (Logic Programming)
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
On modular translations and strong equivalence
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
This paper studies the expressive powers of classes of logic programs that are obtained by restricting the number of positive literals (atoms) in the bodies of the rules. Three kinds of restrictions are considered, giving rise to the classes of atomic, unary and binary logic programs. The expressive powers of these classes of logic programs are compared by analyzing the existence of polynomial, faithful, and modular (PFM) translation functions between the classes. This analysis leads to a strict ordering of the classes of logic programs. The main result is that binary and unary rules are strictly more expressive than unary and atomic rules, respectively. This is the case even if we consider normal logic programs where negative literals may appear in the bodies of rules. Practical implications of the results are discussed in the context of a particular implementation technique for the stable model semantics of normal logic programs, namely contrapositive reasoning with rules.