TPLP Volume 14, 2014

Please use the TPLP citation in your papers, not the arXiv/corr one!

Issue 01, January 2014

Issue 02, March 2014

Issue 03, May 2014

 Issue 04-05, Special issue on ICLP 2014


  • Properties of Stable Model Semantics Extensions. Mario Abrantes and Luıs Moniz Pereira. pp 1-16
  • A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling. Miguel Areias and Ricardo Rocha. pp 17-26
  • Grounding Bound Founded Answer Set Programs Rehan Abdul Aziz, Geoffrey Chu and Peter J. Stuckey. pp 27-39
  • Towards an ASP-Based Architecture for Autonomous UAVs in Dynamic Environments. Marcello Balduccini, William Regli and Duc Nguyen. pp 40-49
  • A Well-Founded Semantics for FOL-Programs. Yi Bi, Jia-Huai You and Zhiyong Feng. pp 50-59
  • FO(C): A Knowledge Representation Language of Causality. Bart Bogaerts, Joost Vennekens, Marc Denecker and Jan Van den Bussche. pp 60-69
  • A Framework for Bottom-Up Simulation of SLD-Resolution. Stefan Brass. pp 70-79
  • Customisable Handling of Java References in Prolog Programs. Sergio Castro, Kim Mens and Paulo Moura. pp 80-89
  • Analysis and Transformation Tools for Constrained Horn Clause Verification. John P. Gallagher and Bishoksan Kafle. pp 90-101
  • Multi-criteria optimal planning for Energy policies in CLP. Marco Gavanelli, Michela Milano, Stefano Bragaglia, Federico Chesani, Elisa Marengo and Paolo Cagnoli. pp 102-111
  • Clingo = ASP + Control: Preliminary Report. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. pp 112-120.
  • Transaction Logic with (Complex) Events. Ana Sofia Gomes and Jose Julio Alferes. pp 121-131
  • Coinductive Logic Programming: Eager vs Lazy. Jonathan Heras, Ekaterina Komendantskaya and Martin Schmidt. pp 132-141
  • Logic and Constraint Logic Programming for Distributed Constraint Optimization.  Tiep Le, Enrico Pontelli, Tran Cao Son and William Yeoh. pp 142-153
  • Adaptive MCMC-Based Inference in Probabilistic Logic Programs. Arun Nampally and C. R. Ramakrishnan. pp 154-163
  • Propagation Properties of Min-closed CSPs. G. Narboni. pp 164-174
  • Towards an Efficient Prolog System by Code Introspection. George Souza Oliveira and Anderson Faustino Da Silva. pp 175-184
  • Joint Tabling of Logic Program Abductions and Updates. Ari Saptawijaya and Luis Moniz Pereira. pp 185-196
  •  On Strong and Default Negation in Answer-Set Program Updates. Martin Slota, Martin Balaz and Joao Leite. pp 197-208.
  • Towards Assertion-based Debugging of Higher-Order (C)LP Programs. Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo. pp 209-210
  • Interclausal Logic Variables. Paul Tarau and Fahmida Hamid. pp 211-220.
  • ESmodels: An Epistemic Specification Solver. Zhizheng Zhang and Kaikai Zhao. pp 221-230


  • Bound Founded Answer Set Programming. Rehan Abdul Aziz.
  • Model Revision Inference for Extensions of First Order Logic. Joachim Jansen.
  • Logic Programming as Scripting Language for Bots in Computer Games – Research Overview.  Grzegorz Jaśkiewicz.
  • The Impact of Disjunction on Reasoning under Existential Rules: Research Summary. Michael Morak
  • CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty.
    Aya Saad.
  • Visualization of Constraint Handling Rules. Nada Sharaf.
  • Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs. Heike Stephan.
  • Reasoning with Probabilistic Logics. Riccardo Zese.

Issue 06