Towards an efficient tableau method for Boolean circuit satisfiability checking

DOI10.1007/3-540-44957-4_37MaRDI QIDQ2767086zbMATH OpenFDO

Authors Tommi Junttila, Ilkka Niemelä

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_37

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1903342
• scientific article; zbMATH DE number 2090309
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• Satisfiability checking using Boolean expression diagrams
• scientific article; zbMATH DE number 1796122
• Tools and Algorithms for the Construction and Analysis of Systems
• Characterizing Propagation Methods for Boolean Satisfiability
• Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems

Cited in

(6)

• Limitations of restricted branching in clause learning
• Bounded synthesis for Petri games
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• scientific article; zbMATH DE number 1790379 (Why is no real title available?)
• New and improved bounds on the contextuality degree of multi-qubit configurations
• Unrestricted vs restricted cut in a tableau method for Boolean circuits

Describes a project that uses

Uses Software

• SATO

This page was built for publication: Towards an efficient tableau method for Boolean circuit satisfiability checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767086)