The recently accepted papers in TPLP are the following:
Regular Papers
- Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
Zese, Riccardo; Bellodi, Elena; Cota, Giuseppe; Riguzzi, Fabrizio; Lamma, Evelina - Hybrid ASP-based Approach to Frequent Pattern Mining
Paramonov, Sergey; Stepanova, Daria; Miettinen, Pauli - Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge
Calvanese, Diego; Dumas, Marlon; Maggi, Fabrizio; Montali, Marco - Inlining External Sources in Answer Set Programs
Christoph Redl
- Tabled CLP: Description, Implementation, and Evaluation of a Generic Design
Arias, Joaquin; Carro, Manuel - The External Interface for Extending WASP
Dodaro, Carmine; Ricca, Francesco
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
Dodaro, Carmine; Calimeri, Francesco; Fuscà, Davide; Perri, Simona; Zangari, Jessica
-
A Concurrent Constraint Programming Interpretation of Access
Olarte, Carlos; Pimentel, Elaine; Rueda, Camilo - plasp 3: Towards Effective ASP Planning.
Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub. -
Property-based testing for Spark Streaming. A. Riesco and J. Rodriguez-Hortala.
-
An Application of ASP Theories of Intentions to Understanding Restaurant Scenarios. Insights and Narrative Corpus Authors: Qinglin Zhang, Chris Benton, Daniela Inclezan.
- Optimizing Answer Set Computation via Heuristic-Based Decomposition: Francesco Calimeri, Simona Perri, Jessica Zangari.
Accepted Technical Notes/Rapid Publication Papers
- <none>
Accepted Book Reviews
- <none>