Average Case Self-Duality of Monotone Boolean Functions

The problem of determining whether a monotone boolean function is self-dual has numerous applications in Logic and AI. The applications include theory revision, model-based diagnosis, abductive explanations and learning monotone boolean functions. It is not known whether self-duality of monotone boolean functions can be tested in polynomial time, though a quasi-polynomial time algorithm exists. We describe another quasi-polynomial time algorithm for solving the self-duality problem of monotone boolean functions and analyze its average-case behaviour on a set of randomly generated instances.

[1]  Vladimir Gurvich,et al.  On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets , 2002, STACS.

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Kazuhisa Makino,et al.  On computing all abductive explanations , 2002, AAAI/IAAI.

[4]  Paul Walton Purdom,et al.  The Pure Literal Rule and Polynomial Average Time , 1985, SIAM J. Comput..

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  Vladimir Gurvich,et al.  On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions , 1999, Discret. Appl. Math..

[7]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[8]  Toshihide Ibaraki,et al.  A Theory of Coteries: Mutual Exclusion in Distributed Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[9]  Georg Gottlob,et al.  New results on monotone dualization and generating hypergraph transversals , 2002, STOC '02.

[10]  Toshihide Ibaraki,et al.  The Maximum Latency and Identification of Positive Boolean Functions , 1994, ISAAC.

[11]  Toshihide Ibaraki,et al.  Complexity of Identification and Dualization of Positive Boolean Functions , 1995, Inf. Comput..

[12]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[13]  Toshihide Ibaraki,et al.  Generating and Approximating Nondominated Coteries , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[15]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS '97.

[16]  John V. Franco,et al.  On the Probabilistic Performance of Algorithms for the Satisfiability Problem , 1986, Inf. Process. Lett..

[17]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[18]  Georg Gottlob,et al.  Hypergraph Transversal Computation and Related Problems in Logic and AI , 2002, JELIA.

[19]  Toshihide Ibaraki,et al.  Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle , 1997, SIAM J. Comput..

[20]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[21]  Edward J. Coyle,et al.  Stack filters , 1986, IEEE Trans. Acoust. Speech Signal Process..

[22]  Toshihide Ibaraki,et al.  Decompositions of positive self-dual boolean functions , 1995, Discret. Math..

[23]  Kenneth E. Barner,et al.  C-stack filters , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[24]  Ramesh Krishnamurti,et al.  Self-Duality of Bounded Monotone Boolean Functions and Related Problems , 2000, ALT.

[25]  Leonard Pitt,et al.  Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries , 1999, Machine Learning.

[26]  Paul Walton Purdom,et al.  Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..

[27]  Kazuhisa Makino.  Efficient dualization of O(log n)-term monotone disjunctive normal forms , 2003, Discret. Appl. Math..

[28]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[29]  Dimitrios Gunopulos,et al.  Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.

[30]  Leonid Khachiyan,et al.  On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.