Minimal unsatisfiability and autarkies

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 339-401

  Kleine Büning, Hans ^a   Kullmann, Oliver ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; BOOLEAN FUNCTIONS; GRAPH THEORY; LINEAR PROGRAMMING;

COMBINATORICS; MINIMAL UNSATISFIABLE FORMULAS; PROBLEM INSTANCES; PROOF CALCULUS; PROPERTY; PROPOSITIONAL FORMULAS; QUANTIFIED BOOLEAN FORMULAS; SAT PROOFS; SAT SOLVERS; UNSATISFIABLE FORMULAS;

REDUNDANCY;

EID: 72949123742     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-339     Document Type: Article

References (94)

1. R. Aharoni and N. Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. Journal of Combinatorial Theory, A 43:196-204, 1986.
2. A. Biere and C. P. Gomes, editors. Theory and Applications of Satisfiability Testing -SAT 2006, volume 4121 of Lecture Notes in Computer Science. Springer, 2006. ISBN 3-540-37206-7.
3. A. Bachem and W. Kern. Linear Programming Duality: An Introduction to Oriented Matroids. Universitext. Springer-Verlag, Berlin, 1992. ISBN 3-540-55417-3.
4. N. Bourbaki. Algebra I: Chapters 1-3. Elements of Mathematics. Springer-Verlag, Berlin, 1989. Second printing, ISBN 3-540-19373-1.
5. R. A. Brualdi and H. J. Ryser. Combinatorial Matrix Theory, volume 39 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1991. ISBN 0-521-32265-0.
6. R. Bruni. Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics, 130:85-100, 2003.
7. R. Bruni. On exact selection of minimally unsatisfiable subformulae. Annals for Mathematics and Artificial Intelligence, 43:35-50, 2005.
8. R. A. Brualdi and B. L. Shader. Matrices of sign-solvable linear systems, volume 116 of Cambridge Tracts in Mathematics. Cambridge University Press, 1995. ISBN 0-521-48296-8.
9. R. Bruni and A. Sassano. Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae. In H. Kautz and B. Selman, editors, LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics (ENDM). Elsevier Science, June 2001.
10. F. Bacchus and T. Walsh, editors. Theory and Applications of Satisfiability Testing 2005, volume 3569 of Lecture Notes in Computer Science, Berlin, 2005. Springer. ISBN 3-540-26276-8.
11. G. Davydov and I. Davydova. Tautologies and positive solvability of linear homogeneous systems. Annals of Pure and Applied Logic, 57:27-43, 1992.
12. G. Davydov, I. Davydova, and H. Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 23:229-245, 1998.
13. M. Dalal and D. W. Etherington. A hierarchy of tractable satisfiability problems. Information Processing Letters, 44:173-180, 1992.
14. S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal Computing, 5(4):691-703, 1976.
15. H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 289(1):503-516, November 2002.
16. J. Franco, M. Kouril, J. Schlipf, S. Weaver, M. Dransfield, and W. M. Vanfleet. Function-complete lookahead in support of efficient SAT search heuristics. Journal of Universal Computer Science, 10(12):1655-1692, 2004.
17. M. R. Fellows, S. Szeider, and G. Wrightson. On finding short resolution refutations and small unsatisfiable subsets. Theoretical Computer Science, 351(3):351-359, 2006.
18. J. Franco and A. Van Gelder. A perspective on certain polynomialtime solvable classes of satisfiability. Discrete Applied Mathematics, 125:177-214, 2003.
19. N. Galesi and O. Kullmann. Polynomial time SAT decision, hypergraph transversals and the hermitian rank. In H. H. Hoos and D. G. Mitchell, editors, Theory and Applications of Satisfiability Testing 2004, volume 3542 of Lecture Notes in Computer Science, pages 89-104, Berlin, 2005. Springer. ISBN 3-540-27829-X.
20. É. Gŕegoire, B. Mazure, and C. Piette. Tracking MUSes and strict inconsistent covers. In Proceedings of the Formal Methods in Computer Aided Design (FMCAD), pages 39-46. IEEE Computer Society, 2006.
21. É. Gŕegoire, B. Mazure, and C. Piette. Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In M. M. Veloso, editor, Proceedings of IJCAI, pages 2300-2305, 2007.
22. É. Gŕegoire, B. Mazure, and C. Piette. MUST: Provide a finer-grained explanation of unsatisfiability. In Principles and Practice of Constraint Programming (CP), pages 317-331, 2007.
23. E. Giunchiglia and A. Tacchella, editors. Theory and Applications of Satisfiability Testing 2003, volume 2919 of Lecture Notes in Computer Science, Berlin, 2004. Springer. ISBN 3-540-20851-8.
24. E. Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4):397-420, 2000.
25. M. Henderson and O. Kullmann. Multiclique partitions of multigraphs, and conflict-regular satisfiability problems with non-boolean variables. In preparation, August 2008.
26. S. Hoory and S. Szeider. Computing unsatisfiable k-SAT instances with few occurrences per variable. Theoretical Computer Science, 337:347-359, 2005.
27. S. Hoory and S. Szeider. A note on unsatisfiable k-CNF formulas with few occurrences per variable. SIAM Journal on Discrete Mathematics, 20(2):523-528, 2006.
28. M. J. Heule and H. van Maaren. Parallel SAT solving using bit-level operations. Journal on Satisfiability, Boolean Modeling and Computation, 4:99-116, 2008.
29. K. Iwama and E. Miyano. Intractability of read-once resolution. In Proceedings Structure in Complexity Theory, Tenth Annual Conference, pages 29-36. IEEE, 1995.
30. K. Iwama. CNF satisfiability test by counting and polynomial average time. SIAM Journal on Computing, 18(2):385-391, April 1989.
31. T. R. Jensen and B. Toft. Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, 1995. ISBN 0-471-02865-7.
32. H. Kleine Büning. An upper bound for minimal resolution refutations. In G. Gottlob, E. Grandjean, and K. Seyr, editors, Computer Science Logic 12th International Workshop, CSL'98, volume 1584 of Lecture Notes in Computer Science, pages 171-178. Springer, 1999.
33. H. Kleine Büning. On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics, 107:83-98, 2000.
34. H. Kleine Büning and T. Lettmann. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999.
35. H. Kleine Büning and X. Zhao. Minimal unsatisfiability: Results and open questions. Technical Report tr-ri-02-230, Series Computer Science, University of Paderborn, University of Paderborn, Department of Mathematics and Computer Science, 2002. wwwcs.uni-paderborn.de/cs/ag-klbue/de/research/MinUnsat/ .
36. O. Kullmann and H. Luckhardt. Deciding propositional tautologies: Algorithms and their complexity. Preprint, 82 pages; the ps-file can be obtained at http://cs.swan.ac.uk/?csoliver/, January 1997.
37. O. Kullmann and H. Luckhardt. Algorithms for SAT/TAUT decision based on various measures. Preprint, 71 pages; the ps-file can be obtained from http://cs.swan.ac.uk/?csoliver/, December 1998.
38. O. Kullmann, I. Lynce, and J. P. Marques-Silva. Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable subclause-sets and the lean kernel. In Biere and Gomes [BG06], pages 22-35. ISBN 3-540-37206-7.
39. O. Kullmann, V. W. Marek, and M. Truszczýnski. Computing autarkies and properties of the autarky monoid. In preparation, October 2008.
40. 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.
41. 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.
42. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, July 1999.
43. O. Kullmann. On a generalization of extended resolution. Discrete Applied Mathematics, 96-97(1-3):149-176, 1999.
44. O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference on Computational Complexity (2000), pages 116-124. IEEE Computer Society, July 2000.
45. O. Kullmann. Investigations on autark assignments. Discrete Applied Mathematics, 107:99-137, 2000.
46. O. Kullmann. On the use of autarkies for satisfiability decision. In H. Kautz and B. Selman, editors, LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics (ENDM). Elsevier Science, June 2001.
47. O. Kullmann. Investigating the behaviour of a SAT solver on random formulas. Technical Report CSR 23-2002, Swansea University, Computer Science Report Series (available from http://www-compsci.swan.ac.uk/reports/2002.html), October 2002.
48. O. Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics, 130:209-249, 2003.
49. O. Kullmann. The combinatorics of conflicts between clauses. In Giunchiglia and Tacchella [GT04], pages 426-440. ISBN 3-540-20851-8.
50. O. Kullmann. Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence, 40(3-4):303-352, March 2004.
51. O. Kullmann. Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. In N. Creignou, P. Kolaitis, and H. Vollmer, editors, Complexity of Constraints, number 06401 in Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. http://drops.dagstuhl.de/opus/volltexte/2006/803.
52. O. Kullmann. Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Technical Report TR 07-055, Electronic Colloquium on Computational Complexity (ECCC), June 2007.
53. O. Kullmann. Polynomial time SAT decision for complementationinvariant clause-sets, and sign-non-singular matrices. In J. P. Marques-Silva and K. A. Sakallah, editors, Theory and Applications of Satisfiability Testing -SAT 2007, volume 4501 of Lecture Notes in Computer Science, pages 314-327. Springer, 2007. ISBN 978-3-540-72787-3.
54. H. Kleine Büning and D. Xu. The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Annals of Mathematics and Artificial Intelligence, 43(1-4):113-127, 2005.
55. H. Kleine Büning and X. Zhao. The complexity of read-once resolution. Annals of Mathematics and Artificial Intelligence, 36(4):419-435, 2002.
56. H. Kleine Büning and X. Zhao. Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. Information Processing Letters, 84(3):147-151, November 2002.
57. H. Kleine Büning and X. Zhao. On the structure of some classes of minimal unsatisfiable formulas. Discrete Applied Mathematics, 130:185-207, 2003.
58. H. Kleine Büning and X. Zhao. Extension and equivalence problems for clause minimal formulae. Annals of Mathematics and Artificial Intelligence, 43:295-306, 2005.
59. H. Kleine Büning and X. Zhao. Minimal false quantified boolean formulas. In Biere and Gomes [BG06], pages 339-352. ISBN 3-540-37206-7.
60. H. Kleine Büning and X. Zhao. The complexity of some subclasses of minimal unsatisfiable formulas. Journal on Satisfiability, Boolean Modeling and Computation, 3:1-17, 2007.
61. H. Kleine Büning and X. Zhao. An extension of deficiency and minimal unsatisfiability of quantified boolean formulas. Journal on Satisfiability, Boolean Modeling and Computation, 3:115-123, 2007.
62. H. Kleine Büning and X. Zhao. Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theoretical Computer Science, 407(1-3):448-457, 2008.
63. H. Kleine Büning and X. Zhao, editors. Theory and Applications of Satisfiability Testing -SAT 2008, volume 4996 of Lecture Notes in Computer Science. Springer, 2008. ISBN 978-3-540-79718-0.
64. S. Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer, New York, third edition, 2002. ISBN 0-387-95385-X; QA154.3.L3 2002.
65. D. Lau. Function Algebras on Finite Sets: A Basic Course on Many-Valued Logic and Clone Theory. Springer Monographs in Mathematics. Springer, 2006. ISBN 3-540-36022-36030
66. M. H. Liffiton and K. A. Sakallah. On finding all minimally unsatisfiable subformulas. In Bacchus and Walsh [BW05], pages 173-186. ISBN 3-540-26276-8.
67. M. Liffiton and K. Sakallah. Searching for autarkies to trim unsatisfiable clause sets. In Kleine Büning and Zhao [KZ08b], pages 182-195. ISBN 978-3-540-79718-0.
68. H. Luckhardt. Obere Komplexitätsschranken für TAUT-Entscheidungen. In Frege Conference 1984, Schwerin, pages 331-337. Akademie-Verlag Berlin, 1984.
69. W. McCuaig. Ṕolya's permanent problem. The Electronic Journal of Combinatorics, 11, 2004. #R79, 83 pages.
70. M. N. Mneimneh, I. Lynce, Z. S. Andraus, J. P. Marques-Silva, and K. A. Sakallah. A branch and bound algorithm for extracting smallest minimal unsatisfiable formulas. In Bacchus and Walsh [BW05], pages 467-474. ISBN 3-540-26276-8.
71. M. Molloy. Cores in random hypergraphs and boolean formulas. Random Structures and Algorithms, 27(1):124-135, 2005.
72. B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discrete Applied Mathematics, 10:287-295, 1985.
73. F. Okushi. Parallel cooperative propositional theorem proving. Annals of Mathematics and Artificial Intelligence, 26:59-85, 2000.
74. Y. Oh, M. N. Mneimneh, Z. S. Andraus, K. A. Sakallah, and I. L. Markov. AMUSE: a minimally-unsatisfiable subformula extractor. In Proceedings of the 41st annual conference on Design automation (DAC), pages 518-523, 2004.
75. B. C. Pierce. Basic Category Theory for Computer Scientists. Foundations of Computing. The MIT Press, 1991. ISBN 0-262-66071-7.
76. C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. Journal of Computer and System Sciences, 37:2-13, 1988.
77. N. Robertson, P. D. Seymour, and R. Thomas. Permanents, Pfaffian orientations, and even directed circuits. Annals of Mathematics, 150:929-975, 1999.
78. M. Shaohan and L. Dongmin. A polynomial-time algorithm for reducing the number of variables in MAX SAT problem. Science in China (Series E), 40(3):301-311, June 1997.
79. P. D. Seymour. On the two-colouring of hypergraphs. The Quarterly Journal of Mathematics (Oxford University Press), 25:303-312, 1974.
80. P. Savicḱy and J. Sgall. DNF tautologies with a limited number of occurrences of every variable. Theoretical Computer Science, 238:495-498, 2000.
81. R. H. Sloan, B. Söŕenyi, and G. Tuŕan. On k-term DNF with the largest number of prime implicants. SIAM Journal on Discrete Mathematics, 21(4):987-998, 2007.
82. D. Scheder and P. Zumstein. How many conflicts does it need to be unsatisfiable? In Kleine Büning and Zhao [KZ08b], pages 246-256. ISBN 978-3-540-79718-0.
83. S. Szeider. NP-completeness of refutability by literal-once resolution. In R. Gore, A. Leitsch, and T. Nipkow, editors, IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning, volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181. Springer-Verlag, 2001.
84. S. Szeider. Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics, 130(2):351-365, 2003.
85. S. Szeider. Minimal unsatisfiable formulas with bounded clausevariable difference are fixed-parameter tractable. Journal of Computer and System Sciences, 69(4):656-674, 2004.
86. S. Szeider. Generalizations of matched CNF formulas. Annals of Mathematics and Artificial Intelligence, 43(1-4):223-238, 2005.
87. C. A. Tovey. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics, 8:85-89, 1984.
88. K. Truemper. Effective Logic Computation. A Wiley-Interscience Publication, 1998. ISBN 0-471-23886-4.
89. A. Van Gelder. Autarky pruning in propositional model elimination reduces failure redundancy. Journal of Automated Reasoning, 23(2):137-193, 1999.
90. H. van Maaren. A short note on some tractable cases of the satisfiability problem. Information and Computation, 158(2):125-130, May 2000.
91. A. Van Gelder and F. Okushi. A propositional theorem prover to solve planning and other problems. Annals of Mathematics and Artificial Intelligence, 26:87-112, 1999.
92. H. van Maaren and J. Warners. Solving satisfiability problems using elliptic approximations -effective branching rules. Discrete Applied Mathematics, 107:241-259, 2000.
93. H. van Maaren and S. Wieringa. Finding guaranteed MUSes fast. In Kleine Büning and Zhao [KZ08b], pages 291-304. ISBN 978-3-540-79718-0.
94. L. Zhang and S. Malik. Extracting small unsatisfiable cores from unsatisfiable Boolean formula. In Giunchiglia and Tacchella [GT04], pages 239-249. ISBN 3-540-20851-8.