Accepted papers

The recently accepted papers in TPLP are the following:

  1. Learning Distributional Programs for Relational Autocompletion.
    Nitesh Kumar, Ondřej Kuželka, Luc De Raedt
  2. Knowledge-Based Support for Adhesive Selection: Will it Stick? Simon Vandevelde, Jeroen Jordens, Bart Van Doninck, and Maarten Witters
  3. Clingraph: A System for ASP-based Visualization. Susana Hahn, Orkunt Sabuncu, Torsten Schaub, and Tobias Stolzmann
  4. Model Explanation via Support Graphs. Pedro Cabalar and Brais Muniz.
  5. Unit Testing in ASP Revisited: Language and Test-Driven Development Environment. Giovanni Amendola, Tobias Berei, Giuseppe Mazzotta, Francesco Ricca.
  6.  Convex and Reverse Convex Prequadratics in the Calculus of Relations with Cardinalities. BENJAMIN CALLEWAERT, JOOST VENNEKENS.
  7. A novel framework for systematic propositional formula simplification based on existential graphs. Jordina Francès de Mas, Juliana Bowles
  8. Practical Reasoning in DatalogMTL. Dingmin Wang, Przemyslaw Walega,  Pan Hu, Pan, Bernardo Cuenca Grau
  9. Property-Based Testing by Elaborating Proof Outlines. Dale Miller, Alberto Momigliano.
  10. Optimal matching for sharing and linearity analysis. Gianluca Amato, Francesca Scozzari.
  11. Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
    Maximiliano Cristià, Gianfranco Rossi
  12. On the Equivalence between Logic Programming and SETAF
    João Alcântara, Renan Cordeiro, and Samy Sá
  13. A Machine Learning-based Approach for Solving Recurrence Relations and its use in Cost Analysis of Logic Programs. Louis Rustenholz, Maximiliano Klemen,  Miguel Á. Carreira-Perpiñán, and Pedro Lopez-Garcia
  14. Generating Global and Local Explanations for Tree-Ensemble Learning Methods by Answer Set Programming. By Akihiro Takemura and Katsumi Inoue.
  15. Probabilistic Answer Set Programming with Discrete and Continuous Random Variables. Damiano Azzolini and Fabrizio Riguzzi.
  16. plingo: A system for probabilistic reasoning in Answer Set Programming. Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling, Torsten Schaub (Link to an earlier version of the paper – to be updated asap)
  17. On the generalization of learned constraints for ASP solving in temporal domains JAVIER ROMERO, TORSTEN SCHAUB, KLAUS STRAUCH.
  18. Solving Decision Theory Problems with Probabilistic Answer Set Programming. DAMIANO AZZOLINI, ELENA BELLODI, RAFAEL KIESEL, FABRIZIO RIGUZZI
  19. The Temporal Vadalog System: Temporal Datalog-based Reasoning LUIGI BELLOMARINI, LIVIA BLASI, MARKUS NISSL, EMANUEL SALLINGER
  20. Direct Encoding of Declare Constraints in ASP. Francesco Chiariello, Antonio Ielo, Valeria Fionda, Francesco Ricca