论文信息 - Variable and Term Removal From Boolean Formulae

Variable and Term Removal From Boolean Formulae

Abstract Given a Boolean formula in disjunctive normal form, the variable deletion control set problem consists in finding a minimum cardinality set of variables whose deletion from the formula results in a DNF satisfying some prescribed property. Similar problems can be defined with respect to the fixation of variables or the deletion of terms in a DNF. In this paper, we investigate the complexity of such problems for a broad class of DNF properties.

[1] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[2] Harry R. Lewis,et al. Renaming a Set of Clauses as a Horn Set , 1978, JACM.

[3] D. J. Hand,et al. Artificial intelligence , 1981, Psychological Medicine.

[4] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[5] Saburo Muroga,et al. Threshold logic and its applications , 1971 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Giorgio Gallo,et al. Algorithms for Testing the Satisfiability of Propositional Formulae , 1989, J. Log. Program..

[8] Michael E. Saks,et al. A Complexity Index for Satisfiability Problems , 1994, IPCO.

[9] John N. Hooker,et al. Detecting Embedded Horn Structure in Propositional Logic , 1992, Inf. Process. Lett..

[10] Endre Boros,et al. Recognition of q-Horn Formulae in Linear Time , 1994, Discret. Appl. Math..

[11] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.

[12] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[13] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[14] Report on a Sat Competition Report on a Sat Competition , 1992 .