Abstract
This paper reports on the Second Answer Set Programming Competition. The competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing systems. Following this experience, the Answer Set Programming competition series was set up in 2007, and ran as part of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). This second competition, held in conjunction with LPNMR 2009, differed from the first one in two important ways. First, while the original competition was restricted to systems designed for the answer set programming language, the sequel was open to systems designed for other modeling languages, as well. Consequently, among the contestants of the second competition were a CLP(FD) team and three model generation systems for (extensions of) classical logic. Second, this latest competition covered not only satisfiability problems but also optimization ones. We present and discuss the set-up and the results of the competition.
This is a preview of subscription content, log in via an institution to check access.
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
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K., Marek, W., Truszczyński, M., Warren, D. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)
Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4), 241–273 (1999)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–385 (1991)
Colmerauer, A., Kanoui, H., Pasero, R., Roussel, P.: Un systeme de communication homme-machine en Francais. Technical report, University of Marseille (1973)
Kowalski, R.: Predicate logic as a programming language. In: Rosenfeld, J. (ed.) Proceedings of the Congress of the International Federation for Information Processing, pp. 569–574. North Holland, Amsterdam (1974)
McCarthy, J.: Circumscription — a form of nonmonotonic reasoning. Artificial Intelligence 13(1-2), 27–39 (1980)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the International Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for non-monotonic reasoning. In: Dix, J., Furbach, U., Nerode, A. (eds.) Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 364–375. Springer, Heidelberg (1997)
Niemelä, I., Simons, P.: Smodels — an implementation of the stable model and well-founded semantics for normal logic programs. In: Dix, J., Furbach, U., Nerode, A. (eds.) Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 420–429. Springer, Heidelberg (1997)
Lifschitz, V.: Answer Set Planning. In: De Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming, pp. 23–37. MIT Press, Cambridge (1999)
Borchert, P., Anger, C., Schaub, T., Truszczyński, M.: Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 3–7. Springer, Heidelberg (2004)
Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczyński, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 3–17. Springer, Heidelberg (2007)
Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937–977 (2006)
Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Denecker, M., Kakas, A.C.: Abduction in Logic Programming. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 402–436. Springer, Heidelberg (2002)
Mitchell, D., Ternovska, E.: A framework for representing and solving NP search problems. In: Veloso, M., Kambhampati, S. (eds.) Proceedings of the National Conference on Artificial Intelligence, pp. 430–435. AAAI Press / MIT Press (2005)
Kakas, A., Michael, A.: Air-Crew scheduling through abduction. In: Imam, I., Kodratoff, Y., El-Dessouki, A., Ali, M. (eds.) Proceedings of the International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, pp. 600–611. Springer, Heidelberg (1999)
Pelov, N., De Mot, E., Denecker, M.: Logic programming approaches for representing and solving constraint satisfaction problems: A comparison. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 225–239. Springer, Heidelberg (2000)
Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M. (2009). The Second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_75
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)