Journal of Logic Programming
A study of nonmonotonic reasoning
A study of nonmonotonic reasoning
A logic of knowledge and justified assumptions
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Minimal belief and negation as failure
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A three-valued characterization for strong equivalence of logic programs
Eighteenth national conference on Artificial intelligence
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
A three-valued characterization for strong equivalence of logic programs
Eighteenth national conference on Artificial intelligence
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the Same set of stable models, even under the addition of new rules. As shown in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be simply reduced to equivalence in the logic of Here-and-There (HT). In this paper we provide an alternative based on 3-valued logic, using also, as a first step, a classical logic charaterization. We show that the 3-valued encoding provides a direct interpretation for nested expressions but, when moving to an unrestricted syntax, it generally yields different results from HT.