scientific article; zbMATH DE number 956863
From MaRDI portal
Publication:5687271
zbMath0864.90093MaRDI QIDQ5687271
Bram Cohen, Henry A. Kautz, Bart Selman
Publication date: 9 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the use of stochastic local search techniques to revise first-order logic theories from examples ⋮ Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ⋮ Approximate Model Counting via Extension Rule ⋮ Compiling finite linear CSP into SAT ⋮ Constructing SAT Filters with a Quantum Annealer ⋮ Propositional SAT Solving ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ The state of SAT ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Planning as satisfiability: heuristics ⋮ Resolving Braess's paradox in random networks ⋮ Generating meta-heuristic optimization code using ADATE ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ Generating hard satisfiability problems ⋮ Local Search For Satisfiability Modulo Integer Arithmetic Theories ⋮ Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ Automated reformulation of specifications by safe delay of constraints ⋮ Towards backbone computing: A Greedy-Whitening based approach ⋮ An overview of parallel SAT solving ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Markov chain methods for the bipartite Boolean quadratic programming problem ⋮ An improved SAT formulation for the social golfer problem ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Testing satisfiability of CNF formulas by computing a stable set of points ⋮ Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? ⋮ Multi-agent oriented constraint satisfaction ⋮ Statistical mechanics methods and phase transitions in optimization problems ⋮ The Boolean Constraint Solver of SWI-Prolog (System Description) ⋮ Revising First-Order Logic Theories from Examples Through Stochastic Local Search ⋮ Probabilistic characterization of random Max \(r\)-Sat ⋮ The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ ⋮ Efficiently Calculating Evolutionary Tree Measures Using SAT ⋮ Learning action models from plan examples using weighted MAX-SAT ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Enhancing stochastic search performance by value-biased randomization of heuristics ⋮ SAT distributions with planted assignments and phase transitions between decision and optimization problems ⋮ SAT Distributions with Phase Transitions between Decision and Optimization Problems ⋮ An efficient local search method for random 3-satisfiability ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ XOR local search for Boolean Brent equations
Uses Software
