Partitioning methods for satisfiability testing on large formulas

Authors:
Tai Joon Park;Allen Van Gelder
Affiliations:
Computer Science Department, University of California, Santa Cruz, California;Computer Science Department, University of California, Santa Cruz, California
Venue:
Information and Computation
Year:
2000

Decomposition strategies for configuration problems

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Visualizing SAT Instances and Runs of the DPLL Algorithm

Journal of Automated Reasoning
Symmetric component caching

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
JaCk-SAT: a new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
DPvis: a tool to visualize the structure of SAT instances

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Community-Based partitioning for MaxSAT solving

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Computing interpolants without proofs

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing

Hi-index	0.00