Accepted papers

The recently accepted papers in TPLP are the following:

Regular Papers

  1. Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
    Zese, Riccardo; Bellodi, Elena; Cota, Giuseppe; Riguzzi, Fabrizio; Lamma, Evelina
  2. Hybrid ASP-based Approach to Frequent Pattern Mining
    Paramonov, Sergey; Stepanova, Daria; Miettinen, Pauli
  3. Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge
    Calvanese, Diego; Dumas, Marlon; Maggi, Fabrizio; Montali, Marco
  4. Inlining External Sources in Answer Set Programs
    Christoph Redl
  5. Tabled CLP: Description, Implementation, and Evaluation of a Generic Design
    Arias, Joaquin; Carro, Manuel
  6. The External Interface for Extending WASP
    Dodaro, Carmine; Ricca, Francesco
  7. Efficiently Coupling the I-DLV Grounder with ASP Solvers
    Dodaro, Carmine; Calimeri, Francesco; Fuscà, Davide; Perri, Simona; Zangari, Jessica
  8. A Concurrent Constraint Programming Interpretation of Access
    Olarte, Carlos; Pimentel, Elaine; Rueda, Camilo

  9. plasp 3: Towards Effective ASP Planning.
    Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub.
  10. Property-based testing for Spark Streaming. A. Riesco and J. Rodriguez-Hortala.

  11. An Application of ASP Theories of Intentions to Understanding Restaurant Scenarios. Insights and Narrative Corpus Authors: Qinglin Zhang, Chris Benton, Daniela Inclezan.

  12. 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>