Anytime Computation of Cautious Consequences in Answer Set Programming
From MaRDI portal
Publication:2931278
DOI10.1017/S1471068414000325zbMath1307.68012arXiv1405.3546WikidataQ62043826 ScholiaQ62043826MaRDI QIDQ2931278
Carmine Dodaro, Mario Alviano, Francesco Ricca
Publication date: 25 November 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.3546
68N17: Logic programming
Related Items
Cautious reasoning in ASP via minimal models and unsatisfiable cores, Ticker: A system for incremental ASP-based stream reasoning, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Taming primary key violations to query large inconsistent data via ASP, Anytime answer set optimization via unsatisfiable core shrinking, Enhancing Magic Sets with an Application to Ontological Reasoning, Abstract Solvers for Computing Cautious Consequences of ASP programs, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Paracoherent answer set computation, Supportedly stable answer sets for logic programs with generalized atoms, Enumeration of minimal models and MUSes in WASP, Advances in WASP, The Design of the Sixth Answer Set Programming Competition
Cites Work
- Optimal speedup of Las Vegas algorithms
- Answer set programming and plan generation
- Logic programs with stable model semantics as a constraint programming paradigm
- Combining answer set programming with description logics for the semantic web
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Answer sets for consistent query answering in inconsistent databases
- The DLV system for knowledge representation and reasoning
- Consistent query answering via ASP from different perspectives: Theory and practice
- A machine program for theorem-proving
