Volume 19

Volume 19 – Issue 1 – January 2019

• Enabling Reasoning with LegalRuleML.
  Brian Lam, Mustafa Hashmi 1-26
• Multi-shot ASP solving with clingo
  Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub 27-82

• Hybrid Metabolic Network Completion
  Clèmence Frioux, Torsten Schaub, Sebastian Schellhorn, Anne
  Siegel, Philipp Wanko. 83-108 [Technical Note]

Volume 19 – Special Issue 2 – March 2019 Special Issue on User-oriented Logic Programming and Reasoning Paradigms

• Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms. STEFAN ELLMAUTHALER, CLAUDIA SCHULZ, pp. 109-113
• Answering the “why” in Answer Set Programming — A Survey of Explanation Approaches
  Fandinno, Jorge; Schulz, Claudia. pp 114-203
• Introducing Computer Science to High School Students Through Logic Programming
  TIMOTHY T. YUEN, MARITZA REYES, YUANLIN ZHANG pp 204-228
• Using SWISH to realise interactive web based tutorials for logic based languages
  Wielemaker, Jan; Riguzzi, Fabrizio; Kowalski, Bob; Lager, Torbjörn; Sadri, Fariba; Calejo, Miguel. 229-261
• onlineSPARC: A Programming Environment for Answer Set Programming
  ELIAS MARCOPOULOS, YUANLIN ZHANG. pp 262-289
• Debugging Non-Ground ASP Programs: Technique and Graphical Tools
  Ricca, Francesco; Dodaro, Carmine; Gasteiger, Philip; Reale, Kristian; Schekotihin, Konstantin. pp 290-319
• Web-STAR: A Visual Web-based IDE for a Story Comprehension System
  CHRISTOS T. RODOSTHENOUS, LOIZOS MICHAEL. 317-359

Volume 19 -Issue 3- May 2019

• Inlining External Sources in Answer Set Programs Christoph Redl. pp. 360-411
• Description, Implementation, and Evaluation of a Generic Design for Tabled CLP. Arias, Joaquin; Carro, Manuel. pp 412-488.
• Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach Zese, Riccardo; Bellodi, Elena; Cota, Giuseppe; Riguzzi, Fabrizio; Lamma, Evelina. pp. 449-476.
• plasp 3: Towards Effective ASP Planning.
  Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub. pp. 477-504. [Rapid Communication]

Volume 19 -Issue 4- July 2019

• Hybrid ASP-based Approach to Frequent Pattern Mining
  Paramonov, Sergey; Stepanova, Daria; Miettinen, Pauli. pp 505-535
• Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge
  Calvanese, Diego; Dumas, Marlon; Maggi, Fabrizio; Montali, Marco. pp 563-573
• Property-based testing for Spark Streaming.
  A. Riesco and J. Rodriguez-Hortala. pp 574-602

  Rapid Communication:

• Optimizing Answer Set Computation via Heuristic-Based Decomposition:
  Francesco Calimeri,  Simona Perri,  Jessica Zangari. pp 603-628.

  Erratum

• Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM
  EMANUELE DE ANGELIS, FABIO FIORAVANTI, ALBERTO PETTOROSSI, MAURIZIO PROIETTI, p. 629

Volume 19, Special Issue 5-6 (35th International Conference on Logic Programming)

• Introduction to the 35th International Conference on Logic Programming Special Issue. Esra Erdem, Andrea Formisano, Germàn Visal, Fangkai Yang. pp. 630-635.
• Querying Knowledge via Multi-Hop English Questions Tiantian Gao, Paul Fodor, Michael Kifer, pp. 636-653
• Enhancing magic sets with an application to ontological reasoning Mario Alviano, Nicola Leone, Pierfrancesco Veltri, Jessica Zangari, pp. 654-670
• Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting Jorge Fadinno, pp. 671-687
• Paracoherent Answer Set Semantics meets Argumentation Frameworks Giovanni Amendola, Francesco Ricca, pp. 688-704
• Beyond NP: Quantifying over Answer Sets Giovanni Amendola, Francesco Ricca, Mirek Truszczynski, pp. 705-721
• Resource Analysis driven by (Conditional) Termination Proofs Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin, Albert Rubio, pp. 722-739
• Abstract Solvers for Computing Cautious Consequences of ASP programs Giovanni Amendola, Carmine Dodaro, Marco Maratea, pp. 740-756
• Better Paracoherent Answer Sets with Less Resources Giovanni Amendola, Carmine Dodaro, Francesco Ricca, pp. 757-772
• Anti-unification in Constraint Logic Programming Gonzague Yernaux, Wim Vanhoof, pp. 773-789
• About epistemic negation and world views in Epistemic Logic Programs Stefania Costantini, pp. 790-807
• Applying Constraint Logic Programming to SQL Semantic Analysis Fernando Saenz-Perez, pp. 808-825
• On Uniform Equivalence of Epistemic Logic Programs Wolfgang Faber, Michael Morak, Stefan Woltran, pp. 826-840
• Online Event Recognition from Moving Vehicles: Application Paper Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos, Christos Doulkeridis, Alexander Artikis, pp. 841-856
• Partial Compilation of ASP Programs Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, Peter Schüller, pp. 857-873
• Symbolic Analysis of Maude Theories with Narval María Alpuente, Demis Ballis, Santiago Escobar, Julia Sapiña, pp. 874-890
• Inconsistency Proofs for ASP: The ASP-DRUPE Format Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp, Jakob Rath, pp. 891-907
• Revisiting Explicit Negation in Answer Set Programming Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Perez, Concepcion Vidal, pp. 908-924
• The Expressive Power of Higher-Order Datalog Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis, pp. 925-940
• On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs João Alcântara, Samy Sá, Juan Acosta-Guadarrama, pp. 941-956
• Incremental Answer Set Programming with Overgrounding Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri, Jessica Zangari, pp. 957-973
• A Distributed Approach to LARS Stream Reasoning (System paper) Thomas Eiter, Paul Ogris, Konstantin Schekotihin, pp. 974-989
• Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis Jesús J. Doménech, John P. Gallagher, Samir Genaim, pp. 990-1005
• Relating Two Dialects of Answer Set Programming Amelia Harrison, Vladimir Lifschitz, pp. 1006-1020
• Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge Arpit Sharma, pp. 1021-1037
• A Syntactic Operator for Forgetting that Satisfies Strong Persistence Matti Berthold, Ricardo Gonçalves, Matthias Knorr, João Leite, pp. 1038-1055
• A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation Ariyam Das, Carlo Zaniolo, pp. 1056-1072
• Precomputing Datalog evaluation plans in large-scale scenarios Alessio Fiorentino, Nicola Leone, Marco Manna, Simona Perri, Jessica Zangari, pp. 1073-1089
• Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language Yi Wang, Shiqi Zhang, Joohyung Lee, pp. 1090-1106
• Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP Joaquin Arias, Manuel Carro, pp. 1107-1123
• Domain-Independent Cost-Optimal Planning in ASP David Spies, Jia-Huai You, Ryan Hayward, pp. 1124-1142