Abstract
This paper gives a summary of the First Answer Set Programming System Competition that was held in conjunction with the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning. The aims of the competition were twofold: first, to collect challenging benchmark problems, and second, to provide a platform to assess a broad variety of Answer Set Programming systems. The competition was inspired by similar events in neighboring fields, where regular benchmarking has been a major factor behind improvements in the developed systems and their ability to address practical applications.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
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)
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K., et al. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)
Gelfond, M., Leone, N.: Logic programming and knowledge representation — the A-prolog perspective. Artificial Intelligence 138(1-2), 3–38 (2002)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Colmerauer, A., et al.: 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)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–385 (1991)
Marek, W., Truszczyński, M.: Stable semantics for logic programs and default theories. In: Lusk, E., Overbeek, R. (eds.) Proceedings of the North American Conference on Logic Programming, pp. 243–256. MIT Press, Cambridge (1989)
Bidoit, N., Froidevaux, C.: Negation by default and unstratifiable logic programs. Theoretical Computer Science 78(1), 85–112 (1991)
Eiter, T., et al.: A deductive system for non-monotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, 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: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)
Truszczyński, M., et al.: 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 (2003)
Le Berre, D., Simon, L. (eds.): Special Volume on the SAT 2005 Competitions and Evaluations. Journal on Satisfiability, Boolean Modeling and Computation 2(1-4) (2006)
Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499–562 (2006)
Syrjänen, T.: Lparse 1.0 user’s manual, http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczyński, M. (2007). The First Answer Set Programming System Competition. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)