Walksat

swMATH4328MaRDI QIDQ16507FDOQ16507

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• Statistical mechanics methods and phase transitions in optimization problems
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2004
• Enhancing stochastic search performance by value-biased randomization of heuristics
• The state of SAT
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Title not available (Why is that?)
• A parallelization scheme based on work stealing for a class of SAT solvers
• Planning as heuristic search
• Multi-agent pathfinding with continuous time
• Theory and Applications of Satisfiability Testing
• Integer optimization by local search. A domain-independent approach
• Characterizing Propagation Methods for Boolean Satisfiability
• Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
• Experimental evaluation of pheromone models in ACOPlan
• Title not available (Why is that?)
• Formalizing sensing actions -- a transition function based approach
• ASlib: a benchmark library for algorithm selection
• Worst-case study of local search for MAX-\(k\)-SAT.
• 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
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Title not available (Why is that?)
• Algorithm portfolios
• Understanding planning tasks. Domain complexity and heuristic decomposition
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• Weighted \(A^*\) search - unifying view and application
• A Tutorial on Satisfiability Modulo Theories
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Protecting Data Privacy Through Hard-to-Reverse Negative Databases
• Logics in Artificial Intelligence
• A tabu search heuristic for resource management in naval warfare
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Learning from planner performance
• Solving Simple Planning Problems with More Inference and No Search
• Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
• An improved SAT formulation for the social golfer problem
• Linear temporal logic as an executable semantics for planning languages
• Principles and Practice of Constraint Programming – CP 2003
• Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
• Survey propagation: An algorithm for satisfiability
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
• An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
• Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs
• Encoding domain and control knowledge for propositional planning
• Functional strips: A more flexible language for planning and problem solving
• 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?)
• Learning parallel portfolios of algorithms
• Generating meta-heuristic optimization code using ADATE
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• An overview of parallel SAT solving
• Monitoring and recovery for web service applications
• Specifying and computing preferred plans
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• On the tractability of minimal model computation for some CNF theories
• Compiling finite linear CSP into SAT
• Planning as satisfiability: heuristics
• The FF planning system: Fast plan generation through heuristic search
• Extending the Smodels system with cardinality and weight constraints
• Title not available (Why is that?)
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• Title not available (Why is that?)
• The configurable SAT solver challenge (CSSC)
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• Contingent planning under uncertainty via stochastic satisfiability
• Two approximate algorithms for model counting
• Leveraging belief propagation, backtrack search, and statistics for model counting
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2004
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning
• TTT plots: a perl program to create time-to-target plots
• Autarky pruning in propositional model elimination reduces failure redundancy
• Local search algorithms for SAT: an empirical evaluation
• Learning action models from plan examples using weighted MAX-SAT
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating hard satisfiability problems
• The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself
• Title not available (Why is that?)
• Approximate Model Counting via Extension Rule
• Computation of the semantics of autoepistemic belief theories
• New methods for proving the impossibility to solve problems through reduction of problem spaces
• Long-distance mutual exclusion for planning
• The Boolean Constraint Solver of SWI-Prolog (System Description)
• A competitive and cooperative approach to propositional satisfiability
• An efficient local search method for random 3-satisfiability

This page was built for software: Walksat