Wombit: a portfolio bit-vector solver using word-level propagation
From MaRDI portal
Publication:2323450
DOI10.1007/s10817-018-9493-1zbMath1468.68210OpenAlexW2899831531WikidataQ128908652 ScholiaQ128908652MaRDI QIDQ2323450
Harald Søndergaard, Wenxi Wang, Peter J. Stuckey
Publication date: 2 September 2019
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11343/228886
constraint propagationmachine learningbit-blastingbit-vector solverportfolio solversword-level reasoning
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Portfolio approaches for constraint optimization problems
- Algorithm runtime prediction: methods \& evaluation
- Complexity of fixed-size bit-vector logics
- Philosophy of the MiniZinc challenge
- Propagation based local search for bit-precise reasoning
- Sharpening constraint programming approaches for bit-vector theory
- Propagation via lazy clause generation
- meSAT: multiple encodings of CSP to SAT
- Cutting to the chase.
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- A Bit-Vector Solver with Word-Level Propagation
- Deciding Bit-Vector Formulas with mcSAT
- A Model-Constructing Satisfiability Calculus
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- Solving SAT and SAT Modulo Theories
- An Alternative to SAT-Based Approaches for Bit-Vectors
- An Empirical Evaluation of Portfolios Approaches for Solving CSPs
- Theory and Applications of Satisfiability Testing
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- A Decision Procedure for Bit-Vectors and Arrays
