A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A linear-time transformation of linear inequalities into conjunctive normal form
Information Processing Letters
Preferred answer sets for extended logic programs
Artificial Intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Expressing preferences in default logic
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Symbolic Model Checking
Extending and implementing the stable model semantics
Artificial Intelligence
Satisfiability in the Year 2000
Journal of Automated Reasoning
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Partially Ordered Constraint Optimization Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Alternating Fixpoint Theory for Logic Programs with Priority
CL '00 Proceedings of the First International Conference on Computational Logic
Applying SAT Methods in Unbounded Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Generic ILP versus specialized 0-1 ILP: an update
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Comparing Arguments Using Preference Orderings for Argument-Based Reasoning
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Proceedings of the 42nd annual Design Automation Conference
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Max-ASP: Maximum Satisfiability of Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing Weighted Solutions in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Solving satisfiability problems with preferences
Constraints
DLVMC: enhanced model checking in DLV
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Proceedings of the 2011 ACM Symposium on Applied Computing
Aggregates in answer set optimization
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Clause form conversions for boolean circuits
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
In this work we present a complete picture of our work on computing optimal solutions in satisfiability problems with qualitative preferences. With this task in mind, we first review our work on computing optimal solutions by imposing an ordering on the way the search space is explored, e.g., on the splitting heuristic in case the dpll algorithm is used. The main feature of this approach is that it guarantees to compute all and only the optimal solutions, i.e., models which are not optimal are not even computed: For this result, it is essential that the splitting heuristic of the solver follows the partial order on the expressed preferences. However, for each optimal solution, a formula that prunes non-optimal solutions needs to be retained, thus this procedure does not work in polynomial space when computing all optimal solutions. We then extend our previous work and show how it is possible to compute optimal solutions using a generate-and-test approach: Such a procedure is based on the idea to first compute a model and then check for its optimality. As a consequence, no ordering on the splitting heuristic is needed, but it may compute also non-optimal models. This approach does not need to retain formulas indefinitely, thus it does work in polynomial space. We start from a simple setting in which a preference is a partial order on a set of literals. We then show how other forms of preferences, i.e., quantitative, qualitative on formulas and mixed qualitative/quantitative can be captured by our framework, and present alternatives for computing "complete" sets of optimal solutions. We finally comment on the implementation of the two procedures on top of state-of-the-art satisfiability solvers, and discuss related work.