Solving satisfiability problems with preferences

Constraints

Volumn 15, Issue 4, 2010, Pages 485-515

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

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Preferences; Satisfiability

Indexed keywords

APPLICATION DOMAINS; DECISION PROCEDURE; FORMAL VERIFICATIONS; INPUT SET; LITERALS; OPTIMAL MODEL; PARTIALLY ORDERED SET; PREFERENCES; PROPOSITIONAL SATISFIABILITY; SAT SOLVERS; SATISFIABILITY; SATISFIABILITY PROBLEMS; SPECIFIC PROBLEMS; STATE-OF-THE-ART SYSTEM;

DECISION THEORY; FORMAL LOGIC; OPTIMIZATION; SET THEORY;

PROBLEM SOLVING;

EID: 77956769789     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-010-9095-y     Document Type: Article

References (57)

1. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2002). Generic ILP versus specialized 0-1 ILP: An update. In Proc. ICCAD (pp. 450-457).
2. Aloul, F. A., Ramani, A., Markov, I. L., & Sakallah, K. A. (2002). PBS: A backtrack search Pseudo-Boolean solver. In Proc. SAT.
3. Amgoud, L., Cayrol, C., & Le Berre, D. (1996). Comparing arguments using preference ordering for argument-based reasoning. In Proc. ICTAI (pp. 400-403).
4. Bailleux, O., & Boufkhad, Y. (2003). Efficient CNF encoding of Boolean cardinality constraints. In Proc. CP (pp. 108-122).
5. Barth, P. (1995). A Davis-Putnam enumeration algorithm for linear Pseudo-Boolean optimization. Technical report, Max Plank Institute for Computer Science, MPI-I-95-2-2003.
6. Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999). Symbolic model checking without BDDs. In Proc. TACAS.
7. B Borchers J Furman 1998 A two-phase exact algorithm for Max-SAT and weighted Max-SAT problems Journal of Combinatorial Optimization 2 4 299 306 10.1023/A:1009725216438 1669319
8. C Boutilier RI Brafman C Domshlak HH Hoos D Poole 2004 Preference-based constrained optimization with CP-nets Computational Intelligence 20 2 137 157 10.1111/j.0824-7935.2004.00234.x 2113287
9. C Boutilier RI Brafman C Domshlak HH Hoos D Poole 2004 CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements Journal of Artificial Intelligence Research 21 135 191 1080.68685 2130726
10. Buresh-Oppenheim, J., & Pitassi, T. (2003). The complexity of resolution refinements. In Proc. LICS (pp. 138-147).
11. Büttner, M., & Rintanen, J. (2005). Satisfiability planning with constraints on the number of actions. In Proc. ICAPS (pp. 292-299).
12. Castell, T., Cayrol, C., Cayrol, M., & Le Berre, D. (1996). Using the Davis and Putnam procedure for an efficient computation of preferred models. In Proc. ECAI (pp. 350-354).
13. Chomicki, J., Conitzer, V., Junker, U., & Perny, P. (Eds.) (2008). 4th Multidisciplinary Workshop on Advances in Preference Handling (MPREF'08). Menlo Park: AAAI.
14. M Codish V Lagoon PJ Stuckey 2008 Logic programming with satisfiability Theory and Practice of Logic Programming 8 1 121 128 1128.68014 10.1017/S1471068407003146 (Pubitemid 350231352)
15. Codish, M., Lagoon, V., & Stuckey, P. J. (2008). Telecommunications feature subscription as a partial order constraint problem. In Proc. ICLP 2008 (pp. 749-753).
16. Coudert, O. (1996). On solving covering problems. In Proc. DAC (pp. 197-202).
17. M Davis G Logemann DW Loveland 1962 A machine program for theorem proving Communication of ACM 5 7 394 397 0217.54002 10.1145/368273.368557 149690
18. De Givry, S., Larrosa, J., Meseguer, P,, & Schieux, T. (2003). Solving Max-SAT as weighted CSP. In Proc. CP (pp. 363-376).
19. Di Rosa, E., Giunchiglia, E., & Maratea, M. (2008). Computing all optimal solutions in satisfiability problems with preferences. In Proc. CP (pp. 603-607).
20. Eén, N., & Biere, A. (2005). Effective preprocessing in SAT through variable and clause elimination. In Proc. SAT (pp. 61-75).
21. Eén, N., & Sörensson, N. (2003). An extensible SAT-solver. In Proc. SAT (pp. 502-518).
22. N Eén N Sörensson 2006 Translating Pseudo-Boolean constraints into SAT Journal on Satisfiability, Boolean Modeling and Computation 2 1 26 1116.68083
23. A Gerevini P Haslum D Long A Saetti Y Dimopoulos 2009 Deterministic planning in the 5th IPC: PDDL3 and experimental evaluation of the planners Artificial Intelligence 173 5-6 619 668 1191.68634 10.1016/j.artint.2008.10.012 2504426
24. Giunchiglia, E., & Maratea, M. (2006). Solving optimization problems with DLL. In Proc. ECAI (pp. 377-381).
25. Giunchiglia, E., & Maratea, M. (2007). Planning as satisfiability with preferences. In Proc. AAAI (pp. 987-992).
26. F Heras J Larrosa A Oliveras 2008 MiniMaxSat: A new weighted Max-SAT solver Journal of Artificial Intelligence Research 31 1 32 1183.68578 2385383
27. Jackson, P., & Sheridan, D. (2004). Clause form conversions for Boolean circuits. In Proc. SAT (pp. 183-198).
28. M Järvisalo T Junttila I Niemelä 2005 Unrestricted vs restricted cut in a tableau method for Boolean circuits Annals of Mathematics and Artificial Intelligence 44 4 373 399 1086.03048 10.1007/s10472-005-7034-1 2185702 (Pubitemid 41361150)
29. Jin, H., & Somenzi, F. (2005). Prime clauses for fast enumeration of satisfying assignments to boolean circuits. In Proc. DAC (pp. 750-753).
30. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proc. ECAI (pp. 359-363).
31. Larrosa, J., & Schiex, T. (2003). In the quest of the best form of local consistency for weighted CSP. In Proc. IJCAI 2003 (pp. 239-244).
32. Le Berre, D., & Simon, L. (2004). Fifty-five solvers in Vancouver: The SAT 2004 competition. In Proc. SAT (selected papers) (pp. 321-344).
33. D Le Berre L Simon 2006 Preface to the special volume on the SAT 2005 competitions and evaluation Journal on Satisfiability, Boolean Modeling and Computation 2 1 14
34. CM Li F Manya J Planes 2007 New inference rules for Max-SAT Journal of Artificial Intelligence Research 30 321 359 2390305
35. MH Liffiton KA Sakallah 2008 Algorithms for computing minimal unsatisfiable subsets of constraints Journal of Automated Reasoning 40 1 1 33 1154.68510 10.1007/s10817-007-9084-z 2387924 (Pubitemid 350241118)
36. Manquinho, V. M., Flores, P. F., Marques Silva, J. P., & Oliveira, A. L., (1997). Prime implicant computation using satisfiability algorithms. In Proc. ICTAI (pp. 232-239).
37. Manquinho, V. M., & Marques-Silva, J. P. (2000). On solving boolean optimization with satisfiability-based algorithms. In Proc. AMAI.
38. VM Manquinho JP Marques-Silva 2006 On using cutting planes in Pseudo-boolean optimization Journal on Satisfiability, Boolean Modeling and Computation 2 209 219 1177.90297
39. Manquinho, V. M., Marques Silva, J. P. & Planes, J. (2009). Algorithms for weighted boolean optimization. In Proc. SAT 2009 (pp. 495-508).
40. Marques-Silva, J., & Planes, J. (2008). Algorithms for maximum satisfiability using unsatisfiable cores. In Proc. DATE (pp. 408-413).
41. Marques-Silva, J. P., & Sakallah, K. A. (1996). GRASP-a new search algorithm for satisfiability. In Proc. ICCAD (pp. 220-227).
42. McMillan, K. L. (1993). Symbolic model checking: An approach to the state explosion problem. Dordrecht: Kluwer Academic.
43. McMillan, K. L. (2002). Applying SAT methods in unbounded symbolic model checking. In Proc. CAV (pp. 250-264).
44. DG Mitchell 2005 A SAT solver primer Bulletin of the European Association for Theoretical Computer Science 85 112 132 1169.68444
45. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT Solver. In Proc. DAC (pp. 530-535).
46. DA Plaisted S Greenbaum 1986 A structure-preserving clause form translation Journal of Symbolic Computation 2 293 304 0636.68119 10.1016/S0747-7171(86)80028-1 860540
47. Prestwich, S. D., Rossi, F., Venable, K. B., & Walsh, T. (2005). Constraint-based preferential optimization. In Proc. AAAI (pp. 461-466).
48. Ramirez, M., & Geffner, H. (2007). Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In Proc. CP (pp. 605-619).
49. Ravi, K., & Somenzi, F. (2004). Minimal assignments for bounded model checking. In Proc. TACAS (pp. 31-45).
50. C Sakama K Inoue 2000 Prioritized logic programming and its application to commonsense reasoning Artificial Intelligence 123 1-2 185 222 0952.68020 10.1016/S0004-3702(00)00054-0 1796414
51. Sheini, H. M., & Sakallah, K. A. (2005). Pueblo: A modern Pseudo-Boolean Sat solver. In Proc. DATE (pp. 684-685).
52. Siekmann, J., & Wrightson, G. (Eds.) (1983). Automation of reasoning: Classical papers in computational logic (Vol. 1-2, pp. 1967-1970). New York: Springer.
53. GS Tseitin 1970 On the complexity of proofs in propositional logics Seminars in Mathematics 8 466 483 (Reprinted in [52])
54. Van Nieuwenborgh, D., Heymans, S., & Vermeir, D. (2004). On programs with linearly ordered multiple preferences. In Proc. ICLP (pp. 180-194).
55. D Van Nieuwenborgh D Vermeir 2006 Preferred answer sets for ordered logic programs Theory and Practice of Logic Programming 6 1-2 107 167 1109.68112 10.1017/S1471068404002315 2200148 (Pubitemid 43170523)
56. JP Warners 1998 A linear-time transformation of linear inequalities into conjunctive normal form Information Processing Letters 68 2 63 69 10.1016/S0020-0190(98)00144-6 1652077
57. Z Xing W Zhang 2005 MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability Artificial Intelligence 164 1-2 47 80 1132.68716 10.1016/j.artint.2005.01.004 2139193 (Pubitemid 40454430)