Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Tree clustering for constraint networks (research note)
Artificial Intelligence
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Using SAT for combinational equivalence checking
Proceedings of the conference on Design, automation and test in Europe
A machine program for theorem-proving
Communications of the ACM
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
A comparison of structural CSP decomposition methods
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Journal of Symbolic Computation
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Satisfiability-Based Detailed FPGA Routing
VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Accelerated SAT-based Scheduling of Control/Data Flow Graphs
ICCD '02 Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Event Calculus Reasoning Through Satisfiability
Journal of Logic and Computation
Network configuration management via model finding
LISA '05 Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19
Exploiting hypergraph partitioning for efficient Boolean satisfiability
HLDVT '04 Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International
Fast SAT-based answer set solver
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Diagnosis of discrete-event systems using satisfiability algorithms
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A structure-based variable ordering heuristic for SAT
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Structural abstraction of software verification conditions
CAV'07 Proceedings of the 19th international conference on Computer aided verification
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
Attacking Bivium using SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Applications of SAT solvers to cryptanalysis of hash functions
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Combinational test generation using satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or probabilistic reasoning. The depth-first search DPLL procedure is in practice the most efficient complete algorithm to date. Previous studies have shown the theoretical and experimental advantages of decomposing propositional formulas to guide the ordering of variable instantiation in DPLL. However, in practice, the computation of a tree decomposition may require a considerable amount of time and space on large formulas; existing decomposition tools are unable to handle most currently challenging SAT instances because of their size. In this paper, we introduce a simple, fast and scalable method to quickly produce tree decompositions of large SAT problems. We show experimentally the efficiency of orderings derived from these decompositions on the solving of challenging benchmarks.