The Complexity of Checking Redundancy of CNF Propositional Formulae

A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its clauses: what results is an irredundant equivalent subset (I.E.S.) We study the complexity of some related problems: verification, checking existence of a I.E.S. with a given size, checking necessary and possible presence of clauses in I.E.S.'s, and uniqueness.

[1]  Peter L. Hammer,et al.  Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation , 1993, Artif. Intell..

[2]  Francesco M. Donini,et al.  Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..

[3]  Allen Ginsberg.  Knowledge-Base Reduction: A New Approach to Checking knowledge Bases for Inconsistency and Redundancy , 1988, AAAI.

[4]  Francesco M. Donini,et al.  The Size of a Revised Knowledge Base , 1999, Artif. Intell..

[5]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[6]  Wayne Snyder,et al.  Detecting Redundant Production Rules , 1997, AAAI/IAAI.

[7]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[8]  Bernhard Nebel,et al.  Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.

[9]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[10]  Edith Hemaspaandra,et al.  The minimization problem for Boolean formulas , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[11]  Georg Gottlob,et al.  Removing Redundancy from a Clause , 1993, Artif. Intell..

[12]  Giorgio Ausiello,et al.  Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..

[13]  Christopher Umans.  The Minimum Equivalent DNF Problem and Shortest Implicants , 2001, J. Comput. Syst. Sci..

[14]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[15]  Georg Gottlob.  NP trees and Carnap's modal logic , 1995, JACM.

[16]  David Maier.  Minimum Covers in Relational Database Model , 1980, JACM.