Clause form conversions for Boolean circuits

DOI10.1007/11527695_15MaRDI QIDQ5714750zbMATH OpenOpenAlexFDO

Authors Paul B. Jackson, Daniel Sheridan

Publication date 16 December 2005

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

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Blocked clause elimination
• Circuit Based Encoding of CNF Formula
• Simulating circuit-level simplifications on CNF
• scientific article; zbMATH DE number 5139161
• On conversions from CNF to ANF

Cited in

(8)

• Solving SAT in a distributed cloud: a portfolio approach
• On conversions from CNF to ANF
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Simulating circuit-level simplifications on CNF
• Solving satisfiability problems with preferences
• Towards better heuristics for solving bounded model checking problems
• A feature commonality-based search strategy to find high t-wise covering solutions in feature models
• On CNF conversion for SAT and SMT enumeration

Describes a project that uses

Uses Software

• Chaff
• NuSMV

This page was built for publication: Clause form conversions for Boolean circuits

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