Homomorphisms of conjunctive normal forms

Discrete Applied Mathematics

Volumn 130, Issue 2, 2003, Pages 351-365

  Szeider, Stefan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Autark assignment; Category; CNF formula; Homomorphism; Minimally unsatisfiable; p simulation; Proof system; Retraction; Satisfiability problem; Tree resolution

Indexed keywords

POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

HOMOMORPHISMS;

MATHEMATICAL TECHNIQUES;

EID: 0043015902     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00411-0     Document Type: Conference Paper

References (25)

1. Aharoni R., Linial N. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory, Ser. A. 43:1986;196-204.
2. Arai N.H., Urquhart A. Local symmetries in propositional logic. Dyckhoff R. Automated Reasoning with Analytic Tableaux and Related Methods (Proc. TABLEAUX 2000). Lecture Notes in Computer Science. Vol. 1847:2000;40-51 Springer, Berlin.
3. Benhamou B., Sais L. Tractability through symmetries in propositional calculus. J. Automat. Reason. 12:1994;89-102.
4. Cook S.A., Reckhow R.A. The relative efficiency of propositional proof systems. J. Symbolic Logic. 44(1):1979;36-50.
5. Davydov G., Davydova I., 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.
6. 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.
7. Franco J., Van Gelder A. A perspective on certain polynomial time solvable classes of satisfiability. Discrete Appl. Math. 125:2003;177-214.
8. M. Goldstern, Personal communication.
9. Haken A. The intractability of resolution. Theoret. Comput. Sci. 39:1985;297-308.
10. Kleine Büning H. An upper bound for minimal resolution refutations. Gottlob G., Grandjean E., Seyr K. CSL'98. Lecture Notes in Computer Science. Vol. 1584:1999;171-178 Springer, Berlin.
11. Kleine Büning H., Lettman T. Propositional Logic: Deduction and Algorithms. 1999;Cambridge University Press, Cambridge.
12. H. Kleine Büning, X. Zhao, Homomorphisms and MU(k), March 2001, unpublished manuscript.
13. Krishnamurthy B. Short proofs for tricky formulas. Acta Inform. 22:1985;253-275.
14. O. Kullmann, An application of matroid theory to the SAT problem, Fifteenth Annual IEEE Conference on Computational Complexity, 2000, pp. 116-124.
15. Kullmann O. Investigations on autark assignments. Discrete Appl. Math. 107(1-3):2000;99-137.
16. O. Kullmann, Personal communication.
17. O. Kullmann, Lean clause-sets: generalizations of minimally unsatisfiable clause-sets, Discrete Appl. Math., to appear.
18. Meltzer B. Theorem-proving for computers. some results on resolution and renaming Comput. J. 8:1966;341-343.
19. n steps Discrete Appl. Math. 10:1985;287-295.
20. Papadimitriou C.H., Wolfe D. The complexity of facets resolved. J. Comput. System Sci. 37(1):1988;2-13.
21. S. Szeider, Conjunctive normal forms with bounded deficiency, Ph.D. Thesis, University of Vienna, September 2001.
22. Szeider S. NP-completeness of refutability by literal-once resolution. Goré R., Leitsch A., Nipkow T. IJCAR 2001, Proceedings of the First International Joint Conference on Automated Reasoning. Lecture Notes in Artificial Intelligence. Vol. 2083:2001;168-181 Springer, Berlin.
23. S. Szeider, The universality of refutation by homomorphism, 2001, in preparation.
24. Urquhart A. The complexity of propositional proofs. Bull. Symbolic Logic. 1(4):1995;425-467.
25. Urquhart A. The symmetry rule in propositional logic. Discrete Appl. Math. 96/97:1999;177-193.