Generalizing Boolean satisfiability II: Theory

Journal of Artificial Intelligence Research

Volumn 22, Issue , 2004, Pages 481-534

  Dixon, Heidi E ^a   Ginsberg, Matthew L ^a   Luks, Eugene M ^b   Parkes, Andrew J ^b  

^a On Time Systems Inc   (United States)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATABASE SYSTEMS; INFERENCE ENGINES; PERFORMANCE; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY; COMPUTATIONAL PERFORMANCE; GROUP STRUCTURE; SOLVERS;

BOOLEAN ALGEBRA;

EID: 27144521366     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1555     Document Type: Article

References (35)

1. Babai, L. (1986). On the length of subgroup chains in the symmetric group. Comm. Algebra, 14(9), 1729-1736.
2. Babai, L., Luks, E., & Seress, A. (1997). Fast management of permutation groups I. SIAM J. Computing, 26, 1310-1342.
3. Barth, P. (1995). A Davis-Putnam based enumeration algorithm for linear pseudo-boolean optimization. Tech. rep. MPI-I-95-2-003, Max Planck Institut für Informatik, Saarbrücken, Germany.
4. Barth, P. (1996). Logic-Based 0-1 Constraint Programming, Vol. 5 of Operations Research/Computer Science Interfaces Series. Kluwer.
5. Baumgartner, P., & Massacci, F. (2000). The Taming of the (X)OR. In Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L. M., Sagiv, Y., & Stuckey, P. J. (Eds.), Computational Logic - CL 2000, Vol. 1861, pp. 508-522. Springer.
6. Bayardo, R. J., & Miranker, D. P. (1996). A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 298-304.
7. Bayardo, R. J., & Schrag, R. C. (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 203-208.
8. Chandru, V., & Hooker, J. N. (1999). Optimization Mehtods for Logical Inference. Wiley-Interscience.
9. Cook, W., Coullard, C., & Turan, G. (1987). On the complexity of cutting-plane proofs. Discrete Applied Mathematics, 18, 25-38.
10. Crawford, J. M., Ginsberg, M. L., Luks, E., & Roy, A. (1996). Symmetry breaking predicates for search problems. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, Boston, MA.
11. Dixon, H. E., & Ginsberg, M. L. (2000). Combining satisfiability techniques from AI and OR. Knowledge Engrg. Rev., 15, 31-45.
12. Dixon, H. E., Ginsberg, M. L., Hofer, D., Luks, E. M., & Parkes, A. J. (2004a). Generalizing Boolean satisfiability III: Implementation. Tech. rep., On Time Systems, Inc., Eugene, Oregon.
13. Dixon, H. E., Ginsberg, M. L., & Parkes, A. J. (2004b). Generalizing Boolean satisfiability I: Background and survey of existing work. Journal of Artificial Intelligence Research, 21, 193-243.
14. Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
15. Ginsberg, M. L., & Parkes, A. J. (2000). Search, subsearch and QPROP. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning, Breckenridge, Colorado.
16. Guignard, M., & Spielberg, K. (1981). Logical reduction methods in zero-one programming. Operations Research, 29.
17. Haken, A. (1985). The intractability of resolution. Theoretical Computer Science, 39, 297-308.
18. Harrison, M. A. (1989). Introduction to Switching and Automata Theory. McGraw-Hill.
19. Hooker, J. N. (1988). Generalized resolution and cutting planes. Annals of Operations Research, 12, 217-239.
20. Jerrum, M. (1986). A compact representation for permutation groups. J. Algorithms, 7, 60-78.
21. Knuth, D. E. (1991). Notes on efficient representation of permutation groups. Combinatorica, 11, 57-68.
22. Krishnamurthy, B. (1985). Short proofs for tricky formulas. Acta Informatica, 22(3), 253-275.
23. Li, C. M. (2000). Integrating equivalency reasoning into Davis-Putnam procedure. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 291-296.
24. Luks, E. M. (1993). Permutation Groups and Polynomial-Time Computation, Vol. 11 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 139-175. Amer. Math. Soc.
25. McIver, A., & Neumann, P. (1987). Enumerating finite groups. Quart. J. Math., 38(2), 473-488.
26. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference.
27. Nemhauser, G., & Wolsey, L. (1988). Integer and Combinatorial Optimization. Wiley, New York.
28. Pudlak, P. (1997). Lower bounds for resolution and cutting planes proofs and monotone computations. J. Symbolic Logic, 62(3), 981-998.
29. Pyber, L. (1993). Enumerating finite groups of given order. Ann. Math., 137, 203-220.
30. Rotman, J. J. (1994). An Introduction to the Theory of Groups. Springer.
31. Savelsbergh, M. W. P. (1994). Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing, 6, 445-454.
32. Seress, A. (2003). Permutation Group Algorithms, Vol. 152 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, UK.
33. Szeider, S. (2003). The complexity of resolution with generalized symmetry rules. In Alt, H., & Habib, M. (Eds.), Proceedings of STACS03, volume 2607 of Springer Lecture Notes in Computer Science, pp. 475-486.
34. Tseitin, G. (1970). On the complexity of derivation in propositional calculus. In Slisenko, A. (Ed.), Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 466-483. Consultants Bureau.
35. Zhang, H., &: Stickel, M. E. (2000). Implementing the Davis-Putnam method. Journal of Automated Reasoning, 24(1/2), 277-296.