[HTML][HTML] Solving QBF with counterexample guided refinement
This article puts forward the application of Counterexample Guided Abstraction Refinement
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …
Iterative and core-guided MaxSAT solving: A survey and assessment
Abstract Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real
world applications can be naturally encoded as such. Solving MaxSAT is an important …
world applications can be naturally encoded as such. Solving MaxSAT is an important …
[PDF][PDF] On computing minimal correction subsets
A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal
relaxations and minimal explanations for over-constrained problems find many practical …
relaxations and minimal explanations for over-constrained problems find many practical …
Evaluation of disjunctive programs in WASP
Abstract Answer Set Programming (ASP) is a well-established declarative programming
language based on logic. The success of ASP is mainly due to the availability of efficient …
language based on logic. The success of ASP is mainly due to the availability of efficient …
Domain-specific heuristics in answer set programming
M Gebser, B Kaufmann, J Romero, R Otero… - Proceedings of the …, 2013 - ojs.aaai.org
We introduce a general declarative framework for incorporating domain-specific heuristics
into ASP solving. We accomplish this by extending the first-order modeling language of ASP …
into ASP solving. We accomplish this by extending the first-order modeling language of ASP …
Boolean lexicographic optimization: algorithms & applications
J Marques-Silva, J Argelich, A Graça… - Annals of Mathematics and …, 2011 - Springer
Abstract Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of
practical application problems, some of which involving Boolean variables and constraints …
practical application problems, some of which involving Boolean variables and constraints …
Progress in clasp Series 3
M Gebser, R Kaminski, B Kaufmann, J Romero… - Logic Programming and …, 2015 - Springer
We describe the novel functionalities comprised in clasp's series 3. This includes parallel
solving of disjunctive logic programs, parallel optimization with orthogonal strategies …
solving of disjunctive logic programs, parallel optimization with orthogonal strategies …
[PDF][PDF] Literal-based MCS extraction
Given an over-constrained system, a Maximal Satisfiable Subset (MSS) denotes a maximal
set of constraints that are consistent. A Minimal Correction Subset (MCS, or co-MSS) is the …
set of constraints that are consistent. A Minimal Correction Subset (MCS, or co-MSS) is the …
Abstraction-based algorithm for 2QBF
M Janota, J Marques-Silva - … and Applications of Satisfiability Testing-SAT …, 2011 - Springer
Abstract Quantified Boolean Formulas (QBFs) enable standard representation of PSPACE
problems. In particular, formulas with two quantifier levels (2QBFs) enable representing …
problems. In particular, formulas with two quantifier levels (2QBFs) enable representing …
Partial MUS enumeration
A Previti, J Marques-Silva - Proceedings of the AAAI Conference on …, 2013 - ojs.aaai.org
Minimal explanations of infeasibility find a wide range of uses. In the Boolean domain, these
are referred to as Minimal Unsatisfiable Subsets (MUSes). In some settings, one needs to …
are referred to as Minimal Unsatisfiable Subsets (MUSes). In some settings, one needs to …