Anytime computation of cautious consequences in answer set programming

DOI10.1017/S1471068414000325MaRDI QIDQ2931278zbMATH OpenOpenAlexDBLPWikidataFDO

Authors M. Alviano, Carmine Dodaro, F. 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

zbMATH Keywords

answer set programmingquery answeringanytime algorithmscautious reasoning

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program. This task is computationally very hard, and there are programs for which computing cautious consequences is not viable in reasonable time. However, current ASP solvers produce the (whole) set of cautious consequences only at the end of their computation. This paper reports on strategies for computing cautious consequences, also introducing anytime algorithms able to produce sound answers during the computation.

Recommendations

• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Complexity results for probabilistic answer set programming
• scientific article; zbMATH DE number 5485263

Cites work

• A machine program for theorem-proving
• Answer set programming and plan generation
• Answer sets for consistent query answering in inconsistent databases
• Combining answer set programming with description logics for the semantic web
• Consistent query answering via ASP from different perspectives: theory and practice
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programs with stable model semantics as a constraint programming paradigm
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Optimal speedup of Las Vegas algorithms
• The DLV system for knowledge representation and reasoning

Cited in

(17)

• IASCAR: incremental answer set counting by anytime refinement
• The Design of the Sixth Answer Set Programming Competition
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• Advances in WASP
• Paracoherent answer set computation
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• scientific article; zbMATH DE number 7047282 (Why is no real title available?)
• Anytime answer set optimization via unsatisfiable core shrinking
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Ticker: a system for incremental ASP-based stream reasoning
• A Revised Concept of Safety for General Answer Set Programs
• Enhancing magic sets with an application to ontological reasoning
• Enumeration of minimal models and MUSes in WASP
• Supportedly stable answer sets for logic programs with generalized atoms
• Taming primary key violations to query large inconsistent data via ASP
• Complexity and compilation of GZ-aggregates in answer set programming
• Rewriting recursive aggregates in answer set programming: back to monotonicity

This page was built for publication: Anytime computation of cautious consequences in answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931278)