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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 69; H. 4; S. 656 - 674
1. Verfasser:	Szeider, Stefan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.12.2004
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!