Resolution in Max-SAT and its relation to local consistency in weighted CSPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 193-198

  Larrosa, Javier ^a   Heras, Federico ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; BRANCHING POINTS; LOCAL CONSISTENCY; LOGICAL FRAMEWORKS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; POINT OF VIEWS; WEIGHTED CONSTRAINT SATISFACTIONS;

ARTIFICIAL INTELLIGENCE; LINEAR PROGRAMMING;

ALGORITHMS;

EID: 84880726367     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. T. Alsinet, F. Manya, and J. Planas. Improved branch and bound algorithms for max-sat. In Proc. of the 6th SAT, pages 408-415, 2003.
2. Fahiem Bacchus. Enhancing davis putnam with extended binary clause reasoning. In Proceedings of the 18th AAAI, pages 613-619, 2002.
3. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints, 4:199-240, 1999. (Pubitemid 129579725)
4. th AAAI, pages 332-337, Portland, OR, 1996.
5. M. Cooper. Reductions operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems, 134(3):311-342, 2003.
6. M. Davis, G. Logemann, and G. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
7. th CP, pages 363-376, Kinsale, Ireland, 2003. LNCS 2833. Springer Verlag.
8. thIJCAI, Edinburgh, U.K., August 2005.
9. th Intl. Workshop on Soft Constraints and Preferences, pages 363-376, Toronto, Canada, 2004.
10. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41-85, 1999. (Pubitemid 30542742)
11. L. Drake, A. Frisch, and T. Walsh. Adding resolution to the dpll procedure for boolean satisfiability. In Proceedings of 5th SAT, pages 122-129, 2002.
12. A. Van Gelder. Satisfiability testing with more reasoning and less guessing, pages 0-1. American Mathematical Society, 1995.
13. P. Hansen and B. Jaumard. Algorithms for the maximum satisfiability problem. Computing, 44:279-303, 1990. (Pubitemid 20722282)
14. th IJCAI, Acapulco, Mexico, August 2003.
15. J. Larrosa and T. Schiex. Solving weighted csp by maintaining arc-consistency. Artificial Intelligence, 159(1-2):1-26, 2004.
16. I. Rish and R. Dechter. Resolution vs. sat: two approaches to sat. Journal of Automated Reasoning, 24(1):225-275, 2000.
17. J. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23-41, 1965.
18. Haiou Shen and Hantao Zhang. Study of lower bounds for max-2-sat. In Proceedings of the 19th AAAI, 2004.
19. th CP, pages 690-705, Toronto, Canada, 2004. LNCS 3258. Springer Verlag.