default search action
Theory and Practice of Logic Programming, Volume 19
Volume 19, Number 1, January 2019
- Ho-Pun Lam
, Mustafa Hashmi:
Enabling reasoning with LegalRuleML. 1-26 - Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
Multi-shot ASP solving with clingo. 27-82
- Clémence Frioux
Hybrid metabolic network completion. 83-108
Volume 19, Number 2, March 2019
- Stefan Ellmauthaler
Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms. 109-113
- Jorge Fandinno
Answering the "why" in answer set programming - A survey of explanation approaches. 114-203
- Timothy T. Yuen, Maritza Reyes, Yuanlin Zhang:
Introducing Computer Science to High School Students Through Logic Programming. 204-228 - Jan Wielemaker
Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages. 229-261 - Elias Marcopoulos, Yuanlin Zhang:
onlineSPARC: A Programming Environment for Answer Set Programming. 262-289 - Carmine Dodaro
Debugging Non-ground ASP Programs: Technique and Graphical Tools. 290-316 - Christos T. Rodosthenous
Web-STAR: A Visual Web-based IDE for a Story Comprehension System. 317-359
Volume 19, Number 3, May 2019
- Christoph Redl:
Inlining External Sources in Answer Set Programs. 360-411 - Joaquín Arias
Description, Implementation, and Evaluation of a Generic Design for Tabled CLP. 412-448 - Riccardo Zese
Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach. 449-476
- Yannis Dimopoulos, Martin Gebser
plasp 3: Towards Effective ASP Planning. 477-504
Volume 19, Number 4, July 2019
- Sergey Paramonov
Hybrid ASP-based Approach to Pattern Mining. 505-535 - Diego Calvanese
Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge. 536-573 - Adrián Riesco
Property-Based Testing for Spark Streaming. 574-602
- Francesco Calimeri
Optimizing Answer Set Computation via Heuristic-Based Decomposition. 603-628
- Emanuele De Angelis, Fabio Fioravanti
Solving Horn Clauses on Inductive Data Types Without Induction - ERRATUM. 629
Volume 19, Numbers 5-6, September 2019
- Esra Erdem
Introduction to the 35th International Conference on Logic Programming Special Issue. 630-635
- Tiantian Gao
Querying Knowledge via Multi-Hop English Questions. 636-653 - Mario Alviano
Enhancing Magic Sets with an Application to Ontological Reasoning. 654-670 - Jorge Fandinno
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. 671-687 - Giovanni Amendola
Paracoherent Answer Set Semantics meets Argumentation Frameworks. 688-704 - Giovanni Amendola
Beyond NP: Quantifying over Answer Sets. 705-721 - Elvira Albert, Miquel Bofill
Resource Analysis driven by (Conditional) Termination Proofs. 722-739 - Giovanni Amendola
Abstract Solvers for Computing Cautious Consequences of ASP programs. 740-756 - Giovanni Amendola
Better Paracoherent Answer Sets with Less Resources. 757-772 - Gonzague Yernaux
Anti-unification in Constraint Logic Programming. 773-789 - Stefania Costantini
About Epistemic Negation and World Views in Epistemic Logic Programs. 790-807 - Fernando Sáenz-Pérez
Applying Constraint Logic Programming to SQL Semantic Analysis. 808-825 - Wolfgang Faber
On Uniform Equivalence of Epistemic Logic Programs. 826-840 - Efthimis Tsilionis
Online Event Recognition from Moving Vehicles: Application Paper. 841-856 - Bernardo Cuteri
Partial Compilation of ASP Programs. 857-873 - María Alpuente
Symbolic Analysis of Maude Theories with Narval. 874-890 - Mario Alviano
Inconsistency Proofs for ASP: The ASP - DRUPE Format. 891-907 - Felicidad Aguado, Pedro Cabalar, Jorge Fandinno
Revisiting Explicit Negation in Answer Set Programming. 908-924 - Angelos Charalambidis
The Expressive Power of Higher-Order Datalog. 925-940 - João F. L. Alcântara
On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs. 941-956 - Francesco Calimeri
Incremental Answer Set Programming with Overgrounding. 957-973 - Thomas Eiter, Paul Ogris
A Distributed Approach to LARS Stream Reasoning (System paper). 974-989 - Jesús J. Doménech
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. 990-1005 - Amelia Harrison, Vladimir Lifschitz
Relating Two Dialects of Answer Set Programming. 1006-1020 - Arpit Sharma
Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge. 1021-1037 - Matti Berthold, Ricardo Gonçalves
A Syntactic Operator for Forgetting that Satisfies Strong Persistence. 1038-1055 - Ariyam Das
A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation. 1056-1072 - Alessio Fiorentino
Precomputing Datalog Evaluation Plans in Large-Scale Scenarios. 1073-1089 - Yi Wang, Shiqi Zhang, Joohyung Lee
Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language. 1090-1106 - Joaquín Arias
Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP. 1107-1123 - David Spies, Jia-Huai You
Domain-Independent Cost-Optimal Planning in ASP. 1124-1142
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-11 23:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: