Abstract
The term answer set programming (ASP) was coined by Vladimir Lifschitz to name a new declarative programming paradigm that has its roots in stable model (answer set) semantics of logic programs [16] and implementations of this semantics developed in the late 90’s. When working with the implementations it became evident that they are instantiations of a different programming paradigm [5, 8, 21, 23, 24] than that of standard logic programming. This new ASP paradigm can be characterized as follows. In ASP programs are theories of some formal system with a semantics that assigns to a theory a collection of sets (models) referred to as answer sets of the program. In order to solve a problem using ASP a program is devised such that the solutions of the problem can be retrieved from the answer sets of the program. An ASP solver is a system that takes as input a program and computes answer sets for it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, L.C., Massacci, F.: Verifying security protocols as planning in logic programming. ACM Transactions on Computational Logic 2(4), 542–580 (2001)
Aura, T., Bishop, M., Sniegowski, D.: Analyzing single-server network inhibition. In: Proceedings of the IEEE Computer Security Foundations Workshop, Cambridge, UK, July 2000, pp. 108–117. IEEE Computer Society Press, Los Alamitos (2000)
Balduccini, M., Barry, M., Gelfond, M., Nogueira, M., Watson, R.: An A-prolog decision support system for the space shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Buccafurri, F., Leone, N., Rullo, P.: Strong and weak constraints in disjunctive datalog. In: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pp. 2–17. Springer, Heidelberg (1997)
Dimopoulos, Y., Nebel, B., Koehler, J.: Encoding planning problems in non-monotonic logic programs. In: Proceedings of the Fourth European Conference on Planning, Toulouse, France, September 1997, pp. 169–181. Springer, Heidelberg (1997)
East, D., Truszczyński, M.: More on wire routing with ASP. In: Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, USA, March 2001, pp. 39–44. AAAI Press, Menlo Park (2001)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarnello, F.: The KR system dlv: Progress report, comparisons and benchmarks. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, Trento, Italy, June 1998, pp. 406–417. Morgan Kaufmann Publishers, San Francisco (1998)
Erdem, E., Lifschitz, V., Wong, M.D.F.: Wire routing and satisfiability planning. In: Proceedings of the First International Conference on Computational Logic, Automated Deduction: Putting Theory into Practice, London, U.K, July 2000, pp. 822–836. Springer, Heidelberg (2000)
Erdem, E., Lifschitz, V., Ringe, D.: Temporal phylogenetic networks and logic programming. Theory and Practice of Logic Programming (to appear)
Erdem, E., Wong, M.D.F.: Rectilinear Steiner Tree Construction Using Answer Set Programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 386–399. Springer, Heidelberg (2004)
Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 37–56. Springer, Heidelberg (2001)
Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 306–320. Springer, Heidelberg (2004)
Gelfond, M., Galloway, J.: Diagnosing dynamic systems in A-Prolog. In: Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, USA, March 2001, pp. 160–166. AAAI Press, Menlo Park (2001)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Programming, Seattle, USA, August 1988, pp. 1070–1080. The MIT Press, Cambridge (1988)
Heljanko, K.: Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37(3), 247–268 (1999)
Heljanko, K., Niemelä, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3(4&5), 519–550 (2003)
Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359–363. John Wiley, Chichester (1992)
Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 346–350. Springer, Heidelberg (2003)
Lifschitz, V.: Answer set planning. In: Proceedings of the 16th International Conference on Logic Programming, Las Cruces, New, Mexico, December 1999, pp. 25–37. The MIT Press, Cambridge (1999)
Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence, Edmonton, Alberta, Canada, July/August 2002, pp. 112–117. The AAAI Press, Menlo Park (2002)
Marek, W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4), 241–273 (1999)
Niemelä, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Maher, M. (ed.) Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 1996, pp. 289–303. The MIT Press, Cambridge (1996)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Son, T.C., Lobo, J.: Reasoning about policies using logic programs. In: Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, USA, March 2001, pp. 210–216. AAAI Press, Menlo Park (2001)
Syrjänen, T.: A rule-based formal model for software configuration. Research Report A55, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Helsinki, Finland (December 1999)
Tiihonen, J., Soininen, T., Niemelä, I., Sulonen, R.: A practical tool for mass-customising configurable products. In: Proceedings of the 14th International Conference on Engineering Design, pp. 1290–1299 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niemelä, I. (2006). Answer Set Programming: A Declarative Approach to Solving Search Problems. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds) Logics in Artificial Intelligence. JELIA 2006. Lecture Notes in Computer Science(), vol 4160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853886_2
Download citation
DOI: https://doi.org/10.1007/11853886_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39625-3
Online ISBN: 978-3-540-39627-7
eBook Packages: Computer ScienceComputer Science (R0)