How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms

DOI10.1007/978-3-642-21581-0_10zbMath1331.68114OpenAlexW2259879680MaRDI QIDQ3007677

Martin Mundhenk, Robert Zeranski

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Unnamed Item

Uses Software

• Sat4j

Cites Work

• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• The computation of hitting sets: Review and new algorithms
• Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
• An Efficient Algorithm for the Transversal Hypergraph Generation
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• NP-completeness: A retrospective
• New Results on Monotone Dualization and Generating Hypergraph Transversals
• Mathematical Foundations of Computer Science 2003
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms