The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

Annals of Mathematics and Artificial Intelligence

Volumn 43, Issue 1-4, 2005, Pages 113-127

  Kleine Büning, Hans ^a   Xu, Daoyun ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b GUIZHOU UNIVERSITY   (China)

Author keywords

complexity; graph isomorphism; homomorphism; minimal unsatisfiable formula; renaming

Indexed keywords

EID: 10344254355     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-004-9422-3     Document Type: Article

References (10)

1. R. Aharoni, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, Journal of Combinatorial Theory, Series A 43 (1996) 196-204.
2. 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 (1998) 229-245.
3. H. Fleischner, O. Kullmann and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference, Theoretical Computer Science 289 (2002) 503-516.
4. P. Hell and J. Nešetřil, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B 48 (1990) 92-110.
5. 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 (2002) 147-151.
6. J. Köbler, U. Schöning and J. Toran, The Graph Isomorphism Problem: Its Structural Complexity (Birkhäuser, 1993).
7. B. Krishnamurthy, Short proofs for tricky formulas, Acta Informatica 22 (1985) 253-275.
8. C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Sciences 37 (1988) 2-13.
9. S. Szeider, Homomorphisms of conjunctive normal forms, Discrete Applied Mathematics 130 (2003) 351-365.
10. A. Urquhart, The symmetry rule in prepositional logic, Discrete Applied Mathematics 96-97 (1999) 177-193.