Satisfiability Checking of Non-clausal Formulas Using General Matings

DOI10.1007/11814948_10zbMath1187.68549OpenAlexW1839246176MaRDI QIDQ5756567

Constantinos Bartzis, Himanshu Jain, Edmund M. Clarke

Publication date: 4 September 2007

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

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

Mathematics Subject Classification ID

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

Related Items (4)

A first polynomial non-clausal class in many-valued logic ⋮ A View from the Engine Room: Computational Support for Symbolic Model Checking ⋮ Formula normalizations in verification ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures

Uses Software

• SATO
• Chaff
• BerkMin

This page was built for publication: Satisfiability Checking of Non-clausal Formulas Using General Matings