Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical D P -complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+ k clauses can be recognized in time n O(k) . We imp...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 69; no. 4; pp. 656 - 674
Main Author:	Szeider, Stefan
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.2004
Subjects:	Bipartite matching DP-complete problem Expansion Fixed-parameter complexity Minimal unsatisfiability SAT problem Tree-width Tree-width Fixed-parameter complexity SAT problem Minimal unsatisfiability Bipartite matching Expansion D P -complete problem
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!