What is answer set programming?

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1594-1597

  Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMINGS; DECLARATIVE PROGRAMMINGS; NONMONOTONIC REASONINGS; PREPOSITIONAL LOGICS; SATISFIABILITY SOLVERS; SEARCH PROBLEMS;

APPLICATIONS; ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTER PROGRAMMING; INFORMATION THEORY; KNOWLEDGE REPRESENTATION;

PROLOG (PROGRAMMING LANGUAGE);

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

References (25)

1. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. Brooks, D. R.; Erdem, E.; Erdoĝan, S. T.; Minett, J. W.; and Ringe, D. 2007. Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning 39:471-511.
3. Dimopoulos, Y.; Nebel, B.; and Koehler, J. 1997. Encoding planning problems in non-monotonic logic programs. In Steel, S., and Alami, R., eds., Proceedings of European Conference on Planning, 169-181. Springer-Verlag.
4. Ferraris, P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 119-131.
5. Gebser, M.; Liu, L.; Namasivayam, G.; Neumann, A.; Schaub, T.; and Truszczynski, M. 2007. The First Answer Set Programming System Competition. In Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 3-17. Springer-Verlag.
6. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R., and Bowen, K., eds., Proceedings of International Logic Programming Conference and Symposium, 1070-1080. MIT Press.
7. Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-385.
8. Gelfond, M. 2008. Answer sets. In van Harmelen, F.; Lifschitz, V.; and Porter, B., eds., Handbook of Knowledge Representation. Elsevier.
9. Gogic, G.; Kautz, H.; Papadimitriou, C; and Selman, B. 1995. The comparative linguistics of knowledge representation. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 862-869.
10. Gomes, C. P.; Kautz, H.; Sabharwal, A.; and Selman, B. 2008. Satisfiability solvers. In van Harmelen, E; Lifschitz, V.; and Porter, B., eds., Handbook of Knowledge Representation. Elsevier.
11. Hanks, S., and McDermott, D. 1987. Nonmonotonic logic and temporal projection. Artificial Intelligence 33(3):379-412.
12. Lifschitz, V., and Razborov, A. 2006. Why are there so many loop formulas? ACM Transactions on Computational Logic 7:261-268.
13. Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2:526-541.
14. Lin, E, and Zhao, Y 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157:115-137.
15. Marek, V., and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag. 375-398.
16. Moore, R. 1985. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25(1):75-94.
17. Niemelä, I.; Simons, P.; and Soininen, T. 1999. Stable model semantics for weight constraint rules. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 317-331.
18. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25:241-273.
19. Nogueira, M.; Balduccini, M.; Gelfond, M.; Watson, R.; and Barry, M. 2001. An A-Prolog decision support system for the Space Shuttle. In Proceedings of International Symposium on Practical Aspects of Declarative Languages (PADL), 169-183.
20. Reiter, R. 1978. On closed world data bases. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. New York: Plenum Press. 119-140.
21. Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence 13:81-132.
22. Soininen, T, and Niemela, I. 1998. Developing a declarative rule language for applications in product configuration. In Gupta, G., ed., Proceedings of International Symposium on Practical Aspects of Declarative Languages (PADL), 305-319. Springer-Verlag.
23. Subrahmanian, V., and Zaniolo, C. 1995. Relating stable models and AI planning domains. In Proceedings of International Conference on Logic Programming (ICLP), 233-247.
24. Tiihonen, J.; Soininen, T; Niemelä, I.; and Sulonen, R. 2003. A practical tool for mass-customising configurable products. In Proceedings of the 14th International Conference on Engineering Design, 1290-1299.
25. Turner, H. 1997. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming 31:245-298.