Satisfiability Checking of Non-clausal Formulas Using General Matings

DOI10.1007/11814948_10zbMATH Open1187.68549OpenAlexW1839246176MaRDI QIDQ5756567FDOQ5756567

Authors: Himanshu Jain, Constantinos Bartzis, Edmund 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

Recommendations

• A satisfiability tester for non-clausal propositional calculus
• scientific article; zbMATH DE number 3870637
• Satisfiability checking: theory and applications
• Satisfiability checking and symbolic computation
• Formal verification of a generic framework to synthesize SAT-provers
• scientific article; zbMATH DE number 1099516
• Satisfiability of mixed Horn formulas
• The problem of checking the satisfiability of formulae of decidable theories (survey)
• scientific article; zbMATH DE number 1688350
• Logic for Programming, Artificial Intelligence, and Reasoning

Mathematics Subject Classification ID

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

Cited In (5)

• MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
• A View from the Engine Room: Computational Support for Symbolic Model Checking
• A first polynomial non-clausal class in many-valued logic
• Formula normalizations in verification
• Principles and Practice of Constraint Programming – CP 2004

Uses Software

• SATO
• Chaff
• BerkMin

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

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