How to apply SAT-solving for the equivalence test of monotone normal forms

Authors:
Martin Mundhenk;Robert Zeranski
Affiliations:
Friedrich-Schiller-Universität Jena, Germany;Friedrich-Schiller-Universität Jena, Germany
Venue:
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Year:
2011

Citing 11
Cited 0

On the complexity of dualization of monotone disjunctive normal forms

Journal of Algorithms
A machine program for theorem-proving

Communications of the ACM
New Results on Monotone Dualization and Generating Hypergraph Transversals

SIAM Journal on Computing
NP-Completeness: A Retrospective

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Hypergraph Transversal Computation and Related Problems in Logic and AI

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

INFORMS Journal on Computing
The computation of hitting sets: review and new algorithms

Information Processing Letters
A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining border descriptions of emerging patterns from dataset pairs

Knowledge and Information Systems
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Polynomial time SAT decision, hypergraph transversals and the hermitian rank

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The equivalence problem for monotone formulae in normal form MONET is in coNP, is probably not coNP-complete [1], and is solvable in quasi-polynomial time no(log n) [2]. We show that the straightforward reduction from MONET to UnSat yields instances, on which actual Sat-solvers (SAT4J) are slower than current implementations of MONET-algorithms [3]. We then improve these implementations of MONET-algorithms notably, and we investigate which techniques from Sat-solving are useful for MONET. Finally, we give an advanced reduction from MONET to UNSAT that yields instances, on which the SAT-solvers reach running times, that seem to be magnitudes better than what is reachable with the current implementations of MONET-algorithms.