Verifying the equivalence of logic programs in the disjunctive case

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 180-193

  Oikarinen, Emilia ^a   Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM TRANSLATORS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAM LISTINGS; CONSTRAINT THEORY; DECISION SUPPORT SYSTEMS; PROBLEM SOLVING; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; LOGIC PROGRAMS; SMODELS SYSTEMS; STABLE MODEL; WEIGHT CONSTRAINTS;

LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING (ASP); LOGIC PROGRAMS; STABLE MODEL SEMANTICS;

EID: 9444236180     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. M. Balduccini, M. Gelfond, R. Watson, and M. Nogueira. The USA-advisor: A case study in answer set planning. In Proc. of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), pages 439-442, Vienna, Austria, September 2001. Springer. LNAI 2173.
2. T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In Proc. of the 19th International Conference on Logic Programming (ICLP'03), 2003. To appear.
3. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Math. and AI, 15:289-323, 1995.
4. P. Ferraris and V. Lifschitz. Weight constraints as nested expressions. Available at http://www.cs.utexas.edu/users/vl/papers.html, 2003. Unpublished draft.
5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th International Conference on Logic Programming, pages 1070-1080, Seattle, USA, August 1988. MIT Press.
6. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proc. of the 7th International Conference on Logic Programming, pages 579-597, Jerusalem, Israel, June 1990. MIT Press.
7. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
8. I. Gent and T. Walsh. Beyond NP: the QSAT phase transition. In Proc. of the 16th National Conference on Artificial Intelligence and the 11th Conference on Innovative Applications of Artificial Intelligence, pages 648-653, Orlando, Florida, USA, July 1999. AAAI, MIT Press.
9. K. Inoue and C. Sakama. Negation as failure in the head. Journal of Logic Programming, 35(1):39-78, 1998.
10. T. Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Logic Programming and Nonmonotonic Reasoning, Proc. of the 6th International Conference, pages 93-106, Vienna, Austria, September 2001. Springer.
11. T. Janhunen. LPEQ 1.13 - a tool for testing the equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2002. Computer Program.
12. T. Janhunen. GnT 2 - a tool for computing disjunctive stable models. http://www.tcs.hut.fi/Software/gnt/, 2003. Computer Program.
13. T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI/0303009, March 2003.
14. T. Janhunen and E. Oikarinen. Testing the equivalence of logic programs under stable model semantics. In Logics in Artificial Intelligence, Proc. of the 8th European Conference, pages 493-504, Cosenza, Italy, September 2002. Springer.
15. N. Leone et al. The dlv system for knowledge representation and reasoning. CoRR: cs.AI/0211004, September 2003.
16. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
17. V. Lifschitz, L.R. Tang, and H. Turner. Nested expressions in logic programs. Annals of Math. and AI, 25(3-4):369-389, 1999.
18. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In D. Fensel et al., editors, Principles of Knowledge Representation and Reasoning: Proc. of the 8th International Conference, pages 170-176, Tolouse, France, April 2002. Morgan Kaufmann.
19. J.W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987.
20. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588-619, 1991.
21. 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, 1999.
22. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and AI, 25(3-4):241-273, 1999.
23. E. Oikarinen. DLPEQ 1.9 - a tool for testing the equivalence of disjunctive logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2003. Computer Program.
24. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
25. D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, and S. Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Proc. of the 18th International Conference on Logic Programming, pages 405-420, Copenhagen, Denmark, July-August 2002. Springer.
26. D. Pearce, H. Tompits, and S. Woltran. Encodings for equilibirium logic and logic programs with nested expressions. In Proc. of the 10th Portuguese Conference on Artificial Intelligence, pages 306-320, Porto, Portugal, December 2001. Springer.
27. T. Przymusinski. Extended stable semantics for normal and disjunctive logic programs. In Proc. of the 7th International Conference on Logic Programming, pages 459-477. MIT Press, 1990.
28. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.
29. H. Turner. Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4-5):609-622, 2003.