On the use of autarkies for satisfiability decision

Electronic Notes in Discrete Mathematics

Volumn 9, Issue , 2001, Pages 231-253

  Kullmann, Oliver ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Autarky; Conjunctive normal form; Constraint satisfaction problem; Deficiency; Matching theory; Polynomial time; Qualitative matrix analysis; Resolution; The operation of a monoid on an ordered set

Indexed keywords

EID: 34247099439     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00325-7     Document Type: Article

References (32)

1. Andrew B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, March 1995. The ps-file can be down loaded using the URL http://www.cirl.uoregon.edu/baker/thesis.ps.gz.
2. Endre Boros, Y. Crama, and Peter L. Hammer. Polynomial-time inference of all valid implications for Horn and related formulae. Annals of Mathematics and Artificial Intelligence, 1:21-32, 1990.
3. Endre Boros, Y. Crama, Peter L. Hammer, and M. Saks. A complexity index for satisfiability problems. SIAM Journal on Computing, 23(1):45-49, February 1994.
4. Endre Boros, Peter L. Hammer, and Xiaorong Sun. Recognition of q-Horn formulae in linear time. Discrete Applied Mathematics, 55:1-13, 1994.
5. Nicolas Bourbaki. Algebra I: Chapters 1-3. Elements of Mathematics. Springer-Verlag, 1989.
6. Richard A. Brualdi and Herbert J. Ryser. Combinatorial Matrix Theory, volume 39 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1991.
7. Richard A. Brualdi and Bryan L. Shader. Matrices of sign-solvable linear systems, volume 116 of Cambridge Tracts in Mathematics. Cambridge University Press, 1995.
8. Hans Kleine Büning. On generalized Horn formulas and k-resolution. Theoretical Computer Science, 116:405-413, 1993.
9. Hans Kleine Büning. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 107:83-98, 2000.
10. Gennady Davydov and Inna Davydova. Tautologies and positive solvability of linear homogeneous systems. Annals of Pure and Applied Logic, 57:27-43, 1992.
11. Herbert Fleischner, Oliver Kullmann, and Stefan Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Submitted to Theoretical Computer Science, October 2000.
12. Herbert Fleischner and Stefan Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Technical Report TR00-049, Electronic Colloquium on Computational Complexity (ECCC), July 2000.
13. John Franco and Allen Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability. To appear in Discrete Applied Mathematics, 2001.
14. Giorgio Gallo and Maria Grazia Scutellà. Polynomially solvable satisfiability problems. Information Processing Letters, 29:221-227, November 1988.
15. Allen Van Gelder. Autarky pruning in propositional model elimination reduces failure redundancy. Journal of Automated Reasoning, 23(2):137-193, 1999.
16. Edward Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4):397-420, 2000.
17. Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. In 18th Annual Symposium on Foundations of Computer Science, pages 30-45. IEEE, 1977.
18. Oliver Kullmann. Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs. Technical Report TR99-041, Electronic Colloquium on Computational Complexity (ECCC), October 1999.
19. Oliver Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, July 1999.
20. Oliver Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference of Computational Complexity, pages 116-124. IEEE Computer Society, July 2000. See also TR00-018, Electronic Colloquium on Computational Complexity (ECCC), March 2000.
21. Oliver Kullmann. Investigations on autark assignments. Discrete Applied Mathematics, 107:99-137, 2000.
22. Oliver Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets. To appear in Discrete Applied Mathematics, June 2000.
23. Oliver Kullmann. SAT decision by adding colour to matching theory. Preprint, 10 pages; the ps-file is available from the authors home page http://www.cs.utoronto.ca/~kullmann/, August 2000.
24. Oliver Kullmann. Upper and lower bounds on the complexity of generalized resolution and constraint satisfaction problems. Submitted to Annals of Mathematics and Artificial Intelligence, September 2000.
25. Oliver Kullmann and Horst Luckhardt. Algorithms for SAT/TAUT decision based on various measures. Preprint, 71 pages; the ps-file can be obtained from http://www.cs.utoronto.ca/~kullmann/, December 1998.
26. Gwang-Yeon Lee and Bryan L. Shader. Sign-consistency and solvability of constrained linear systems. The Electronic Journal of Linear Algebra, 4:1-18, August 1998. http://math.technion.ac.il/iic/ela.
27. n steps. Discrete Applied Mathematics, 10:287-295, 1985.
28. M.H.A. Newman. On theories with a combinatorial definition of "equivalence". Annals of Mathematics, 43:223-243, 1942.
29. Fumiaki Okushi. Parallel cooperative propositional theorem proving. Annals of Mathematics and Artificial Intelligence, 26:59-85, 2000.
30. Joao P. Marques Silva and Karem A. Sakallah. GRASP - a new search algorithm for satisfiability. Technical Report CSE-TR-292-96, University of Michigan, Department of Electrical Engineering and Computer Science, 1996.
31. Hans van Maaren. A short note on some tractable cases of the satisfiability problem. Information and Computation, 158(2):125-130, May 2000.
32. Hantao Zhang. SATO: an efficient propositional prover. In Proc. of International Conference on Automated Deduction (CADE-97), 1997.