Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
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
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Extending the Stable Model Semantics with More Expressive Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
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
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Modular answer set programming
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |
Solving a problem in the answer set programming approach means constructing a logic program so that the answer sets of the program correspond to the solutions to the problem. Typically, a programmer develops a series of improved formulations for a particular problem. Consequently, the programmer is confronted by another problem, namely ensuring that subsequent formulations are equivalent, i.e., give rise to the same answer sets. To ease answer set programming, we propose a methodology for testing the equivalence of logic programs. The basic idea is to translate the logic programs P and Q under consideration into a single logic program R whose answer sets (if such exist) yield counter-examples to the equivalence of P and Q. The translation function presented in the paper has been implemented as a translator program LPEQ that enables the equivalence testing of logic programs using the SMODELS system. Experiments performed with LPEQ and SMODELS suggest that establishing the equivalence of logic programs in this way is in certain cases much faster than explicit cross-checking of answer sets.