A new approach for solving satisfiability problems with qualitative preferences

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 510-514

  Di Rosa, Emanuele ^a   Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBLEM SOLVING;

BRANCHING HEURISTICS; EXPONENTIALS; LITERALS; NEW APPROACHES; OPTIMAL MODEL; OPTIMAL SOLUTIONS; PARTIAL ORDER; PERFORMANCE; SATISFIABILITY PROBLEMS; SIMPLE MODIFICATIONS;

OPTIMIZATION;

EID: 84873330034     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-510     Document Type: Article

References (24)

1. Fadi A. Aloul, Arathi Ramani, Igor L. Markov, and Karem A. Sakallah,PBS: A backtrack search pseudo-Boolean solver', in Proc. SAT, (2002).
2. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Fausto Giunchiglia, and Armando Tacchella,SAT-based decision procedures for automated reasoning: a unifying perspective', in Mechanizing Mathematical Reasoning: Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, volume 2605 of LNCS, Springer Verlag, (2005).
3. Olivier Bailleux and Yacine Boufkhad,Efficient CNF encoding of Boolean cardinality constraints.', in Proc. CP, pp. 108-122, (2003).
4. P. Barth, A Davis-Putnam enumeration algorithm for linear pseudoboolean optimization', Technical report, Max Plank Instutute for Computer Science, (1995). technical Report MPI-I-95-2-2003.
5. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, 'Symbolic model checking using SAT procedures instead of BDDs', in Proceedings of the 36th Design Automation Conference (DAC 99), pp. 317-320. Association for Computing Machinery, (1999).
6. Brian Borchers and Judith Furman, 'A two-phase exact algorithm for max-SAT and weighted max-SAT problems.', J. Comb. Optim., 2(4), 299-306, (1998).
7. Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, and David Poole, 'CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements', J. Artif Intell. Res. (JAIR), 21, 135-191, (2004).
8. Jon Doyle, 'Prospects for preferences', Computational Intelligence, 20(2), 111-136, (2004).
9. Niklas Eén and Armin Biere, 'Effective preprocessing in sat through variable and clause elimination', in Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, volume 3569 of Lecture Notes in Computer Science, pp. 61-75. Springer, (2005).
10. Niklas Eén and Niklas Sörensson, An extensible SAT-solver, in Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, Selected Revised Papers, pp. 502-518, (2003).
11. Niklas Eén and Niklas Sörensson, Translating pseudo-Boolean constraints into SAT, Journal on Satisfiability, Boolean Modeling and Computation, 2, 1-26, (2006).
12. E. Giunchiglia and M. Maratea, 'Solving optimization problems with DLL', in Proc. of 17th European Conference on Artificial Intelligence (ECAI), pp. 377-381, (2006).
13. Enrico Giunchiglia and Marco Maratea, 'Planning as satisfiability with preferences', in In Proc. of 22nd AAAI Conference on Artificial Intelligence, pp. 987-992. AAAI Press, (2007).
14. Federico Heras, Javier Larrosa, and Albert Oliveras, 'MiniMaxSat: A new weighted max-sat solver', in Proc. of Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, volume 4501 of LNCS, pp. 41-55. Springer, (2007).
15. Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä, 'Unrestricted vs restricted cut in a tableau method for Boolean circuits', Annals of Mathematics and Artificial Intelligence, 44(4), 373-399, (August 2005).
16. Henry Kautz and Bart Selman, 'Planning as satisfiability', in Proc. ECAI, pp. 359-363, (1992).
17. Javier Larrosa, Federico Heras, and Simon de Givry, 'A logical approach to efficient Max-SAT solving', Artificial Intelligence, 172, 204-233, (2008).
18. Chu Min Li, Felip Manya, and Jordi Planes, 'New inference rules for max-sat', Journal of Artificial Intelligence Research (JAIR). To appear, (2007).
19. V. M. Manquinho and J. P. Marques-Silva, 'On using cutting planes in pseudo-boolean optimization', Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 2, 209-219, (2006).
20. Vasco Miguel Manquinho and Olivier Roussel, "The first evaluation of pseudo-Boolean solvers (PB'05)', Journal on Satisfiability, Boolean Modeling and Computation, 2, 103-143, (2006).
21. P. Meseguer S. De Givry, J. Larrosa and T. Schieux, 'Solving MaxSAT as weighted CSP', in Proc. of 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of Lecture Notes in Computer Science, pp. 363-376, (2003).
22. Hossein M. Sheini and Karem A. Sakallah, 'Pueblo: A modern pseudoboolean sat solver', in 2005 Design, Automation and Test in Europe Conference and Exposition (DATE 2005), 7-11 March 2005, Munich, Germany, pp. 684-685. IEEE Computer Society, (2005).
23. Joost P. Warners, 'A linear-time transformation of linear inequalities into conjunctive normal form.', Information Processing Letters, 68(2), 63-69, (1998).
24. Z. Xing and W. Zhang, 'MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability', Artificial Intelligence, 164(1-2), 47-80, (2005).