Using stochastic local search to solve quantified Boolean formulae

DOI10.1007/B13743zbMATH Open1273.68346OpenAlexW2497660909MaRDI QIDQ5897207FDOQ5897207

Authors: Holger H. Hoos, Andrew Rowley, Kevin Smyth, Ian P. Gent 

Publication date: 2 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13743

Recommendations

• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Using SAT in QBF
• scientific article; zbMATH DE number 2119676
• Formal Methods in Computer-Aided Design

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• A heuristic survey propagation algorithm for solving QBF problems
• Approximation of Boolean functions by local search
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• Symbolic algorithmic verification of intransitive generalized noninterference
• Efficient local search for pseudo Boolean optimization
• Message passing algorithm for solving QBF using more reasoning
• Theory and Applications of Satisfiability Testing
• The Relation Between Complete and Incomplete Search
• Propagation based local search for bit-precise reasoning
• TTT plots: a perl program to create time-to-target plots

Uses Software

• Walksat
• Quaffle

This page was built for publication: Using stochastic local search to solve quantified Boolean formulae

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897207)