Logic programs with classical negation
Logic programming
Complexity results for disjunctive logic programming and application to nonmonotonic logics
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A logic of universal causation
Artificial Intelligence
Extending the Smodels system with cardinality and weight constraints
Logic-based 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
Testing the Equivalence of Logic Programs under Stable Model Semantics
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
On Negative Unfolding in the Answer Set Semantics
Logic-Based Program Synthesis and Transformation
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Modular Equivalence for Normal Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Merging Belief Bases Represented by Logic Programs
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Properties of programs with monotone and convex constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
The modal logic S4F, the default logic, and the logic here-and-there
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Strong equivalence for logic programs with preferences
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Relativized hyperequivalence of logic programs for modular programming
Theory and Practice of Logic Programming
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A stronger notion of equivalence for logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
On Semantic Update Operators for Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Logic programs with propositional connectives and aggregates
ACM Transactions on Computational Logic (TOCL)
Strong equivalence of logic programs with abstract constraint atoms
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Back and forth between rules and SE-models
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
On modular translations and strong equivalence
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Testing strong equivalence of datalog programs – implementation and examples
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A unifying perspective on knowledge updates
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
On condensing a sequence of updates in answer-set programming
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Strong equivalence of qualitative optimization problems
Journal of Artificial Intelligence Research
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
Logic programs $P$ and $Q$ are strongly equivalent if, given any program $R$, programs $P \cup R$ and $Q \cup R$ are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Lifschitz, Pearce and Valverde showed that Heyting's logic of here-and-there can be used to characterize strong equivalence for logic programs with nested expressions (which subsume the better-known extended disjunctive programs). This note considers a simpler, more direct characterization of strong equivalence for such programs, and shows that it can also be applied without modification to the weight constraint programs of Niemelä and Simons. Thus, this characterization of strong equivalence is convenient for the study of equivalent transformations of logic programs written in the input languages of answer set programming systems dlv and SMODELS. The note concludes with a brief discussion of results that can be used to automate reasoning about strong equivalence, including a novel encoding that reduces the problem of deciding the strong equivalence of a pair of weight constraint programs to that of deciding the inconsistency of a weight constraint program.