Complete Boolean satisfiability solving algorithms based on local search
DOI10.1007/S11390-013-1326-4zbMATH Open1280.68241OpenAlexW2094668451MaRDI QIDQ2434568FDOQ2434568
Authors: Wensheng Guo, William N. N. Hung, Xiaoyu Song, Guowu Yang 
Publication date: 6 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-013-1326-4
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- SATzilla: portfolio-based algorithm selection for SAT
- Solving SAT and SAT Modulo Theories
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Title not available (Why is that?)
- Two Hardness Results on Feedback Vertex Sets
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Many hard examples in exact phase transitions
- Title not available (Why is that?)
- A note on treewidth in random graphs
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Title not available (Why is that?)
- Adaptive channel and power allocation of downlink multi-user MC-CDMA systems
- Cross-layer packet scheduling for downlink multiuser OFDM systems
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
Cited In (6)
Uses Software
This page was built for publication: Complete Boolean satisfiability solving algorithms based on local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434568)
