Abstract Solvers for Computing Cautious Consequences of ASP programs
From MaRDI portal
(Redirected from Publication:5108499)
Abstract: Abstract solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP. In this paper, we design, implement and test novel abstract solutions for cautious reasoning tasks in ASP. We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms. By doing so, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. We implement some of the new solutions in the ASP solver WASP and show that their performance are comparable to state-of-the-art solutions on the benchmark problems from the past ASP Competitions. Under consideration for acceptance in TPLP.
Recommendations
- Anytime computation of cautious consequences in answer set programming
- scientific article; zbMATH DE number 7047282
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- A mechanized strategy for safe abstraction of CSP specifications
- Debugging non-ground ASP programs with choice rules, cardinality and weight constraints
- Theories, solvers and static analysis by abstract interpretation
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 7047282 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1931668 (Why is no real title available?)
- scientific article; zbMATH DE number 6747884 (Why is no real title available?)
- Abstract Answer Set Solvers
- Abstract answer set solvers with backjumping and learning
- Abstract solvers for Dung's argumentation frameworks
- Advances in WASP
- Algorithms for computing backbones of propositional formulae
- Answer sets for consistent query answering in inconsistent databases
- Anytime answer set optimization via unsatisfiable core shrinking
- Anytime computation of cautious consequences in answer set programming
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Combining answer set programming with description logics for the semantic web
- Conflict-driven answer set solving: from theory to practice
- Consistent query answering via ASP from different perspectives: theory and practice
- Design and results of the Fifth Answer Set Programming Competition
- Evaluation of disjunctive programs in WASP
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Lazy satisfiability modulo theories
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- On abstract modular inference systems and solvers
- On the relation among answer set solvers
- Relating constraint answer set programming languages and algorithms
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving satisfiability problems with preferences
- The DLV system for knowledge representation and reasoning
- The Sixth Answer Set Programming Competition
- Transition systems for model generators -- a unifying approach
Cited in
(7)- Anytime computation of cautious consequences in answer set programming
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- scientific article; zbMATH DE number 7047282 (Why is no real title available?)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Omission-based abstraction for answer set programs
- Abstract solvers for quantified Boolean formulas and their applications
- Abstract solvers for Dung's argumentation frameworks
This page was built for publication: Abstract Solvers for Computing Cautious Consequences of ASP programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108499)
