Partitioning methods for satisfiability testing on large formulas

DOI10.1006/inco.1999.2860zbMath1003.68148OpenAlexW1970590090MaRDI QIDQ1854377

Tai Joon Park, Allen van Gelder

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2860

Mathematics Subject Classification ID

Related Items (1)

Visualizing SAT instances and runs of the DPLL algorithm

Cites Work

• Directed hypergraphs and applications
• Algorithms for testing the satisfiability of propositional formulae
• Partitioning methods for satisfiability testing on large formulas
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Unnamed Item

This page was built for publication: Partitioning methods for satisfiability testing on large formulas