Alternative characterizations for program equivalence under answer-set semantics based on unfounded sets

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

Volumn 4932 LNCS, Issue , 2008, Pages 24-41

  Gebser, Martin ^a   Schaub, Torsten ^a   Tompits, Hans ^b   Woltran, Stefan ^b  

^a UNIVERSITY OF POTSDAM   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; EQUIVALENCE CLASSES; FOUNDATIONS; INFORMATION THEORY; LOGIC PROGRAMMING; MODEL CHECKING; PROBLEM SOLVING; RESEARCH; SEMANTICS; STANDARDS;

ANSWER SETS; ENCODINGS; EQUIVALENCE CHECKING; INTERNATIONAL SYMPOSIUM; KNOWLEDGE SYSTEMS; LOGIC PROGRAMS; MODEL THEORY; PROGRAM EQUIVALENCE; PROGRAM OPTIMIZATION; PROPOSITIONAL LOGICS; RESEARCH ISSUES; SET SEMANTICS; UNIFORM EQUIVALENCE;

STRUCTURED PROGRAMMING;

EID: 49949097511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77684-0_5     Document Type: Conference Paper

References (22)

1. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365-385 (1991)
2. Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620-650 ( 1991)
3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
4. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2), 69-112 (1997)
5. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum Press, New York (1978)
6. Fages, F.: Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60 (1994)
7. Lin, F. Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115-137 (2004)
8. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2), 261-268 (2006)
9. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on prepositional satisfiability. Journal of Automated Reasoning 36(4), 345-377 (2006)
10. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562 (2006)
11. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
12. Lee, J.: A model-theoretic counterpart of loop formulas. In: Kaelbling, L., Saffiotti, A. (eds.) IJCAI2005. Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 503-508. Professional Book Center (2005)
13. Gebser, M., Lee, J., Lierler, Y.: Elementary sets for logic programs. In: Gil, Y., Mooney, R. (eds.) AAAI 2006. Proceedings of the 21st National Conference on Artificial Intelligence. AAAI Press, California (2006)
14. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526-541 (2001)
15. Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224-238. Springer, Heidelberg (2003)
16. Turner, H.: Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming 3(4-5), 602-622 (2003)
17. Eiter, T., Leone, N., Pearce, D.: Assumption sets for extended logic programs. In: Gerbrandy, J., Marx, M., de Rijke, M., Venema, Y. (eds.) JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday. Amsterdam University Press (1999)
18. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Fensel, D., Giunchiglia, F., McGuinness, D., Williams, M. (eds.) KR 2002. Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning, pp. 170-176. Morgan Kaufmann, San Francisco (2002)
19. Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 306-320. Springer, Heidelberg (2001)
20. Pearce, D., Tompits, H., Woltran, S.: Characterising equilibrium logic and nested logic programs: Reductions and complexity. Technical Report GIA-TR-2007-12-01, Universidad Rey Juan Carlos (2007)
21. Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming 3(4-5), 499-518 (2003)
22. Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence 47(1-2), 79-101 (2006)