Local search for Boolean satisfiability with configuration checking and subscore
From MaRDI portal
Publication:490437
DOI10.1016/J.ARTINT.2013.09.001zbMATH Open1334.68200OpenAlexW2097153130MaRDI QIDQ490437FDOQ490437
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2013.09.001
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- Tabu Search—Part I
- Improving Stochastic Local Search for SAT with a New Probability Distribution
- Theory and Applications of Satisfiability Testing
- Defining tabu list size and aspiration criterion within tabu search methods
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Tabu Search—Part II
- Reactive local search for the maximum clique problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
- An improved exponential-time algorithm for k -SAT
- Theoretical aspects of local search.
- Survey propagation: An algorithm for satisfiability
- Local search algorithms for SAT: an empirical evaluation
- Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
- Threshold values of random K‐SAT from the cavity method
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited In (20)
- Solving the set packing problem via a maximum weighted independent set heuristic
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
- Title not available (Why is that?)
- XOR local search for Boolean Brent equations
- An efficient local search framework for the minimum weighted vertex cover problem
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
- New local search methods for partial MaxSAT
- CCASat
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- Local Search For Satisfiability Modulo Integer Arithmetic Theories
- Local Search for SMT on Linear Integer Arithmetic
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Local search for diversified top-\(k\) clique search problem
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search for solving satisfiability of polynomial formulas
- Using the method of conditional expectations to supply an improved starting point for CCLS
Uses Software
This page was built for publication: Local search for Boolean satisfiability with configuration checking and subscore
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490437)
