Accepted papers

The recently accepted papers in TPLP are the following:

  1. Probabilistic QoS-aware Placement of VNF chains at the Edge
    Forti, Stefano; Paganelli, Federica; Brogi, Antonio
  2. Exploiting Database Management Systems and Treewidth for Counting.
    Fichte, Johannes; Hecher, Markus; Thier, Patrick; Woltran, Stefan.
  3. On Signings and the Well-Founded Semantics
    Michael Maher
  4.  Operating Room (Re)Scheduling with Bed Management via ASP
    Carmine Dodaro, Giuseppe Galatà, Muhammad Kamran Khan, Marco Maratea
  5. Online Learning Probabilistic Event Calculus Theories in Answer Set Programming
    Nikos Katzouris, Alexander Artikis and Georgios Paliouras
  6. Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
    Fangfang Liu and Jia-Huai You
  7. Temporal Minimal-World Semantics for Sparse ABoxes
    Stefan Borgwardt, Walter Forkel, Alisa Kovtunova
  8. Reasoning on DL-LiteR with Defeasibility in ASP
    Bozzato, Loris; Eiter, Thomas; Serafini, Luciano
  9. Learning Distributional Programs for Relational Autocompletion.
    Nitesh Kumar, Ondřej Kuželka, Luc De Raedt
  10. Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming.
    Joaquin Arias, Manuel Carro, Zhuo Chen, Gopal Gupta
  11. Efficient TBox Reasoning with Value Restrictions using the FL_ower reasoner.
    Baader, Franz; Koopmann, Patrick; Michel, Friedrich; Turhan, Anni-Yasmin; Zarrieß, Benjamin
  12. Defeasible Reasoning via Datalog¬. Michael Maher
  13. On correctness and completeness of an n queens program. Drabent, Włodzimierz

ISSUE 5 and 6, Special issue on ICLP 2021

  1. Preface (by  Alex Brik , Andrea Formisano, Yanhong Annie Liu, and Joost Vennekens)

  2. Modal Logic S5 Satisfiability in Answer Set Programmingrse
    Mario Alviano, Sotiris Batsakis, George Baryannis
  3. Optimizing Probabilities in Probabilistic Logic Programs
    Damiano Azzolini, Fabrizio Riguzzi
  4. Non-ground Abductive Logic Programming with Probabilistic Integrity Constraints
    Elena Bellodi, Marco Gavanelli, Riccardo Zese, Evelina Lamma, Fabrizio Riguzzi
  5. Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
    Viktor Besin, Markus Hecher, Stefan Woltran
  6. Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
    Loris Bozzato, Thomas Eiter, Rafael Kiesel
  7. I-DLV-sr: A Stream Reasoning System based on I-DLV
    Francesco Calimeri, Marco Manna, Elena Mastria, Maria Concetta Morelli, Simona Perri, Jessica Zangari
  8. A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
    Angelos Charalambidis, Panos Rondogiannis, Antonis Troumpoukis
  9. Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming
    Wolfgang Faber, Michael Morak, Lukáš Chrpa
  10. Planning with Incomplete Information in Quantified Answer Set Programming
    Jorge Fandinno, François Laferrière, Javier Romero, Torsten Schaub, Tran Cao Son
  11. Planning for an Efficient Implementation of Hypothetical Bousi~Prolog
    Pascual Julián-Iranzo, Fernando Sáenz-Pérez
  12. Transformation-Enabled Precondition Inference
    Bishoksan Kafle, Graeme Gange, Peter J. Stuckey, Peter Schachte, Harald Sondergaard
  13. Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
    Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
  14. Here and There with Arithmetic
    Vladimir Lifschitz
  15. Solution Enumeration by Optimality in Answer Set Programming
    Jukka Pajunen, Tomi Janhunen
  16. VeriFly: On-the-fly Assertion Checking via Incrementality
    Miguel A. Sanchez-Ordaz, Isabel Garcia-Contreras, Victor Perez-Carrasco, Jose F. Morales, Pedro lopez-Garcia, Manuel V. Hermenegildo
  17. FOLASP: FO(.) as Input Language for Answer Set Solvers
    Kylian Van Dessel, Jo Devriendt, Joost Vennekens
  18. An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions
    Felix Weitkämper
  19. Refactoring the Whitby Intelligent Tutoring System for Clean Architecture
    Paul S. Brown, Vania Dimitrova, Glen Hart, Anthony G. Cohn, Paulo Moura
  20. An ASP-based Solution to the Chemotherapy Treatment Scheduling problem
    Carmine Dodaro, Giuseppe Galatà , Andrea Grioni, Marco Maratea, Marco Mochi, Ivan Porro
  21. Knowledge-Based Stable Roommates Problem: A Real-World Application
    Muge Fidan, Esra Erdem


  1. Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches  Yuliya Lierler
  2. Analysis and Transformation of Constrained Horn Clauses for Program Verification  Emanuele De Angelis, Fabio Fioravanti,  John P. Gallagher, Manuel Hermenegildo, Alberto Pettorossi, and Maurizio Proietti
  3. Thirty years of Epistemic Specifications. Jorge Fandinno, Wolfgang Faber, and Michael Gelfond