New logical and complexity results for signed-SAT

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2003, Pages 181-187

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

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER HARDWARE; CONSTRAINT THEORY; MANY VALUED LOGICS; PLANNING; PROBLEM SOLVING; SCHEDULING;

BOOLEAN SATISFIABILITY; SIGNED LITERAL;

COMPUTATIONAL COMPLEXITY;

EID: 0038157071     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. C. Ansótegui and F. Manyà, Bridging the gap between SAT and CSP. In 8th International Conference on Principles and Practice of Constraint Programming, CP-2002, Ithaca/NY, USA, pages 784-785, Springer LNCS 2470, 2002.
2. R. J. Bayardo and R. C. Schrag, Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, pages 203-208, AAAI Press, 1997.
3. 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.
4. R. Béjar, Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Autònoma de Barcelona, 2000.
5. 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.
6. 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, EC-SQARU'99, London, England, pages 22-31, Springer LNAI 1638, 1999.
7. R. Béjar and F. Manyà, Phase transitions in the regular random 3-SAT problem. In Proceedings of the 11th International Symposium on Methodologies for Intelligent Systems, ISMIS'99, Warsaw, Poland, pages 292-300, Springer LNAI 1609, 1999.
8. R. Béjar and F. Manyà, Solving combinatorial problems with regular local search algorithms. In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, LPAR'99, Tbilisi, Republic of Georgia, pages 33-43. Springer LNAI 1705, 1999.
9. R. Béjar and F. Manyà, Solving the round robin problem using propositional logic. In Proceedings of the 17th National Conference on Artificial Intelligence, AAAI-2000, Austin/TX, USA, pages 262-266, AAAI Press, 2000.
10. M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962.
11. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
12. 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.
13. R. Hähnle, Automated Deduction in Multiple-Valued Logics, volume 10 of International Series of Monographs in Computer Science, Oxford University Press, 1994.
14. R. Hähnle, Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905-927, 1994.
15. R. Hähnle, Advanced many-valued logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, volume 2, Kluwer, second edition, 2001.
16. R. Hähnle and G. Escalada-Imaz, Deduction in many-valued logics: A survey. Mathware and Soft Computing, 4(2):69-97, 1997.
17. H. A. Kautz, Y. Ruan, D. Achlioptas, C. P. Gomes, B. Selman, and M. Stickel, Balance and filtering in structured satisfiable problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'01, Seattle/WA, USA, pages 351-358, 2001.
18. H. A. Kautz and B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'96, Portland/OR, USA, pages 1194-1201, AAAI Press, 1996.
19. C. M. Li and Anbulagan, Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'97, Nagoya, Japan, pages 366-371. Morgan Kaufmann, 1997.
20. C. M. Li and Anbulagan, Look-ahead versus look-back for satisfiability problems. In Proceedings of the 3rd International Conference on Principles of Constraints Programming, CP'97, Linz, Austria, pages 341-355, Springer LNCS 1330, 1997.
21. F. Manyà, The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic. An International Journal, 5(4):307-325, 2000.
22. J. P. Marques-Silva and L. Guerra, Algorithms for satisfiability in combinatorial circuits based on backtrack search and recursive learning. In Proc. of XII Symposium on Integrated Circuits and Systems Design (SBCCI), 1999.
23. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In 39th Design Automation Conference, 2001.
24. N. V. Murray and E. Rosenthal, Signed formulas: A liftable meta logic for multiple-valued logics. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS'93, Trondheim, Norway, pages 275-284, Springer LNAI 689, 1993.
25. B. Selman and H. A. Kautz, Domain-independent extensions of GSAT: Solving large structured satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'93, Chambery, France, pages 290-295, Morgan Kaufmann, 1993.
26. B. Selman, H. A. Kautz and B. Cohen. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, Seattle/WA, USA, pages 337-343, AAAI Press, 1994.
27. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92, San Jose/CA, USA, pages 440-446, AAAI Press, 1992.
28. M. Velev and R. Bryant, Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors. In 38th Design Automation Conference (DAC'01), 2001.