Mapping problems with finite-domain variables to problems with Boolean variables

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 1-15

  Ansótegui, Carlos ^a   Manyà, Felip ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; FINITE DIFFERENCE METHOD; MAPPING; PROBLEM SOLVING;

BOOLEAN CLAUSAL FORMS; FINITE-DOMAIN VRIABLES; MAPPING PROBLEMS; SAT SOLVERS;

BOOLEAN ALGEBRA;

EID: 26444480660     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_1     Document Type: Conference Paper

References (25)

1. T. Alsinet, R. Béjar, A. Cabiscol, C. Fernández, and F. Manyà. Minimal and redundant SAT encodings for the all-interval-series problem. In Proceedings of the Catalan Conference on Artificial Intelligence, CCIA 2002, Castellón, Spain, pages 139-144. Springer LNCS 2504, 2002.
2. C. Ansótegui, R. Béjar, A. Cabiscol, C. M. Li, and F. Manyá. Resolution methods for many-valued CNF formulas. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing, SAT-2002, Cincinnati, USA, pages 156-163, 2002.
3. C. Ansótegui, J. Larrubia, C. M. Li, and F. Manyá. Mv-Satz: A SAT solver for many-valued clausal forms. In 4th International Conference Journées de L'Informatique Messine, JIM-2003, Metz, France, 2003.
4. C. Ansótegui, J. Larrubia, and F. Manyà. Boosting Chaff's performance by incorporating CSP heuristics. In 9th International Conference on Principles and Practice of Constraint Programming, CP-2003, Kinsale, Ireland, pages 96-107. Springer LNCS 2833, 2003.
5. C. Ansótegui, F. Manyà, R. Béjar, and C. Gomes. Solving many-valued SAT encodings with local search. In Proceedings of the Workshop on Probabilistics Approaches in Search, 18th National Conference on Artificial Intelligence, AAAI-2002, Edmonton, Canada, 2002, 2002.
6. M. Baaz and C. G. Fermüller. Resolution-based theorem proving for many-valued logics. Journal of Symbolic Computation, 19:353-391, 1995.
7. B. Beckert, R. Hähnle, and F. Manyá. Transformations between signed and classical clause logic. In Proceedings, International Symposium on Multiple-Valued Logics, ISMVL'99, Freiburg, Germany, pages 248-255. IEEE Press, Los Alamitos, 1999.
8. B. Beckert, R. Hähnle, and F. Manyà. The SAT problem of signed CNF formulas. In D. Basin, M. D'Agostino, D. Gabbay, S. Matthews, and L. Viganò, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 61-82. Kluwer, Dordrecht, 2000.
9. R. Béjar, A. Cabiscol, C. Fernández, F. Manyà, and C. P. Gomes. Capturing structure with satisfiability. In 7th International Conference on Principles and Practice of Constraint Programming, CP-2001,Paphos, Cyprus, pages 137-152. Springer LNCS 2239, 2001.
10. R. Béjar, R. Hähnle, and F. Manyà. A modular reduction of regular logic to classical logic. In Proceedings, 31st International Symposium on Multiple-Valued Logics (ISMVL), Warsaw, Poland, pages 221-226. IEEE CS Press, Los Alamitos, 2001.
11. R. Béjar and F. Manyà. A comparison of systematic and local search algorithms for regular CNF formulas. In Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU'99, London, England, pages 22-31. Springer LNAI 1638, 1999.
12. J. Culberson. Graph coloring page: The flat graph generator. See http://web.cs.ualberta.ca/~joe/Coloring/Generators/flat.html, 1995.
13. G. Escalada-Imaz and F. Manyà. The satisfiability problem for multiple-valued Horn formulæ. In Proceedings, International Symposium on Multiple- Valued Logics, ISMVL'94, Boston/MA, USA, pages 250-256. IEEE Press, Los Alamitos, 1994.
14. A. M. Frisch and T. J. Peugniez. Solving non-boolean satisfiability problems with stochastic local search. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-2001, pages 282-288, 2001.
15. R. Hähnle. Towards an efficient tableau proof procedure for multiple-valued logics. In Selected Papers from Computer Science Logic (CSL'90), Heidelberg, Germany, LNCS 533, pages 248-260. Springer, 1991.
16. R. Hähnle. Automated Deduction in Multiple-Valued Logics, volume 10 of International Series of Monographs in Computer Science. Oxford University Press, 1994.
17. R. Hähnle. Advanced many-valued logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2. Kluwer, second edition, 2001.
18. F. Manyà. Proof Procedures for Multiple- Valued Propositional Logics. PhD thesis, Universität Autönoma de Barcelona, 1996.
19. F. Manyà. The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic. An International Journal, 5(4):307-325, 2000.
20. F. Manyà, R. Béjar, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3):116-123, 1998.
21. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In 39th Design Automation Conference, 2001.
22. N. V. Murray and E. Rosenthal. Resolution and path-dissolution in multiple-valued logics. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS'91, Charlotte, NC, pages 570-579. Springer LNAI 542, 1991.
23. S. D. Prestwich. Local search on SAT-encoded colouring problems. In Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing, pages 105-109. Springer LNCS 2919, 2003.
24. B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996.
25. T. Walsh. SAT v CSP. In Proceedings of the 6th International Conference on Principles of Constraint Programming, CP-2000, Singapore, pages 441-456. Springer LNCS 1894, 2000.