Walksat
From MaRDI portal
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 2086438 (Why is no real title available?)
- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Modelling and solving English peg solitaire
- scientific article; zbMATH DE number 1946847 (Why is no real title available?)
- scientific article; zbMATH DE number 2243408 (Why is no real title available?)
- scientific article; zbMATH DE number 1113991 (Why is no real title available?)
- Using genetic programming to learn and improve control knowledge.
- About the incremental validation of first-order stratified knowledge-based decision-support systems
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- scientific article; zbMATH DE number 2038901 (Why is no real title available?)
- Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
- A weighted CSP approach to cost-optimal planning
- PRACTICAL INCONSISTENCY MANAGEMENT FOR CRITICAL-TASKS DECISION-SUPPORT SYSTEMS
- scientific article; zbMATH DE number 1114005 (Why is no real title available?)
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself
- scientific article; zbMATH DE number 1962893 (Why is no real title available?)
- Resolving Braess's paradox in random networks
- Generating hard satisfiability problems
- Statistical mechanics methods and phase transitions in optimization problems
- scientific article; zbMATH DE number 2243389 (Why is no real title available?)
- DPLL: the core of modern satisfiability solvers
- Computation of the semantics of autoepistemic belief theories
- scientific article; zbMATH DE number 1931852 (Why is no real title available?)
- Enhancing stochastic search performance by value-biased randomization of heuristics
- The state of SAT
- Quiet planting in the locked constraint satisfaction problems
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Principles and Practice of Constraint Programming – CP 2004
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- Long-distance mutual exclusion for planning
- A parallelization scheme based on work stealing for a class of SAT solvers
- scientific article; zbMATH DE number 1941180 (Why is no real title available?)
- scientific article; zbMATH DE number 1962894 (Why is no real title available?)
- Multi-agent pathfinding with continuous time
- Integer optimization by local search. A domain-independent approach
- Computing the moments k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
- Experimental evaluation of pheromone models in ACOPlan
- Planning as heuristic search
- XOR local search for Boolean Brent equations
- A competitive and cooperative approach to propositional satisfiability
- Theory and Applications of Satisfiability Testing
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- Theory and Applications of Satisfiability Testing
- Characterizing Propagation Methods for Boolean Satisfiability
- scientific article; zbMATH DE number 2080313 (Why is no real title available?)
- ASlib: a benchmark library for algorithm selection
- Unique solution instance generation for the 3-satisfiability (3SAT) problem
- scientific article; zbMATH DE number 1448981 (Why is no real title available?)
- Formalizing sensing actions -- a transition function based approach
- Worst-case study of local search for MAX-\(k\)-SAT.
- An efficient local search method for random 3-satisfiability
- scientific article; zbMATH DE number 1894618 (Why is no real title available?)
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Exploiting the real power of unit propagation lookahead
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Planning as satisfiability: parallel plans and algorithms for plan search
- Weighted \(A^*\) search - unifying view and application
- Star-topology decoupled state space search
- Understanding planning tasks. Domain complexity and heuristic decomposition
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- Algorithm portfolios
- Automated reformulation of specifications by safe delay of constraints
- SAT local search algorithms: Worst-case study
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- scientific article; zbMATH DE number 1759715 (Why is no real title available?)
- SAT Distributions with Phase Transitions between Decision and Optimization Problems
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Propositional SAT solving
- Algorithmic aspects in speech recognition
- scientific article; zbMATH DE number 2000825 (Why is no real title available?)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- scientific article; zbMATH DE number 956859 (Why is no real title available?)
- Generating hard satisfiable formulas by hiding solutions deceptively
- A tabu search heuristic for resource management in naval warfare
- A Tutorial on Satisfiability Modulo Theories
- Learning from planner performance
- Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
- Processes and continuous change in a SAT-based planner
- Protecting Data Privacy Through Hard-to-Reverse Negative Databases
- Why almost all satisfiable k-CNF formulas are easy
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- ILP Through Propositionalization and Stochastic k-Term DNF Learning
- An improved SAT formulation for the social golfer problem
- Logics in Artificial Intelligence
- Solving Simple Planning Problems with More Inference and No Search
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Extracting mutual exclusion invariants from lifted temporal planning domains
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- Auto-Walksat: A self-tuning implementation of Walksat
- Exploiting partial knowledge of satisfying assignments
- Local search algorithms for SAT: an empirical evaluation
- Linear temporal logic as an executable semantics for planning languages
- Subdimensional expansion for multirobot path planning
- Theory and Applications of Satisfiability Testing
- On the use of stochastic local search techniques to revise first-order logic theories from examples
This page was built for software: Walksat
