Decomposing SAT Instances with Pseudo Backbones
From MaRDI portal
Publication:3304190
DOI10.1007/978-3-319-55453-2_6zbMath1453.68170OpenAlexW2594250657MaRDI QIDQ3304190
Darrell Whitley, Wen-Xiang Chen
Publication date: 5 August 2020
Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55453-2_6
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Computer-aided proof of Erdős discrepancy properties
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Partition-based logical reasoning for first-order and propositional theories
- Visualizing SAT instances and runs of the DPLL algorithm
- Partition Crossover for Pseudo-Boolean Optimization
- Using Community Structure to Detect Relevant Learnt Clauses
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Determining computational complexity from characteristic ‘phase transitions’
- Computer Solutions of the Traveling Salesman Problem
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Bounded model checking using satisfiability solving
This page was built for publication: Decomposing SAT Instances with Pseudo Backbones
