Testing the equivalence of logic programs under stable model semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424, Issue , 2002, Pages 493-504

  Janhunen, Tomi ^a   Oikarinen, Emilia ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; EQUIVALENCE CLASSES; FUNCTIONS; PROBLEM SOLVING; PROGRAM TRANSLATORS; RECONFIGURABLE HARDWARE; SEMANTICS; SOFTWARE TESTING;

ANSWER SET; ANSWER SET PROGRAMMING; COUNTER EXAMPLES; EQUIVALENCE TESTING; LOGIC PROGRAMS; SMODELS SYSTEMS; STABLE MODEL SEMANTICS; TRANSLATION FUNCTIONS;

LOGIC PROGRAMMING;

EID: 77952084592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
2. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080, Seattle, USA, August 1988. The MIT Press.
3. T. Janhunen, I. Niemelä, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411-419, Breckenridge, Colorado, April 2000. Morgan Kaufmann.
4. N. Leone et al. dlv-a disjunctive datalog system. http://www.dbai.tuwien. ac.at/proj/dlv/.
5. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
6. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Principles of Knowledge Representation and Reasoning: Proceedings of the 8th International Conference, pages 170-176, Tolouse, France, April 2002. Morgan Kaufmann.
7. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.
8. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer-Verlag, 1999.
9. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
10. I. Niemelä and P. Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491-521. Kluwer Academic Publishers, 2000.
11. I. Niemelä, P. Simons, and T. Soininen. Stable model semantics of weight constraint rules. In Proceedings of the 5th International Conference on LP & NMR, pages 317-331, El Paso, Texas, USA, December 1999. Springer-Verlag. LNAI 1730.
12. I. Niemelä, P. Simons, and T. Syrjänen. Smodels: a system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003033.
13. D. Pearce, H. Tompits, and S. Woltran. Encodings for equilibirium logic and logic programs with nested expressions. In P. Brazdil and A. Jorge, editors, Proceedings of the 10th Portuguese Conference on Artificial Intelligence, pages 306-320, Porto, Portugal, December 2001. Springer Verlag. LNAI 2258.
14. P. Simons. Extending the stable model semantics with more expressive rules. In Proceedings of the 5th International Conference on LP & NMR, pages 305-316, El Paso, Texas, USA, December 1999. Springer-Verlag. LNAI 1730.