| 413 | -- | 418 | Thomas Eiter, Francesca Toni. Introduction to the 31st International Conference on Logic Programming special issue |
| 419 | -- | 433 | Benoit Desouter, Marko van Dooren, Tom Schrijvers. Tabling as a library with delimited control |
| 434 | -- | 448 | Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran. Improved answer-set programming encodings for abstract argumentation |
| 449 | -- | 463 | Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, Torsten Schaub. Abstract gringo |
| 464 | -- | 480 | Bart Bogaerts, Guy Van den Broeck. Knowledge compilation of logic programs using approximation fixpoint theory |
| 481 | -- | 494 | Craig Blackmore, Oliver Ray, Kerstin Eder. A logic programming approach to predict effective compiler settings for embedded software |
| 495 | -- | 510 | Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran. Dual-normal logic programs - the forgotten class |
| 511 | -- | 525 | Mark Law, Alessandra Russo, Krysia Broda. Learning weak constraints in answer set programming |
| 526 | -- | 542 | Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey. Horn clauses as an intermediate representation for program analysis and transformation |
| 543 | -- | 558 | Neng-Fa Zhou, Roman Barták, Agostino Dovier. Planning as tabled logic programming |
| 559 | -- | 573 | Mario Alviano, Wolfgang Faber, Martin Gebser. Rewriting recursive aggregates in answer set programming: back to monotonicity |
| 574 | -- | 587 | Mario Alviano, Nicola Leone. Complexity and compilation of GZ-aggregates in answer set programming |
| 588 | -- | 603 | Mario Alviano, Rafael Peñaloza. Fuzzy answer set computation via satisfiability modulo theories |
| 604 | -- | 619 | Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä. Optimizing phylogenetic supertrees using answer set programming |
| 620 | -- | 634 | Felicidad Aguado, Pedro Cabalar, David Pearce, Gilberto Pérez, Concepción Vidal. A denotational semantics for equilibrium logic |
| 635 | -- | 650 | Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. Proving correctness of imperative programs by linearizing constrained Horn clauses |
| 651 | -- | 665 | Maximiliano Cristiá, Gianfranco Rossi, Claudia S. Frydman. Adding partial functions to Constraint Logic Programming with sets |
| 666 | -- | 680 | Pedro Cabalar, Martín Diéguez, Concepción Vidal. An infinitary encoding of temporal equilibrium logic |
| 681 | -- | 695 | Ingmar Dasseville, Matthias van der Hallen, Gerda Janssens, Marc Denecker. Semantics of templates in a compositional framework for building logics |
| 696 | -- | 710 | Marco Manna, Francesco Ricca, Giorgio Terracina. Taming primary key violations to query large inconsistent data via ASP |
| 711 | -- | 725 | Fred Mesnard, Étienne Payet, Germán Vidal. Concolic testing in logic programming |
| 726 | -- | 741 | Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo. Practical run-time checking via unobtrusive property caching |