Accepted papers
The recently accepted papers in TPLP are the following:
- Learning Distributional Programs for Relational Autocompletion.
Nitesh Kumar, Ondřej Kuželka, Luc De Raedt
- Epistemic Logic Programs: a study of some properties. Stefania Costantini and Andrea Formisano.
- Knowledge-Based Support for Adhesive Selection: Will it Stick? Simon Vandevelde, Jeroen Jordens, Bart Van Doninck, and Maarten Witters
- IASCAR: Incremental Answer Set Counting by Anytime Refinement. Johannes Fichte, Sarah Gaggl, Marcus Hecher, and Dominik Rusovac
- Clingraph: A System for ASP-based Visualization. Susana Hahn, Orkunt Sabuncu, Torsten Schaub, and Tobias Stolzmann
- Model Explanation via Support Graphs. Pedro Cabalar and Brais Muniz.
- Unit Testing in ASP Revisited: Language and Test-Driven Development Environment. Giovanni Amendola, Tobias Berei, Giuseppe Mazzotta, Francesco Ricca.
- Convex and Reverse Convex Prequadratics in the Calculus of Relations with Cardinalities. BENJAMIN CALLEWAERT, JOOST VENNEKENS.
- Metric Temporal Equilibrium Logic over Timed Traces
Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub, Anna Schuhmann.
- A novel framework for systematic propositional formula simplification based on existential graphs. Jordina Francès de Mas, Juliana Bowles
- Practical Reasoning in DatalogMTL. Dingmin Wang, Przemyslaw Walega, Pan Hu, Pan, Bernardo Cuenca Grau
- Property-Based Testing by Elaborating Proof Outlines. Dale Miller, Alberto Momigliano.
- Optimal matching for sharing and linearity analysis. Gianluca Amato, Francesca Scozzari.
- Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
Maximiliano Cristià, Gianfranco Rossi
- On the Equivalence between Logic Programming and SETAF
Alcântara, João; Cordeiro, Renan; Sá, Samy
