Accepted papers

The recently accepted papers in TPLP are the following:

Regular Papers

  1. Logic + control: On program construction and verification.
    Wlodzimierz Draben
  2. SUNNY-CP and the MiniZinc Challenge. Roberto Amadini, Maurizio Gabbrielli, Jaopo Mauro.
  3. Random generation of closed simply-typed λ-terms: a synergy
    between logic programming and Boltzmann samplers
    .
    Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau

 

SPECIAL ISSUE ON ICLP 2017

  • Marìa Alpuente, Angel Cuenca-Ortega, Santiago Escobar and Julia Sapiña. Inspecting Maude Variants with GLINTS. arXiv
  • Mario Alviano. Model enumeration in propositional circumscription via unsatisfiable core analysis. arXiv
  • Giovanni Amendola, Nicola Leone and Marco Manna. Finite model reasoning over existential rules. arXiv
  • Harald Beck, Thomas Eiter and Christian Folie. Ticker: A System for Incremental ASP-based Stream Reasoning. arXiv
  • Zhuo Chen, Elmer Salazar, Kyle Marple, Lakshman Tamil, Gopal Gupta, Sandeep Das and Alpesh Amin. Improving Adherence to Heart Failure Management Guidelines via Abductive Reasoning. arXiv
  • Bernardo Cuteri, Carmine Dodaro, Francesco Ricca and Peter Schüller. Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis. arXiv
  • Marco Gavanelli, Maddalena Nonato, Andrea Peano and Davide Bertozzi. Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper). arXiv
  • Guido Governatori and Michael Maher. Annotated Defeasible Logic. arXiv
  • Ricardo Gonçalves, Matthias Knorr, Joao Leite and Stefan Woltran. When You Must Forget: beyond strong persistence when forgetting in answer set programming. arXiv
  • Amelia Harrison, Vladimir Lifschitz and Dhananjay Raju. Program Completion in the Input Language of GRINGO. arXiv
  • Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn and Philipp Wanko. Clingo goes Linear Constraints over Reals and Integers. arXiv
  • Jianmin Ji, Fangfang Liu and Jia-Huai You. Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases. arXiv
  • Ekaterina Komendantskaya and Yue Li. Productive Corecursion in Logic Programming. arXiv
  • Joohyung Lee, Nikhil Loney and Yunsong Meng. Representing Hybrid Automata by Action Language Modulo Theories. arXiv
  • Joohyung Lee, Samidh Talsania and Yi Wang. Computing LPMLN Using ASP and MLN Solvers. arXiv
  • Vladimir Lifschitz. Achievements in Answer Set Programming. arXiv
  • Panos Rondogiannis and Ioanna Symeonidou. The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs. arXiv
  • Alejandro Serrano and Jurriaan Hage. Constraint Handling Rules with Binders, Patterns and Generic Quantification. arXiv
  • Farhad Shakerin, Elmer Salazar and Gopal Gupta. A New Algorithm to Automate Inductive Learning of Default Theories. arXiv
  • Ibrahim Faruk Yalciner, Ahmed Nouman, Volkan Patoglu and Esra Erdem. Hybrid Conditional Planning using Answer Set Programming. arXiv
  • Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky and Tyson Condie. Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregates. arXiv

Technical Communications (the preliminary proceedings are available here)

  • Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, Marek Adrian. Entity set expansion from the Web via ASP
  • Mario Alviano. The pyglaf argumentation reasoner
  • Giovanni Amendola, Nicola Leone, Marco Manna and Pierfrancesco Veltri. Reasoning on anonymity in Datalog+/-.
  • Melisachew Wudage Chekol and Heiner Stuckenschmidt. Rule Based Temporal Inference.
  • Michael Codish, Michael Frank, Amit Metodi and Morad Muslimany. Logic Programming with Max-Clique and its Application to Graph Coloring.
  • Michael Hanus. Semantic Versioning Checking in a Declarative Package Manager.
  • Daniela Inclezan, Qinglin Zhang, Marcello Balduccini and Ankush Israney. Understanding Restaurant Stories Using an ASP Theory of Intentions.
  • Rolf Schwitter. Learning Effect Axioms via Probabilistic Logic Programming.
  • Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo. Towards Run-time Checks Simplification via Term Hiding.
  • Paul Tarau. A Hitchhiker’s Guide to Reinventing a Prolog Machine.
  • Neng-Fa Zhou and Roman Barták. Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding.

Accepted Technical Notes/Rapid Publication Papers

  • <none>

Accepted Book Reviews

  • <none>