ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A linear-time transformation of linear inequalities into conjunctive normal form
Information Processing Letters
A machine program for theorem-proving
Communications of the ACM
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Some Computational Aspects of distance-sat
Journal of Automated Reasoning
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A fast approximation algorithm for MIN-ONE SAT
Proceedings of the conference on Design, automation and test in Europe
SAT-Based Planning with Minimal-#actions Plans and "soft" Goals
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Computing All Optimal Solutions in Satisfiability Problems with Preferences
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Solution Enumeration for Projected Boolean Search Problems
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
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
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
DLVMC: enhanced model checking in DLV
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
OPTSAT: a tool for solving SAT related optimization problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Lower bounds and upper bounds for MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Solutions for hard and soft constraints using optimized probabilistic satisfiability
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the Davis-Logemann-Loveland procedure (DLL). DLL is a decision procedure: Given a formula φ, it returns whether φ is satisfiable or not. Further, DLL can be easily modified in order to return an assignment satisfying φ, assuming one exists. However, in many cases it is not enough to compute a satisfying assignment: Indeed, the returned assignment has also to be “optimal” in some sense, e.g., it has to minimize/maximize a given objective function. In this paper we show that DLL can be very easily adapted in order to solve optimization problems like MAX-SAT and MIN-ONE. In particular these problems are solved by simply imposing an ordering on a set of literals, to be followed while branching. Other popular problems, like DISTANCE-SAT and WEIGHTED-MAX-SAT, can be solved in a similar way. We implemented these ideas in ZCHAFF and the experimental analysis show that the resulting system is competitive with respect to other state-of-the-art systems.