Abstract
Propositional satisfiability (SAT) is one of the most important and central problems in Artificial Intelligence and Computer Science. Basically, most SAT solvers are based on the well-known Davis-Logemann-Loveland (DLL) procedure. DLL is a decision procedure: given a SAT formula φ, it can decide if φ is satisfiable (and it can return a satisfying assignment μ), or not. Often, this is not suffi- cient, in that we would like μ to be also “optimal”, i.e., that has also to minimize/ maximize a given objective function. max-sat, min-one, distance-sat and their weighted versions are popular optimization problems. (In the following, φ is the input formula expressed as a set of clauses). Almost all the systems that can deal with these problems follow a classical branch&bound schema: whenever a satisfying assignment μ for φ with a cost c μ is found, the search goes on looking for another satisfying assignment with a lower (or higher, depending on the problem) cost.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108–122. Springer, Heidelberg (2003)
Bailleux, O., Marquis, P.: Some computational aspects of DISTANCE-SAT. Journal of Automated Reasoning (JAR) (to appear, 2006)
Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: ECAI 2006 (accepted, 2006), Available at: http://www.star.dist.unige.it/~marco/Data/06ecai.pdf.gz
Le Berre, D., Simon, L.: Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 321–344. Springer, Heidelberg (2005)
LeBerre, D., Simon, L.: Preface to the special volume on the sat 2005 competitions and evaluations. Journal of Satisfiability, Boolean Modeling and Computation (JSAT) (2006)
Manquinho, V.M., Roussel, O.: The first evaluation of pseudo-boolean solvers (PB05). Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2, 103–143 (2006)
Warners, J.P.: A linear-time transformation of linear inequalities into CNF. Information Processing Letters 68(2), 63–69 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giunchiglia, E., Maratea, M. (2006). optsat: A Tool for Solving SAT Related Optimization Problems. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds) Logics in Artificial Intelligence. JELIA 2006. Lecture Notes in Computer Science(), vol 4160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853886_43
Download citation
DOI: https://doi.org/10.1007/11853886_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39625-3
Online ISBN: 978-3-540-39627-7
eBook Packages: Computer ScienceComputer Science (R0)