Replacements in non-ground answer-set programming

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2006, Pages 340-350

  Eiter, Thomas ^a   Fink, Michael ^a   Tompits, Hans ^a   Traxler, Patrick ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; COMPLEXITY RESULTS; FORMAL FRAMEWORK; NONMONOTONIC LOGIC PROGRAMS; OPTIMIZATION METHOD; PROGRAM OPTIMIZATION;

KNOWLEDGE REPRESENTATION;

EID: 78649722559     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. Brass, S., and Dix, J. 1999. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 38(3):167.213.
3. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2004. Simplifying Logic Programs Under Uniform and Strong Equivalence. In Lifschitz, V., and Niemelä, I., eds., Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-04), volume 2923 of LNCS, 87-99. Springer Verlag.
4. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2005. Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Veloso, M., and Kambhampati, S., eds., Proceedings of the 20th National Conference on Arti- -cial Intelligence (AAAI-05), 695-700. AAAI Press.
5. Eiter, T.; Fink, M.; and Woltran, S. 2005. Semantical Characterizations and Complexity of Equivalences in Stable Logic Programming. Technical Report INFSYS RR- 1843-05-01, Institut f̈ur Informationssysteme, Technische Universiẗat Wien, Austria. Accepted for publication in ACM Transactions on Computational Logic.
6. Eiter, T.; Tompits, H.; and Woltran, S. 2005. On Solution Correspondences in Answer Set Programming. In Kaelbling, L., and Saffiotti, A., eds., Proceedings of the 19th International Joint Conference on Arti-cial Intelligence (IJCAI-05), 97-102.
7. Ferraris, P. 2005. On Modular Translations and Strong Equivalence. In Baral, C.; Greco, G.; Leone, N.; and Terracina, G., eds., Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-05), volume 3552 of LNCS, 79-91. Springer Verlag.
8. Gelfond, M., and Leone, N. 2002. Logic Programming and Knowledge Representation - The A-Prolog Perspective. Artificial Intelligence 138(1-2):3-38.
9. Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9:365-385.
10. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2002. The DLV System for Knowledge Representation and Reasoning. Technical Report cs.AI/0211004, arXiv.org. Accepted for publication in ACM Transactions on Computational Logic.
11. Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4):526-541.
12. Lin, F., and Chen, Y. 2005. Discovering Classes of Strongly Equivalent Logic Programs. In Kaelbling, L., and Saffiotti, A., eds., Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI- 05), 516-521.
13. Osorio, M.; Navarro, J. A.; and Arrazola, J. 2001. Equivalence in Answer Set Programming. In Pettorossi, A., ed., Proceedings of the 11th International Workshop on Logic Based Program Synthesis and Transformation (LOPSTR- 01), volume 2372 of LNCS, 57-75. Springer Verlag.
14. Pearce, D., and Valverde, A. 2004a. Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning. In Alferes, J. J., and Leite, J. A., eds., Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA-04), volume 3229 of LNCS, 147-160. Springer Verlag.
15. Pearce, D., and Valverde, A. 2004b. Synonymous Theories in Answer Set Programming and Equilibrium Logic. In de Ḿantaras, R. L., and Saitta, L., eds., Proceedings of the 16th European Conference on Artificial Intelligence (ECAI-04), 388-392. IOS Press.
16. Pettorossi, A., and Proietti, M. 1994. Transformation of Logic Programs: Foundations and Techniques. Journal of Logic Programming 19/20:261-320.
17. Pettorossi, A., and Proietti, M. 1996. Rules and Strategies for Transforming Functional and Logic Programs. ACM Computing Surveys 28(2):360-414.
18. Pettorossi, A., and Proietti, M. 1998. Transformation of Logic Programs. In Gabbay, D. M.; Hogger, C. J.; and Robinson, J. A., eds., Handbook of Logic in Arti-cial Intelligence and Logic Programming, volume 5, 697-787. Oxford University Press.
19. Reingold, O. 2005. Undirected ST-Connectivity in Log- Space. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC-05), 376-385. ACM Press.
20. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138:181-234.
21. Turner, H. 2003. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming 3(4-5):602-622.
22. Wang, K., and Zhou, L. 2005. Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic 6(2):295-327.
23. Woltran, S. 2005. Answer Set Programming: Model Applications and Proofs-of-Concept. Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004). Available at http://www.kr.tuwien.ac.at/projects/ WASP/report.html.