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

  14. Tackling the DM Challenges with cDMN: A Tight Integration of DMN and Constraint Reasoning
    Simon Vandevelde, Bram Aerts, Joost Vennekens

  15. Integrating Cardinality Constraints into Constraint Logic Programming with Sets
    Maximiliano Cristia and Gianfranco Rossi

  16. Reactive Answer Set Programming  Krysia Broda, Fariba Sadri, Stephen Butler

  17. Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs.   Yuliya Lierler

  18. Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies Pasi, Gabriella; Peñaloza, Rafael

  19. Declarative Approaches to Counterfactual Explanations for Classification Leopoldo Bertossi

FORTHCOMING SPECIAL ISSUE ON 20 YEARS OF TPLP (preliminary list)

  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

  4. How to build your own ASP-based system ?! Roland Kaminski, Javier Romero, Torsten Schaub, and Philipp Wanko

  5. A Survey of the Proof-Theoretic Foundations of Logic Programming  Dale Miller

  6. Linear-Time Temporal Answer Set Programming Aguado, Felicidad; Cabalar, Pedro; Dieguez, Martin; Pérez, Gilberto; Schaub, Torsten; Schuhmann, Anna; Vidal, Concepción

  7. Forgetting in Answer Set Programming – A Survey Gonçalves, Ricardo; Knorr, Matthias; Leite, Joao