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?)
• Generating hard satisfiability problems
• The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself
• DPLL: the core of modern satisfiability solvers
• Title not available (Why is that?)
• Computation of the semantics of autoepistemic belief theories
• Quiet planting in the locked constraint satisfaction problems
• New methods for proving the impossibility to solve problems through reduction of problem spaces
• Long-distance mutual exclusion for planning
• A competitive and cooperative approach to propositional satisfiability
• An efficient local search method for random 3-satisfiability
• Star-topology decoupled state space search
• Title not available (Why is that?)
• Automated reformulation of specifications by safe delay of constraints
• SAT local search algorithms: Worst-case study
• Algorithmic aspects in speech recognition
• Propositional SAT solving
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Generating hard satisfiable formulas by hiding solutions deceptively
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• ILP Through Propositionalization and Stochastic k-Term DNF Learning
• Why almost all satisfiable k-CNF formulas are easy
• Extracting mutual exclusion invariants from lifted temporal planning domains
• Auto-Walksat: A self-tuning implementation of Walksat
• Theory and Applications of Satisfiability Testing
• Subdimensional expansion for multirobot path planning
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Title not available (Why is that?)
• Boosting complete techniques thanks to local search methods
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• Title not available (Why is that?)
• Multi-agent oriented constraint satisfaction
• Local and global evaluation functions for computational evolution
• A Bayesian approach to tackling hard computational problems. (Preliminary report)
• A propositional theorem prover to solve planning and other problems
• Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
• Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
• Using satisfiability for non-optimal temporal planning
• Introducing preferences in planning as satisfiability
• Programming for modular reconfigurable robots
• Experimental and Efficient Algorithms
• Approximate model counting via extension rule
• Principles and practice of constraint programming -- CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1--5, 2005. Proceedings
• Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Search in the patience game `Black Hole'
• Title not available (Why is that?)
• The island confinement method for reducing search space in local search methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trace-based methods for solving nonlinear global optimization and satisfiability problems
• Using global constraints for local search
• Title not available (Why is that?)
• The Boolean constraint solver of SWI-Prolog (system description)
• A Lagrangian reconstruction of GENET
• Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
• Planning and control in artificial intelligence: A unifying perspective
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modelling and solving English peg solitaire
• 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
• 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

This page was built for software: Walksat