Theory and Practice of Logic Programming, Volume 17

Volume 17, Number 1, January 2017

Regular Papers

• 
  Ruben Verborgh, Dörthe Arndt, Sofie Van Hoecke, Jos De Roo, Giovanni Mels, Thomas Steiner, Joaquim Gabarró:
  The pragmatic proof: Hypermedia API composition and execution. 1-48

Rapid Communication

• 
  Pedro Cabalar, Jorge Fandinno:
  Enablers and inhibitors in causal justifications of logic programs. 49-74

Technical Note

• 
  Mauricio Osorio, Juan Carlos Nieves:
  Range-based argumentation semantics as two-valued models. 75-90

Regular Papers

• 
  Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker:
  The KB paradigm and its application to interactive configuration. 91-117

Book Review

• 
  Roman Barták:
  Constraint Solving and Planning with Picat by Neng-Fa Zhou , Håkan Kjellerstrand , and Jonathan Fruhman , xi + 148 pages, Springer, 2015. Paperback, ISBN 978-3-319-25881-2. 118-120

Volume 17, Number 2, March 2017

Regular Papers

• 
  Sergio Antoy, Michael Hanus:
  Default rules for Curry. 121-147
• 
  Leopoldo E. Bertossi, Loreto Bravo:
  Consistency and trust in peer data exchange systems. 148-204
• 
  Przemyslaw Andrzej Walega, Carl Schultz, Mehul Bhatt:
  Non-monotonic spatial reasoning with answer set programming modulo theories. 205-225

Technical Note

• 
  Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal, Martín Diéguez:
  Temporal logic programs with variables. 226-243

Volume 17, Number 3, May 2017

Regular Papers

• 
  Taisuke Sato:
  A linear algebraic approach to datalog evaluation. 244-265
• 
  Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia:
  ASPeRiX, a first-order forward chaining approach for answer set computing. 266-310
• 
  James Cheney, Alberto Momigliano:
  αCheck: A mechanized metatheory model checker. 311-352

Book Review

• 
  Krzysztof R. Apt:
  Computation, Proof, Machine: Mathematics Enters a New Age, Gilles Dowek , Cambridge University Press, 2015. Hardback, ISBN 978-0-521-11801-9, 152 pages. 353-358

Volume 17, Number 4, July 2017

Invited Editorial

• 
  Agostino Dovier:
  Preface. 359-364

Regular Papers

• 
  Michael J. Maher:
  Contractibility for open global constraints. 365-407
• 
  Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub:
  Clingcon: The next generation. 408-461
• 
  Marcello Balduccini, Yuliya Lierler:
  Constraint answer set solver EZCSP and why integration schemas matter. 462-515
• 
  Andrew Reynolds, Cesare Tinelli, Clark W. Barrett:
  Constraint solving for finite model finding in SMT solvers. 516-558
• 
  Yuliya Lierler, Benjamin Susman:
  On relation between constraint answer set programming and satisfiability modulo theories. 559-590
• 
  Marcello Balduccini, Daniele Magazzeni, Marco Maratea, Emily Leblanc:
  CASP solutions for planning in hybrid domains. 591-633
• 
  Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh:
  Solving distributed constraint optimization problems using logic programming. 634-683

Volume 17, Numbers 5-6, September 2017

Ricardo Rocha, Tran Cao Son (Eds.): Special Issue on the 33rd International Conference on Logic Programming.

• 
  Ricardo Rocha, Tran Cao Son:
  Introduction to the 33rd international conference on logic programming special issue. 684-688
• 
  María Alpuente, Santiago Escobar, Julia Sapiña, Angel Cuenca-Ortega:
  Inspecting Maude variants with GLINTS. 689-707
• 
  Mario Alviano:
  Model enumeration in propositional circumscription via unsatisfiable core analysis. 708-725
• 
  Giovanni Amendola, Nicola Leone, Marco Manna:
  Finite model reasoning over existential rules. 726-743
• 
  Harald Beck, Thomas Eiter, Christian Folie:
  Ticker: A system for incremental ASP-based stream reasoning. 744-763
• 
  Zhuo Chen, Elmer Salazar, Kyle Marple, Gopal Gupta, Lakshman Tamil, Daniel Cheeran, Sandeep Das, Alpesh Amin:
  Improving adherence to heart failure management guidelines via abductive reasoning. 764-779
• 
  Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, Peter Schüller:
  Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. 780-799
• 
  Marco Gavanelli, Maddalena Nonato, Andrea Peano, Davide Bertozzi:
  Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper). 800-818
• 
  Guido Governatori, Michael J. Maher:
  Annotated defeasible logic. 819-836
• 
  Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran:
  When you must forget: Beyond strong persistence when forgetting in answer set programming. 837-854
• 
  Amelia Harrison, Vladimir Lifschitz, Dhananjay Raju:
  Program completion in the input language of GRINGO. 855-871
• 
  Tomi Janhunen, Roland Kaminski, Max Ostrowski, Sebastian Schellhorn, Philipp Wanko, Torsten Schaub:
  Clingo goes linear constraints over reals and integers. 872-888
• 
  Jianmin Ji, Fangfang Liu, Jia-Huai You:
  Well-founded operators for normal hybrid MKNF knowledge bases. 889-905
• 
  Ekaterina Komendantskaya, Yue Li:
  Productive corecursion in logic programming. 906-923
• 
  Joohyung Lee, Nikhil Loney, Yunsong Meng:
  Representing hybrid automata by action language modulo theories. 924-941
• 
  Joohyung Lee, Samidh Talsania, Yi Wang:
  Computing LPMLN using ASP and MLN solvers. 942-960
• 
  Vladimir Lifschitz:
  Achievements in answer set programming. 961-973
• 
  Panos Rondogiannis, Ioanna Symeonidou:
  The intricacies of three-valued extensional semantics for higher-order logic programs. 974-991
• 
  Alejandro Serrano, Jurriaan Hage:
  Constraint handling rules with binders, patterns and generic quantification. 992-1009
• 
  Farhad Shakerin, Elmer Salazar, Gopal Gupta:
  A new algorithm to automate inductive learning of default theories. 1010-1026
• 
  Ibrahim Faruk Yalciner, Ahmed Nouman, Volkan Patoglu, Esra Erdem:
  Hybrid conditional planning using answer set programming. 1027-1047
• 
  Carlo Zaniolo, Mohan Yang, Ariyam Das, Alexander Shkapsky, Tyson Condie, Matteo Interlandi:
  Fixpoint semantics and optimization of recursive Datalog programs with aggregates. 1048-1065