Walksat
From MaRDI portal
Software:16507
swMATH4328MaRDI QIDQ16507FDOQ16507
Author name not available (Why is that?)
Official website: http://www.cs.rochester.edu/u/kautz/walksat/
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Planning as heuristic search
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- ASlib: a benchmark library for algorithm selection
- Title not available (Why is that?)
- Algorithm portfolios
- Weighted \(A^*\) search - unifying view and application
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Learning from planner performance
- An improved SAT formulation for the social golfer problem
- Linear temporal logic as an executable semantics for planning languages
- March_eq
- SDSAT
- SatEx
- SATLIB
- hgen2
- QingTing1
- Siege
- SATO
- ASA
- PBS
- SAT competition
- LPL software
- BG-WalkSAT
- CPlan
- PROXIMUS
- zChaff
- WSAT(OIP)
- BerkMin
- Chaff
- BPEL2PN
- SCR
- PaQuBE
- PDDL
- Sat4j
- Graphplan
- DIMACS
- NuMVC
- Cunf
- ChainSAT
- MathSAT
- QMaxSAT
- MiniMaxSat
- Azucar
- SOCRATES
- NMRDPP
- Picoso
- PMiniSAT
- Beam-ACO
- CCASat
- Capo
- RSat
- EVC
- Velev SAT Benchmarks
- ProGolem
- TorchLight
- SATGraf
- Alchemy
- sharpSAT
- The \(Multi\)-SAT algorithm
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- OSCAR
- clpb
- AltAltp
- AltAlt
- LPG
- PPlan
- Prodigy
- SAPA
- MaxHS
- UCPOP
- VHPOP
- Yochan
- Algorithm 360
- OptiMathSAT
- AO4BPEL
- LoMRF
- RockIt
- SPFlow
- Xeggora
- Generating meta-heuristic optimization code using ADATE
- CCLS
- CCEHC
- NLocalSAT
- FourierSAT
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Specifying and computing preferred plans
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- The FF planning system: Fast plan generation through heuristic search
- Extending the Smodels system with cardinality and weight constraints
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Using genetic programming to learn and improve control knowledge.
- About the incremental validation of first-order stratified knowledge-based decision-support systems
This page was built for software: Walksat
