Walksat
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Linear temporal logic as an executable semantics for planning languages
- Learning action models from plan examples using weighted MAX-SAT
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Boosting complete techniques thanks to local search methods
- Integer optimization by local search. A domain-independent approach
- Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
- March_eq
- SDSAT
- Trace-based methods for solving nonlinear global optimization and satisfiability problems
- SymChaff
- UnitWalk
- WSAT
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- A tabu search heuristic for resource management in naval warfare
- Worst-case study of local search for MAX-\(k\)-SAT.
- CP-nets
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- SatEx
- RealPlan
- SATLIB
- GOLOG
- UBCSAT
- ADATE
- Local search algorithms for SAT: an empirical evaluation
- STAN
- MAX-2-SAT
- A Lagrangian reconstruction of GENET
- IPC-4
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Computation of the semantics of autoepistemic belief theories
- CSPLib
- Extracting mutual exclusion invariants from lifted temporal planning domains
- Siege
- SATO
- QingTing1
- hgen2
- PBS
- SAT competition
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- ASA
- zChaff
- WSAT(OIP)
- LPL software
- PROXIMUS
- CPlan
- BG-WalkSAT
- Star-topology decoupled state space search
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Programming for modular reconfigurable robots
- An improved SAT formulation for the social golfer problem
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
- Autarky pruning in propositional model elimination reduces failure redundancy
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- Using genetic programming to learn and improve control knowledge.
- About the incremental validation of first-order stratified knowledge-based decision-support systems
- Chaff
- BerkMin
- SCR
- BPEL2PN
- PaQuBE
- PDDL
- Sat4j
- The Multi-SAT algorithm
- Graphplan
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- A propositional theorem prover to solve planning and other problems
- NuMVC
- DIMACS
- Probabilistic characterization of random Max r-Sat
- Using the method of conditional expectations to supply an improved starting point for CCLS
- XOR local search for Boolean Brent equations
- Cunf
- Multi-agent pathfinding with continuous time
- ChainSAT
- MathSAT
- A novel algorithm for Max Sat calling MOCE to order
- QMaxSAT
- MiniMaxSat
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- SOCRATES
- Azucar
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- NMRDPP
- Set-structured and cost-sharing heuristics for classical planning
- PMiniSAT
- Picoso
- Subdimensional expansion for multirobot path planning
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- Beam-ACO
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Resolving Braess's paradox in random networks
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
- Planning as satisfiability: parallel plans and algorithms for plan search
- Automated reformulation of specifications by safe delay of constraints
This page was built for software: Walksat
