TPLP Volume 15, 2015

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

Issue 01, January 2015

Rapid Publications from the 12th Int’l Conf. LPNMR:

  1. An application of answer set programming to the field of second language acquisition Daniela Inclezian, pp 1 – 17
  2. On equivalence of infinitary formulas under the stable model semantics. AMELIA HARRISON, VLADIMIR LIFSCHITZ and MIROSLAW TRUSZCZYNSKI, pp 18 – 34.
    Regular Papers
  3. Generating explanations for biomedical queries. ESRA ERDEM and UMUT OZTOK, pp 35 – 78
  4. Characterizing and extending answer set semantics using possibility theory Kim Bauters, Steven Schockaert, Martine De Cock, and Dirk Vermeir, pp 79 – 116
  5. aspeed: solver scheduling via answer set programming Holger Hoos, Roland Kaminski, Marius Lindauer, and Torsten Schaub, pp 117 – 142
    Book review
  6. A Gentle Guide to Constraint Logic Programming via ECLiPSe by Antoni Niederliński, xiii + 509 pages, Jacek Skalmierski
    Computer Studio, Third Edition, 2014.  Also available at as a free secured PDF file. Reviewed by Eric Monfroy, pp 143 – 146

Issue 02 (special issue), march 2015.

  1. Introduction to the special issue on probability, logic, and learning James Cussens, Luc De Raedt, Angelika Kimmig, Taisuke Sato
  2. Viterbi training in PRISM Taisuke Sato and Keiichi Kubota, pp 147 – 168
  3. Structure learning of probabilistic logic programs by searching the clause space Elena Bellodi and Fabrizio Riguzzi, pp 169 – 212
  4. A probabilistic logic programming event calculus Anastasios Skarlatidis, Alexander Artikis, Jason Filippou, Georgios Paliouraspp 213 – 245
  5. Lower complexity bounds for lifted inference Manfred Jaeger pp 246 – 263

Issue 03, May 2015

  1. Unfolding for CHR programs. Maurizio Gabbrielli, Maria Chiara Meo, Paolo Tacchella, Herbert Wiklicky, pp 264 – 311
  2. Abstract interpretation of temporal concurrent constraint programs
    Moreno Falaschi, Carlos Olarte, and Catuscia Palamidessi, pp 312 – 357
  3. Inference and learning in probabilistic logic programs using weighted Boolean formulas Daan Fierens, Guy Van den Broeck, Joris Renkens, Dimitar Shterionov, Bernd Gutmann, Ingo Thon, Gerda Janssens, Luc De Raedt, pp 358 – 401
  4. Decidability of the Clark’s completion semantics for monadic programs and queries, Levon Haykazyan, pp 402 – 412

Issue 04-05 (special issue on the 31st International Conference on Logic Programming ), July 2015.

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

Issue 06,  November 2015

  1. Timed soft concurrent constraint programs: an interleaved and a parallel approach Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco Santini. 743-782
  2. Predicate logic as a modeling language: Modeling and solving some machine learning and data mining problems with IDP3.
    Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, and Sicco Verwer. 783-817
  3. Random logic programs: linear model. Kewen Wang, Lian Wen, Kedian Mu 818-853
  4. Checking termination of bottom-up evaluation of logic programs with function symbols
    Marco Calautti, Sergio Greco, Francesca Spezzano and Irina Trubitsyna 854-889