Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency

Information Processing Letters

Volumn 84, Issue 3, 2002, Pages 147-151

  Kleine Büning, Hans ^a   Zhao, Xishun ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Algorithms; Formula homomorphism; Minimal unsatisfiability; Propositional Logic

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; FORMAL LOGIC; PROBLEM SOLVING; THEOREM PROVING;

FORMULA HOMOMORPHISM;

POLYNOMIALS;

EID: 0037110723     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00267-3     Document Type: Article

References (6)

1. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
2. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
3. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
4. A perspective on certain polynomial time solvable classes of satisfiability
5. On some subclasses of minimal unsatisfiable formulas
6. Homomorphisms of conjunctive normal form