Circuit Based Encoding of CNF Formula

DOI10.1007/978-3-540-72788-0_5zbMath1214.68341OpenAlexW1557933505MaRDI QIDQ3612453

Lakhdar Saïs, Gilles Audemard

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_5

Mathematics Subject Classification ID

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

Related Items (1)

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

Uses Software

• Unnamed Item

This page was built for publication: Circuit Based Encoding of CNF Formula