Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF We consider the minimal unsatisfiability problem for propositional formulas over n variables with n+k clauses for fixedk. We will show that in case of at most n clauses no formula is minimal unsatisfiable. For n+1 clauses the minimal unsatisfiability problem is solvable in quadratic time. Further, we present a characterization of minimal unsatisfiable formulas with n+1clauses in terms of a certain form of matrices. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

Loading next page...
 
/lp/springer-journals/an-efficient-algorithm-for-the-minimal-unsatisfiability-problem-for-a-3yCBp07K2G

References (7)

Publisher
Springer Journals
Copyright
Copyright © 1998 by Kluwer Academic Publishers
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/A:1018924526592
Publisher site
See Article on Publisher Site

Abstract

We consider the minimal unsatisfiability problem for propositional formulas over n variables with n+k clauses for fixedk. We will show that in case of at most n clauses no formula is minimal unsatisfiable. For n+1 clauses the minimal unsatisfiability problem is solvable in quadratic time. Further, we present a characterization of minimal unsatisfiable formulas with n+1clauses in terms of a certain form of matrices.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Sep 17, 2004

There are no references for this article.