Inference methods for a pseudo-Boolean satisfiability solver

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 635-640

  Dixon, Heidi E ^a   Ginsberg, Matthew L ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; CONSTRAINT THEORY; OPERATIONS RESEARCH;

INFERENCE METHODS;

PROBLEM SOLVING;

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

References (17)

1. Barth, P. 1995. A Davis-Putnam based enumeration algorithm for linear pseudo-boolean optimization. Technical Report MPI-I-95-2-003, Max Planck Institut für Informatik, Saarbrücken, Germany.
2. Baumgartner, P. 2000. FDPLL - a first-order Davis-Putnam-Logeman-Loveland procedure. In P. Baumgartner, C. Fermuller, N. P., and Zhang, H., eds., CADE 2000.
3. Bayardo, R. J., and Schrag, R. C. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proc. AAAI-97.
4. Benhamou, B.; Sais, L.; and Siegel, P. 1994. Two proof procedures for a cardinality based language in prepositional calculus. In Proceedings of STACS94, volume 775 de Lecture Notes in Computer Science.
5. Cook, W.; Coullard, C.; and Turán, G. 1987. On the complexity of cutting plane proofs. Journal of Discrete Applied Math 18:25-38.
6. Davis, M., and Putnam, H. 1960. A computing procedure for quantification theory. Journal of the Association for Computing Machinery 7:201-215.
7. Dixon, H. E., and Ginsberg, M. L. 2000. Combining satisfiability techniques from AI and OR. The Knowledge Engineering Review 15(1).
8. Ginsberg, M. L. 1993. Dynamic backtracking. Journal of Artificial Intelligence Research 1:25-46.
9. Guignard, M., and Spielberg, K. 1981. Logical reduction methods in zero-one programming. Operations Research 29.
10. Haken, A. 1985. The intractability of resolution. Theoretical Computer Science 39:297-308.
11. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI-96.
12. Li, C. M., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97.
13. Loveland, D. W. 1978. Automated Theorem Proving: A Logical Basis. North Holland.
14. Moskewicz M.; Madigan C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proc. of the Design Automation Conference.
15. Savelsbergh, M. W. P. 1994. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing 6:445-454.
16. Stallman, R. M., and Sussman, G. J. 1977. Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis. Artificial Intelligence 9(2): 135-196.
17. Whittemore, J.; Kim, J.; and Sakallah, K. 2001. SATIRE: A new incremental satisfiability engine. In Proc. of the Design Automation Conference.