| 465 | -- | 470 | Evelina Lamma, Terrance Swift. Editorial: 29th International Conference on Logic Programming special issue |
| 471 | -- | 485 | Broes de Cat, Maurice Bruynooghe. Detection and exploitation of functional dependencies for model generation |
| 487 | -- | 501 | Rolf Schwitter. The jobs puzzle: Taking on the challenge via controlled natural language processing |
| 503 | -- | 515 | Vladimir Lifschitz, Fangkai Yang. Lloyd-Topor completion and general stable models |
| 517 | -- | 532 | Rehan Abdul Aziz, Geoffrey Chu, Peter J. Stuckey. Stable model semantics for founded bounds |
| 533 | -- | 546 | Tom Schrijvers, Bart Demoen, Benoit Desouter, Jan Wielemaker. Delimited continuations for prolog |
| 547 | -- | 561 | Marcello Balduccini. ASP with non-herbrand partial functions: a language and system for practical use |
| 563 | -- | 578 | Jia-Huai You, Heng Zhang, Yan Zhang. Disjunctive logic programs with existential quantification in rule heads |
| 579 | -- | 592 | Michael J. Maher. Relative expressiveness of defeasible logics II |
| 593 | -- | 607 | Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey. Failure tabled constraint logic programming by interpolation |
| 609 | -- | 623 | Mirjana Mazuran, Edoardo Serra, Carlo Zaniolo. A declarative extension of horn clauses, and its significance for datalog and its applications |
| 625 | -- | 639 | Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet. Using sequential runtime distributions for the parallel speedup prediction of SAT local search |
| 641 | -- | 655 | Laura Giordano, Alberto Martelli, Matteo Spiotta, Daniele Theseider Dupré. Business process verification with constraint temporal answer set programming |
| 657 | -- | 673 | Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skocovsky, Hans Tompits. SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support |
| 675 | -- | 690 | Roland Kaminski, Torsten Schaub, Anne Siegel, Santiago Videla. Minimal intervention strategies in logical signaling networks with ASP |
| 691 | -- | 704 | Joachim Jansen, Albert Jorissen, Gerda Janssens. Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 |
| 705 | -- | 719 | Senlin Liang, Michael Kifer. A practical analysis of non-termination in large logic programs |
| 721 | -- | 735 | Elvira Albert, Maria J. García de la Banda, Miguel Gómez-Zamalloa, José Miguel Rojas, Peter J. Stuckey. A CLP heap solver for test case generation |
| 737 | -- | 752 | Sergio Greco, Cristian Molinaro, Irina Trubitsyna. Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments |
| 753 | -- | 767 | Mario Alviano, Rafael Peñaloza. Fuzzy answer sets approximations |
| 769 | -- | 781 | Jon Sneyers, Danny De Schreye, Thom W. Frühwirth. Probabilistic legal reasoning in CHRiSM |
| 783 | -- | 798 | Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub. Answer set programming as a modeling language for course timetabling |
| 799 | -- | 813 | Vítor Santos Costa, David Vaz. BigYAP: Exo-compilation meets UDI |
| 815 | -- | 830 | Jiefei Ma, Franck Le, David Wood, Alessandra Russo, Jorge Lobo. A declarative approach to distributed computing: Specification, execution and analysis |
| 831 | -- | 846 | Esra Erdem, Volkan Patoglu, Zeynep G. Saribatur, Peter Schüller, Tansel Uras. Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach |
| 847 | -- | 861 | Paul Tarau. Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) |
| 863 | -- | 876 | Michael Bartholomew, Joohyung Lee. On the stable model semantics for intensional functions |
| 877 | -- | 892 | Georg Gottlob, Marco Manna, Andreas Pieris. Combining decidability paradigms for existential rules |