Partitioning methods for satisfiability testing on large formulas

DOI10.1007/3-540-61511-3_126zbMath1412.68252OpenAlexW1629106946MaRDI QIDQ4647562

Tai Joon Park, Allen van Gelder

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_126

Mathematics Subject Classification ID

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

Related Items

Partition-based logical reasoning for first-order and propositional theories ⋮ Partitioning methods for satisfiability testing on large formulas

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Directed hypergraphs and applications
• Algorithms for testing the satisfiability of propositional formulae
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving