Talks and Poster Presentations (with Proceedings-Entry):

M. Alviano, F. Calimeri, G. Charwat, M. Dao-Tran, C. Dodaro, G. Ianni, T. Krennwallner, M. Kronegger, J. Oetsch, A. Pfandler, J. Puehrer, C. Redl, F. Ricca, P. Schneider, M. Schwengerer, L. Spendier, J. P. Wallner, G. Xiao:
"The Fourth Answer Set Programming Competition: Preliminary Report";
Talk: 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Corunna, Spain (invited); 2013-09-15 - 2013-09-19; in: "12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)", P. Cabalar, T. Son (ed.); Springer, 8148 (2013), 42 - 53.

English abstract:
Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.

Related Projects:
Project Head Thomas Eiter:
Evaluierung von ASP Programming mit Externen Zugriffen

Project Head Thomas Eiter:
Modulare HEX-Programme

Created from the Publication Database of the Vienna University of Technology.