Walksat

swMATH4328MaRDI QIDQ16507

No author found.

Related Items (only showing first 100 items - show all)

On the use of stochastic local search techniques to revise first-order logic theories from examples ⋮ Multi-agent pathfinding with continuous time ⋮ ASlib: a benchmark library for algorithm selection ⋮ Long-distance mutual exclusion for planning ⋮ Learning from planner performance ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Compiling finite linear CSP into SAT ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Unnamed Item ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques ⋮ Trace-based methods for solving nonlinear global optimization and satisfiability problems ⋮ Learning parallel portfolios of algorithms ⋮ The state of SAT ⋮ Exploiting partial knowledge of satisfying assignments ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Unnamed Item ⋮ A competitive and cooperative approach to propositional satisfiability ⋮ Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Planning as satisfiability: heuristics ⋮ Resolving Braess's paradox in random networks ⋮ Generating meta-heuristic optimization code using ADATE ⋮ A discrete Lagrangian-based global-search method for solving satisfiability problems ⋮ Generating hard satisfiability problems ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ A tabu search heuristic for resource management in naval warfare ⋮ Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time ⋮ Experimental evaluation of pheromone models in ACOPlan ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ Leveraging cluster backbones for improving MAP inference in statistical relational models ⋮ Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves ⋮ Specifying and computing preferred plans ⋮ The \(Multi\)-SAT algorithm ⋮ 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. ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ The island confinement method for reducing search space in local search methods ⋮ Principles and practice of constraint programming -- CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1--5, 2005. Proceedings ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Automated reformulation of specifications by safe delay of constraints ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ Processes and continuous change in a SAT-based planner ⋮ An overview of parallel SAT solving ⋮ Monitoring and recovery for web service applications ⋮ On the tractability of minimal model computation for some CNF theories ⋮ Heavy-tailed phenomena in satisfiability and constraint satisfaction problems ⋮ A propositional theorem prover to solve planning and other problems ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ The configurable SAT solver challenge (CSSC) ⋮ TTT plots: a perl program to create time-to-target plots ⋮ Two approximate algorithms for model counting ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Star-topology decoupled state space search ⋮ Understanding planning tasks. Domain complexity and heuristic decomposition ⋮ Markov chain methods for the bipartite Boolean quadratic programming problem ⋮ The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself ⋮ Programming for modular reconfigurable robots ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ An improved SAT formulation for the social golfer problem ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Modelling and solving English peg solitaire ⋮ Planning as propositional CSP: From Walksat to local search techniques for action graphs ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ 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? ⋮ Probabilistic characterization of random Max \(r\)-Sat ⋮ Linear temporal logic as an executable semantics for planning languages ⋮ Autarky pruning in propositional model elimination reduces failure redundancy ⋮ Boosting complete techniques thanks to local search methods ⋮ Learning action models from plan examples using weighted MAX-SAT ⋮ \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver ⋮ Local search algorithms for SAT: an empirical evaluation ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Integer optimization by local search. A domain-independent approach ⋮ Enhancing stochastic search performance by value-biased randomization of heuristics ⋮ A Lagrangian reconstruction of GENET ⋮ Analyses on the 2 and 3-flip neighborhoods for the MAX SAT ⋮ Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation ⋮ Using genetic programming to learn and improve control knowledge. ⋮ SAT distributions with planted assignments and phase transitions between decision and optimization problems ⋮ Subdimensional expansion for multirobot path planning ⋮ About the incremental validation of first-order stratified knowledge-based decision-support systems ⋮ Towards a characterisation of the behaviour of stochastic local search algorithms for SAT ⋮ Computation of the semantics of autoepistemic belief theories ⋮ Unrestricted vs restricted cut in a tableau method for Boolean circuits ⋮ A parallelization scheme based on work stealing for a class of SAT solvers ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability ⋮ XOR local search for Boolean Brent equations

This page was built for software: Walksat