Captain Jack: New Variable Selection Heuristics in Local Search for SAT

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Conference on Theory and Applications of Satisfiability Testing

• Publication date

  2011-06-19

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-21581-0_24
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ParamILS: An Automatic Algorithm Configuration Framework

  2014cited by this paper
• EDACC - An Advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms

  2011cited by this paper
• Dynamic local search for SAT : design, insights and analysis

  2010cited by this paper
• Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT

  2010cited by this paper
• Improving Stochastic Local Search for SAT with a New Probability Distribution

  2010cited by this paper
• Towards Industrial-Like Random SAT Instances

  2009influential reference
• SATenstein: Automatically Building Local Search SAT Solvers from Components

  2009cited by this paper
• Combining Adaptive and Dynamic Local Search for Satisfiability

  2008influential reference
• PicoSAT Essentials

  2008cited by this paper
• PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Proceedings

  2008cited by this paper
• SATzilla: Portfolio-based Algorithm Selection for SAT

  2008cited by this paper
• Computer-Aided Design of High-Performance Algorithms

  2008cited by this paper
• Using Cost Distributions to Guide Weight Decay in Local Search for SAT

  2008influential reference
• Automatic Algorithm Configuration Based on Local Search

  2007cited by this paper
• Random Walk with Continuously Smoothed Variable Weights

  2005cited by this paper
• Diversification and Determinism in Local Search for Satisfiability

  2005influential reference
• Additive versus Multiplicative Clause Weighting for SAT

  2004influential reference
• UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT

  2004cited by this paper
• Threshold values of random K‐SAT from the cavity method

  2003cited by this paper
• Annals of Mathematics and Artificial Intelligence

  1994cited by this paper
• Many hard examples for resolution

  1988cited by this paper

• An algorithm for solving satisfiability problem based on the structural information of formulas

  2021cites this paper
• ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy

  2021cites this paper
• Focused random walk with probability distribution for SAT with long clauses

  2020cites this paper
• Applying aspiration in local search for satisfiability

  2020cites this paper
• Implementing an Efficient SAT Solver for Structured Instances

  2019cites this paper
• On the Configuration of SAT Formulae

  2019cites this paper
• Selection and Configuration of Parallel Portfolios

  2018cites this paper
• New stochastic local search approaches for computing preferred extensions of abstract argumentation

  2018cites this paper
• Chapter 8 Selection and Configuration of Parallel Portfolios

  2017cites this paper
• au Scoring Functions Based on Second Level Score for kSAT with Long Clauses

  2017cites this paper
• Automatic construction of parallel portfolios via algorithm configuration

  2017cites this paper
• Engineering a Lightweight and Efficient Local Search SAT Solver

  2016cites this paper
• Quantifying the Similarity of Algorithm Configurations

  2016cites this paper
• Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms

  2016cites this paper
• Clause States Based Configuration Checking in Local Search for Satisfiability

  2015cites this paper
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers

  2015cites this paper
• The Configurable SAT Solver Challenge (CSSC)

  2015influential citation
• Improving Diversification in Local Search for Propositional Satisfiability

  2014cites this paper
• Double Configuration Checking in Stochastic Local Search for Satisfiability

  2014cites this paper
• Evaluating Instance Generators by Configuration

  2014cites this paper
• Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses

  2014cites this paper
• An Efficient Approach for Assessing Hyperparameter Importance

  2014cites this paper
• AClib: A Benchmark Library for Algorithm Configuration

  2014influential citation
• Logical Reasoning to Detect Weaknesses About SHA-1 and MD4/5

  2014cites this paper
• Scoring Functions Based on Second Level Score for k-SAT with Long Clauses

  2014cites this paper
• From Sequential to Parallel Local Search for SAT

  2013cites this paper
• Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability

  2013cites this paper
• Local search for Boolean Satisfiability with configuration checking and subscore

  2013cites this paper
• Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning

  2013cites this paper
• Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability

  2013cites this paper
• Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT

  2013cites this paper
• A probabilistic architecture for algorithm portfolios

  2012cites this paper
• Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

  2012cites this paper
• The Effect of Clause Elimination on SLS for SAT

  2012cites this paper
• Off the Trail: Re-examining the CDCL Algorithm

  2012cites this paper
• clasp , claspfolio , aspeed : Three Solvers from the Answer Set Solving Collection Potassco

  2012cites this paper
• Quantifying Homogeneity of Instance Sets for Algorithm Configuration

  2012cites this paper
• A Study of Local Minimum Avoidance Heuristics for SAT

  2012cites this paper
• Configuration Checking with Aspiration in Local Search for SAT

  2012influential citation
• An exploration-exploitation compromise-based adaptive operator selection for local search

  2012cites this paper
• A Method to Avoid Duplicative Flipping in Local Search for SAT

  2012cites this paper
• Local Search with Configuration Checking for SAT

  2011cites this paper
• Automating meta-algorithmic analysis and design

  2011cites this paper
• random walk with probability distribution for SAT with long clauses

  year unknowncites this paper