Combining satisfiability techniques from AI and OR

Knowledge Engineering Review

Volumn 15, Issue 1, 2000, Pages 31-45

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

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; DECISION THEORY; LEARNING ALGORITHMS; OPERATIONS RESEARCH; THEOREM PROVING;

PSEUDO-BOOLEAN REPRESENTATION; RELEVANCE-BOUNDED LEARNING;

KNOWLEDGE REPRESENTATION;

EID: 0034155463     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888900001041     Document Type: Article

References (36)

1. Baker, AB, 1995. "Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results" PhD thesis, University of Oregon.
2. Bayardo, RJ and Miranker, DP, 1996. "A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem" Proceedings of the Thirteenth National Conference on Artificial Intelligence 298-304.
3. Blair, CE, Jeroslow, RG and Lowe, JK, 1986. "Some results and experiments in programming techniques for propositional logic" Computers and Operations Research 13(5) 633-645.
4. Bockmayr, A, 1993. "Logic programming with pseudo-boolean constraints" in F Benhamou and A Colmerauer (eds.), Constraint Logic Programming. Selected Research MIT Press, 327-350.
5. Bonet, M, Pitassi, T and Raz, R, 1997. "Lower bounds for cutting plane proofs with small coefficients" Jounal of Symbolic Logic 62 708-728.
6. Chvátal, V, 1975. "Edmonds polytopes and weakly Hamiltonian graphs" Mathematical Programming 5 29-40.
7. Chvátal, V, 1983. Linear Programming WH Freeman.
8. Chvátal, V and Szemerédi, E, 1988. "Many hard examples for resolution" Journal of the Association for Computing Machinery 35 759-768.
9. Cook, W, Coullard, C and Turán, G, 1987. "On the complexity of cutting plane proofs" Journal of Discrete Applied Math 18 25-38.
10. Crawford, JM and Auton, LD, 1996. "Experimental results on the crossover point in random 3SAT" Artificial Intelligence 81.
11. Davis, M and Putnam, H, 1960. "A computing procedure for quantification theory" Journal of the Association for Computing Machinery 7 201-215.
12. Dechter, R, 1990. "Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition" Artificial Intelligence 41(3) 273-312.
13. Dubois, O, Andre, P, Boufkhad, Y and Carlier, J, 1993. "SAT versus UNSAT" Second DIMACS Challenge: Cliques, Colorings and Satisfiability Rutgers University, NJ.
14. Freeman, JW, 1995. "Improvements to propositional satisfiability search algorithms" PhD thesis, University of Pennsylvania, PA.
15. Frost, D and Dechter, R, 1994. "Dead-end driven learning" Proceedings of the Twelfth National Conference on Artificial Intelligence 294-300.
16. Gallo, G and Urbani, G, 1989. "Algorithms for testing the satisfiability of prepositional formulae" Journal of Logic Programming 7 45-61.
17. Ginsberg, ML, 1993. "Dynamic backtracking" Journal of Artificial Intelligence Research 1 25-46.
18. Goerdt, A, 1990. "Cutting plane versus frege proof systems" Lecture Notes in Computer Science 533.
19. Gomory, R, 1963. "An algorithm for integer solutions to linear programs" Recent Advances in Mathematical Programming McGraw-Hill, New York, 269-302.
20. Haken, A, 1985. "The intractability of resolution" Theoretical Computer Science 39 297-308.
21. Hammer, P and Rudeanu, S, 1968. Boolean Methods in Operations Research and Related Areas Springer-Verlag, Berlin.
22. Harche, F, Hooker, JN and Thompson, GL, 1994. "A computational study of satisfiability algorithms for prepositional logic" ORSA Journal on Computing 6(4) 423-435.
23. Harche, F and Thompson, GL, 1994. "The column subtraction algorithm: an exact method for solving weighted set covering, packing and partitioning problems" Computers and Operations Research 21(6) 689-705.
24. Hooker, J, Ottosson, G, Thorsteinsson, ES and Kim, H-J, 2000. "A scheme for unifying optimization and constraint satisfaction methods" The Knowledge Engineering Review, this issue.
25. Hooker, JN and Fedjki, C, 1990. "Branch-and-cut solution of inference problems in propositional logic" Annals of Mathematics and Artificial Intelligence 1 123-139.
26. Hooker, JN and Vinay, V, 1995. "Branching rules for satisfiability" Journal of Automated Reasoning 15 359-383.
27. Jeroslow, R and Wang, J, 1990. "Solving the propositional satisfiability problem" Annals of Mathematics and Artificial Intelligence 1 167-187.
28. Li, CM and Anbulagan, 1997. "Heuristics based on unit propagation for satisfiability problems" Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence.
29. Loveland, DW, 1978. Automated Theorem Proving: A Logical Basis North Holland.
30. Mitchell, DG, 1998. "Hard problems for CSP algorithms" Proceedings of the Fifteenth National Conference on Artificial Intelligence 398-405.
31. Nemhauser, GL and Wolsey, LA, 1988. Integer and Combinatorial Optimization Wiley, New York.
32. Pretolani, D, 1993. "Satisfiability and hypergraphs" PhD thesis, Universita di Pisa, Italy.
33. Pudlák, P, 1997. "Lower bounds for resolution and cutting plane proofs and monotone computations" Journal of Symbolic Logic 62 981-998.
34. Stallman, RM and Sussman, GJ, 1977. "Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis" Artificial Intelligence 9(2) 135-196.
35. Walser, JP, 1997. "Solving linear pseudo-boolean constraint problems with local search" Proceedings of the Fourteenth National Conference on Artificial Intelligence.
36. Wolfman, SA and Weld, DS, 2000. "Combining linear programming and satisfiability solving for resource planning" The Knowledge Engineering Review this issue.