Accepted papers

The recently accepted papers in TPLP are the following:

  1. The External Interface for Extending WASP Carmine
    Dodaro, Francesco Ricca
  2. Efficiently Coupling the I-DLV Grounder with ASP Solvers Carmine
    Dodaro, Francesco Calimeri, Davide Fuscà, Simona Perri, Jessica Zangari
  3. A Concurrent Constraint Programming Interpretation of Access Carlos Olarte, Elaine Pimentel, Camilo Rueda
  4. An Application of ASP Theories of Intentions to Understanding Restaurant Scenarios: Insights and Narrative Corpus
    Qinglin Zhang, Chris Benton, Daniela Inclezan
  5. The Seventh Answer Set Programming Competition: Design and Results Martin Gebser, Marco Maratea, Francesco Ricca
  6. Action-Centered Information Retrieval Marcello Balduccini, Emily LeBlanc
  7. A Logic Framework for P2P Deductive Databases Luciano Caroprese, Ester Zumpano
  8. Implementing a Library for Probabilistic Programming using Non-strict Non-determinism. Sandra Dylus, Jan Christiansen, and Finn Teegen
  9. A Transformational Approach to Resource Analysis with Typed-norms Inference, Elvira Albert, Samir Genaim, Raúl Gutiérrez, Enrique Martin-Martin
  10. Compositional specification in rewriting logic. Óscar Martín, José Alberto Verdejo, Narciso Martí-Oliet
  11. A Comparative Study of Some Central Notions of ASPIC+ and DeLP. Alejandro Garcia, Henry Prakken, and Guillermo Simari.

    Papers accepted to ICLP 2019

  12. Querying Knowledge via Multi-Hop English Questions Tiantian Gao, Paul Fodor, Michael Kifer
  13. Enhancing magic sets with an application to ontological reasoning Mario Alviano, Nicola Leone, Pierfrancesco Veltri, Jessica Zangari
  14. Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting Jorge Fadinno
  15. Paracoherent Answer Set Semantics meets Argumentation Frameworks Giovanni Amendola, Francesco Ricca
  16. Beyond NP: Quantifying over Answer Sets Giovanni Amendola, Francesco Ricca, Mirek Truszczynski
  17. Resource Analysis driven by (Conditional) Termination Proofs Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio
  18. Abstract Solvers for Computing Cautious Consequences of ASP programs Giovanni Amendola, Carmine Dodaro, Marco Maratea
  19. Better Paracoherent Answer Sets with Less Resources Giovanni Amendola, Carmine Dodaro, Francesco Ricca
  20. Anti-unification in Constraint Logic Programming Gonzague Yernaux, Wim Vanhoof
  21. About epistemic negation and world views in Epistemic Logic Programs Stefania Costantini
  22. Applying Constraint Logic Programming to SQL Semantic Analysis Fernando Saenz-Perez
  23. On Uniform Equivalence of Epistemic Logic Programs Wolfgang Faber, Michael Morak, Stefan Woltran
  24. Online Event Recognition from Moving Vehicles: Application Paper Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos, Christos Doulkeridis, Alexander Artikis
  25. Partial Compilation of ASP Programs Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, Peter Schüller
  26. Symbolic Analysis of Maude Theories with Narval María Alpuente, Demis Ballis, Santiago Escobar, Julia Sapiña
  27. Inconsistency Proofs for ASP: The ASP-DRUPE Format Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
  28. Revisiting Explicit Negation in Answer Set Programming Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Perez, Concepcion Vidal
  29. The Expressive Power of Higher-Order Datalog Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis
  30. On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs João Alcântara, Samy Sá, Juan Acosta-Guadarrama
  31. Incremental Answer Set Programming with Overgrounding Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri, Jessica Zangari
  32. A Distributed Approach to LARS Stream Reasoning (System paper) Thomas Eiter, Paul Ogris, Konstantin Schekotihin
  33. Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis Jesús J. Doménech, John P. Gallagher, Samir Genaim
  34. Relating Two Dialects of Answer Set Programming Amelia Harrison, Vladimir Lifschitz
  35. Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge Arpit Sharma
  36. A Syntactic Operator for Forgetting that Satisfies Strong Persistence Matti Berthold, Ricardo Gonçalves, Matthias Knorr, João Leite
  37. A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation Ariyam Das, Carlo Zaniolo
  38. Precomputing Datalog evaluation plans in large-scale scenarios Alessio Fiorentino, Nicola Leone, Marco Manna, Simona Perri, Jessica Zangari
  39. Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language Yi Wang, Shiqi Zhang, Joohyung Lee
  40. Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP Joaquin Arias, Manuel Carro
  41. Domain-Independent Cost-Optimal Planning in ASP David Spies, Jia-Huai You, Ryan Hayward