Resolution procedures for multiple-valued optimization
暂无分享,去创建一个
[1] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[2] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[3] Felip Manyà,et al. MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.
[4] Reiner Hihnle. Efficient Deduction in Many-Valued Logics , 2001 .
[5] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[6] Reiner Hähnle. Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..
[7] Rina Dechter,et al. Mini-buckets: A general scheme for bounded inference , 2003, JACM.
[8] Javier Larrosa,et al. Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems , 2003, Constraints.
[9] Reiner Hähnle. Efficient Deduction in Many-Valued Logics , 1994, ISMVL.
[10] Thomas Schiex,et al. Soft Constraints , 2000, WLP.
[11] Carlos Ansótegui,et al. Exploiting multivalued knowledge in variable selection heuristics for SAT solvers , 2007, Annals of Mathematics and Artificial Intelligence.
[13] Reiner Hähnle. Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.
[14] Rina Dechter,et al. Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.
[15] Maria Luisa Bonet,et al. A Complete Calculus for Max-SAT , 2006, SAT.
[16] Neil V. Murray,et al. A Framework for Automated Reasoning in Multiple-Valued Logics , 2004, Journal of Automated Reasoning.
[17] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[18] Ramón Béjar,et al. Regular-SAT: A many-valued approach to solving combinatorial problems , 2007, Discret. Appl. Math..
[19] Meinolf Sellmann,et al. A Complete Multi-valued SAT Solver , 2010, CP.
[20] Maria Luisa Bonet,et al. The Logic Behind Weighted CSP , 2007, IJCAI.
[21] Maria Luisa Bonet,et al. Resolution for Max-SAT , 2007, Artif. Intell..
[22] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[23] Thomas Schiex,et al. Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..
[24] Matthew W. Moskewicz,et al. CAMA: A Multi-Valued Satisfiability Solver , 2003, ICCAD 2003.
[25] Reiner Hähnle,et al. Advanced Many-Valued Logics , 2001 .
[26] Christian G. Fermüller,et al. Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..
[27] Maria Luisa Bonet,et al. Inference Rules for High-Order Consistency in Weighted CSP , 2007, AAAI.
[28] Reiner Hähnle,et al. Many-valued logic and mixed integer programming , 1994, Annals of Mathematics and Artificial Intelligence.
[29] Harald Ganzinger,et al. Chaining techniques for automated theorem proving in many-valued logics , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).
[30] B. C. Brookes,et al. Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.
[31] Joao Marques-Silva,et al. Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms , 2011, IJCAI.
[32] Reiner Hähnle,et al. The SAT problem of signed CNF formulas , 2000 .