Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets

Discrete Applied Mathematics

Volumn 130, Issue 2, 2003, Pages 209-249

  Kullmann, Oliver ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Autarky; Conjunctive normal form; Deficiency; Lean clause set; Linear autarky; Linear programming; Matching theory; Polynomial time; Propositional satisfiability problem; Qualitative matrix analysis; Resolution

Indexed keywords

LINEAR PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS;

LEAN CLAUSE-SETS;

SET THEORY;

EID: 0041511844     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00406-7     Document Type: Conference Paper

References (60)

1. Aharoni R., Linial N. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A. 43:1986;196-204.
2. Aigner M. Kombinatorik; Teil II: Matroide und Transversaltheorie. 1976;Springer, Berlin.
3. E.D. Andersen, K.D. Andersen, The XPRESS interior point optimizer for linear programming: an implementation of the homogeneous algorithm, in: J.B.G. Frenk, C. Roos, T. Terlaky, S. Zhang (Eds.), High Performance Optimization Techniques, Proceedings of the HPOPT-II Conference, 1997.
4. A. Bachem, W. Kern, Linear Programming Duality: An Introduction to Oriented Matroids, Universitext. Springer, Berlin, 1992.
5. Boros E., Crama Y., Hammer P.L. Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. Artif. Intell. 1:1990;21-32.
6. Boros E., Crama Y., Hammer P.L., Saks M. A complexity index for satisfiability problems. SIAM J. Comput. 23(1):1994;45-49.
7. Boros E., Hammer P.L., Sun X. Recognition of q-Horn formulae in linear time. Discrete Appl. Math. 55:1994;1-13.
8. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. Encyclopedia of Mathematics and its Applications. Vol. 39:1991;Cambridge University, Cambridge.
9. Brualdi R.A., Shader B.L. Matrices of Sign-Solvable Linear Systems. Cambridge Tracts in Mathematics. Vol. 116:1995;Cambridge University, Cambridge.
10. Kleine Büning H. On generalized Horn formulas and. k -resolution Theoret. Comput. Sci. 116:1993;405-413.
11. Kleine Büning H. An upper bound for minimal resolution refutations. Gottlob G., Grandjean E., Seyr K. Computer Science Logic 12th International Workshop, CSL'98. Lecture Notes in Computer Science. Vol. 1584:1999;171-178 Springer, Berlin.
12. Kleine Büning H. On subclasses of minimal unsatisfiable formulas. Discrete Appl. Math. 107:2000;83-98.
13. H. Kleine Büning, X. Zhao, The complexity of read-once resolution, Ann. Math. Artif. Intell., to appear.
14. Dalal M., Etherington D.W. A hierarchy of tractable satisfiability problems. Inform. Process. Lett. 44:1992;173-180.
15. Davydov G.V., Davydova I.V. Tautologies and positive solvability of linear homogeneous systems. Ann. Pure Appl. Logic. 57:1992;27-43.
16. Davydov G.V., Davydova I.V., Kleine Büning H. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell. 23:1998;229-245.
17. Davydov G.V., Davydova I.M. Number representations of satisfiability. J. Math. Sci. 98(4):2000;464-477. (A Translation of Selected Russian-Language Serial Publications in Mathematics).
18. Fleischner H., Kullmann O., Szeider S. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoret. Comput. Sci. 289(1):2002;503-516.
19. H. Fleischner, S. 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.
20. T. Fliti, G. Reynaud, Sizes of minimally unsatisfiable conjunctive normal forms, Faculté des Sciences de Luminy, Dpt. Mathematique-Informatique, 13288 Marseille, France, November 1994.
21. Franco J., Gelder A.V. A perspective on certain polynomial time solvable classes of satisfiability. Discrete Appl. Math. 125(2,3):2003;177-214.
22. Gallo G., Scutellà M.G. Polynomially solvable satisfiability problems. Inform. Process. Lett. 29:1988;221-227.
23. Van Gelder A. Autarky pruning in propositional model elimination reduces failure redundancy. J. Autom. Reason. 23(2):1999;137-193.
24. Gordan P. Ueber die Auflösung linearer Gleichungen mit reellen Coeffizienten. Mathemat. Annal. 6:1873;23-28.
25. Hirsch E. New worst-case upper bounds for SAT. J. Autom. Reason. 24(4):2000;397-420.
26. G. Huet, Confluent reductions: Abstract properties and applications to term rewriting systems, in: 18th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1977, pp. 30-45.
27. H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Proceedings KR-96.
28. H. Kautz, B. Selman, Pushing the envelope: planning, propositional logic, and stochastic search, in: Proceedings AAAI-96.
29. H. Kautz, B. Selman, SAT-encoded logistics planning problems, From the problem collection Internet site SATLIB; see http://www.satlib.org. Documentation for the 4 problem instances logistics.a-logistics.d.
30. Klee V., Ladner R., Manber R. Signsolvability revistied. Linear Algebra Appl. 59:1984;131-157.
31. O. Kullmann, Heuristics for SAT algorithms: a systematic study, in: SAT'98, March 1998. Extended abstract for the Second Workshop on the Satisfiability Problem, May 10-14, 1998, Eringerfeld, Germany.
32. O. Kullmann, Heuristics for SAT algorithms: searching for some foundations, Manuscript 23pp., based on [31] (data for satisfiable instances has been included September 1999); the ps-file is available from http://www.cs-srv1.swan.ac.uk/̃csoliver/, September 1998.
33. O. 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.
34. Kullmann O. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223(1-2):1999;1-72.
35. Kullmann O. On a generalization of extended resolution. Discrete Appl. Math. 96-97(1-3):1999;149-176.
36. O. Kullmann, An application of matroid theory to the SAT problem, in: 15th Annual IEEE Conference of Computational Complexity, IEEE Computer Society, Silver Spring, MD, July 2000, pp. 116-124. See also TR00-018, Electronic Colloquium on Computational Complexity (ECCC), March 2000.
37. Kullmann O. Investigations on autark assignments. Discrete Appl. Math. 107:2000;99-137.
38. O. Kullmann, The SAT solver OKsolver, implemented in C. Available at http://cs-svr1.swan.ac.uk/̃csoliver/OKsolver.html, May 2000. Version 1.0, Release 0.91.
39. O. Kullmann, Some general considerations on heuristics, and the SAT solver "OKsolver", September 2000, in preparation.
40. O. Kullmann, On the use of autarkies for satisfiability decision, in: H. Kautz, B. Selman (Eds.), LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), Electronic Notes in Discrete Mathematics (ENDM), Vol. 9, Elsevier Science, Amsterdam, June 2001.
41. O. Kullmann, H. Luckhardt, Deciding propositional tautologies: Algorithms and their complexity. Preprint, 82pp; the ps-file can be obtained at http://cs-svr1.swan.ac.uk/̃csoliver, January 1997.
42. O. Kullmann, H. Luckhardt, Algorithms for SAT/TAUT decision based on various measures, Preprint, 71pp; the ps-file can be obtained from http://cs-svr1.swan.ac.uk/̃csoliver , December 1998.
43. Lee G.-Y., Shader B.L. Sign-consistency and solvability of constrained linear systems. The Electron. J. Linear Algebra. 4:1998;1-18. http://math.technion.ac.il/iic/ela.
44. Lovász L., Plummer M.D. Matching Theory. Mathematics Studies. Vol. 121:1986;North-Holland, Amsterdam.
45. H. Luckhardt, Obere Komplexitätsschranken für TAUT-Entscheidungen, in: Frege Conference 1984, Schwerin, Akademie-Verlag, Berlin, 1984, pp. 331-337.
46. n steps Discrete Appl. Math. 10:1985;287-295.
47. Newman M.H.A. On theories with a combinatorial definition of "equivalence" Ann. Math. 43:1942;223-243.
48. Okushi F. Parallel cooperative propositional theorem proving. Ann. Math. Artif. Intell. 26:2000;59-85.
49. Oxley J.G. Matroid Theory. 1992;Oxford University Press, Oxford.
50. Papadimitriou C.H., Wolfe D. The complexity of facets resolved. J. Comput. System Sci. 37:1988;2-13.
51. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, Chichester.
52. Shaohan M., Dongmin L. A polynomial-time algorithm for reducing the number of variables in MAX SAT problem. Sci. China (Series E). 40(3):1997;301-311.
53. Singer J., Gent I.P., Smaill A. Backbone fragility and the local search cost peak. J. Artif. Intell. Res. 12:2000;235-270.
54. Szeider S. NP-completeness of refutability by literal-once resolution. Gore R., Leitsch A., Nipkow T. IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning. Lecture Notes in Artificial Intelligence. Vol. 2083:2001;168-181 Springer, Berlin.
55. J. Torán, July 2000. Personal communication.
56. G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A.O. Slisenko (Ed.), Seminars in Mathematics, Vol. 8. V.A. Steklov Mathematical Institute, Leningrad, 1968. English translation: Studies in Mathematics and Mathematical Logic, Part II, 1970, pp. 115-125.
57. G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A.O. Slisenko (Ed.), Seminars in Mathematics, Vol. 8. V.A. Steklov Mathematical Institute, Leningrad, 1968. English translation: Studies in Mathematics and Mathematical Logic, Part II, 1970, pp. 115-125.
58. van Maaren H. A short note on some tractable cases of the satisfiability problem. Inform. Comput. 158(2):2000;125-130.
59. van Maaren H., Warners J. Solving satisfiability problems using elliptic approximations - effective branching rules. Discrete Appl. Math. 107:2000;241-259.
60. Xishun Z., Decheng D. Two tractable subclasses of minimal unsatisfiable formulas. Sci. China (Series A). 42(7):1999;720-731.