The following pages link to (Q5687271):
Displaying 50 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time (Q418028) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Testing logic programs for local stratification (Q1199536) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← links)
- Testing satisfiability of CNF formulas by computing a stable set of points (Q1777393) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves (Q2433187) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Enhancing stochastic search performance by value-biased randomization of heuristics (Q2573000) (← links)
- SAT distributions with planted assignments and phase transitions between decision and optimization problems (Q2581547) (← links)
- The state of SAT (Q2643296) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Exploiting the real power of unit propagation lookahead (Q2741514) (← links)
- Parallelizing SATZ using dynamic workload balancing (Q2741522) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q2749854) (← links)
- The Boolean Constraint Solver of SWI-Prolog (System Description) (Q2798256) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- SAT Distributions with Phase Transitions between Decision and Optimization Problems (Q3439111) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
- (Q3604003) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
- Towards backbone computing: A Greedy-Whitening based approach (Q5145436) (← links)
