The Logic Behind Weighted CSP
暂无分享,去创建一个
[1] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[2] Carlos Ansótegui,et al. Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.
[3] Reiner Hähnle,et al. The SAT problem of signed CNF formulas , 2000 .
[4] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[5] Javier Larrosa,et al. Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.
[6] Eugene C. Freuder,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[7] Maria Luisa Bonet,et al. A Complete Calculus for Max-SAT , 2006, SAT.
[8] Thomas Schiex,et al. Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..
[9] Carlos Ansótegui,et al. New logical and complexity results for Signed-SAT , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..
[10] Ramón Béjar,et al. Capturing Structure with Satisfiability , 2001, CP.
[11] Bernhard Beckert,et al. Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).
[12] Javier Larrosa,et al. Exploiting the Use of DAC in MAX-CSP , 1996, CP.
[13] Thomas Schiex,et al. Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.
[14] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[15] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[16] Reiner Hähnle,et al. Advanced Many-Valued Logics , 2001 .