Theory and Practice of Logic Programming, Volume 15

Volume 15, Number 1, January 2015

Rapid Publications from the 12th International Conference on Logic Programming and Nonmonotonic Reasoning

• 
  Daniela Inclezan:
  An application of answer set programming to the field of second language acquisition. 1-17
• 
  Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
  On equivalence of infinitary formulas under the stable model semantics. 18-34

Regular Papers

• 
  Esra Erdem, Umut Öztok:
  Generating explanations for biomedical queries. 35-78
• 
  Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir:
  Characterizing and extending answer set semantics using possibility theory. 79-116
• 
  Holger H. Hoos, Roland Kaminski, Marius Lindauer, Torsten Schaub:
  aspeed: Solver scheduling via answer set programming. 117-142

Book Reviews

• 
  Éric Monfroy:
  A Gentle Guide to Constraint Logic Programming via ECLiPSe by Antoni Niederliński, xiii + 509 pages, published by Jacek Skalmierski Computer Studio, Third Edition, 2014. 143-144

Volume 15, Number 2, March 2015

Introduction

• 
  James Cussens, Luc De Raedt, Angelika Kimmig, Taisuke Sato:
  Introduction to the special issue on probability, logic and learning. 145-146

Regular Papers

• 
  Taisuke Sato, Keiichi Kubota:
  Viterbi training in PRISM. 147-168
• 
  Elena Bellodi, Fabrizio Riguzzi:
  Structure learning of probabilistic logic programs by searching the clause space. 169-212
• 
  Anastasios Skarlatidis, Alexander Artikis, Jason Filipou, Georgios Paliouras:
  A probabilistic logic programming event calculus. 213-245
• 
  Manfred Jaeger:
  Lower complexity bounds for lifted inference. 246-263

Volume 15, Number 3, May 2015

Regular Papers

• 
  Maurizio Gabbrielli, Maria Chiara Meo, Paolo Tacchella, Herbert Wiklicky:
  Unfolding for CHR programs. 264-311
• 
  Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi:
  Abstract interpretation of temporal concurrent constraint programs. 312-357
• 
  Daan Fierens, Guy Van den Broeck, Joris Renkens, Dimitar Sht. Shterionov, Bernd Gutmann, Ingo Thon, Gerda Janssens, Luc De Raedt:
  Inference and learning in probabilistic logic programs using weighted Boolean formulas. 358-401

Technical Note

• 
  Levon Haykazyan:
  Decidability of the Clark's completion semantics for monadic programs and queries. 402-412

Volume 15, Numbers 4-5, July 2015

Thomas Eiter, Francesca Toni (Eds.): Special Issue on the 31st International Conference on Logic Programming.

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

Volume 15, Number 6, November 2015

Regular Papers

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