Results 1  10
of
101,666
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
, 2008
"... Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and connectivity of the solution space. Motivated by this work, we ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
study structural and connectivityrelated properties of the space of solutions of Boolean satisfiability problems and establish various dichotomies in Schaefer’s framework. On the structural side, we obtain dichotomies for the kinds of subgraphs of the hypercube that can be induced by the solutions
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
"... For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold, in 20 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold
A computational trichotomy for connectivity of boolean satisfiability
 ArXiv CoRR abs/1312.4524
, 2013
"... For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold, in 20 ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold
Fault Tolerant Boolean Satisfiability
"... A δmodel is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A δmodel is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e
Fault Tolerant Boolean Satisfiability
, 2002
"... A delta model is a satisfying assignment of a boolean formula for which any small alteration, such as a single bit flip, can be repaired by another small alteration, yielding a nearby satisfying assignment. We study ..."
Abstract
 Add to MetaCart
A delta model is a satisfying assignment of a boolean formula for which any small alteration, such as a single bit flip, can be repaired by another small alteration, yielding a nearby satisfying assignment. We study
Symmetry Breaking for Boolean Satisfiability: . . .
"... Boolean Satisfiability solvers improved dramatically over the last seven years [14, 13] and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However, a number of practical SAT instances remain difficult to solve. Recent work pointed out that symmetries i ..."
Abstract

Cited by 55 (12 self)
 Add to MetaCart
Boolean Satisfiability solvers improved dramatically over the last seven years [14, 13] and are commonly used in applications such as bounded model checking, planning, and FPGA routing. However, a number of practical SAT instances remain difficult to solve. Recent work pointed out that symmetries
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 29
, 2007
"... Gopalan et al. studied in [14] connectivity properties of the solutionspace of Boolean formulas, and investigated complexity issues on connectivity problems in Schaefer’s framework [26]. A set S of logical relations is Schaefer if all relations in S are either bijunctive, Horn, dual Horn, or affine ..."
Abstract
 Add to MetaCart
Gopalan et al. studied in [14] connectivity properties of the solutionspace of Boolean formulas, and investigated complexity issues on connectivity problems in Schaefer’s framework [26]. A set S of logical relations is Schaefer if all relations in S are either bijunctive, Horn, dual Horn
Practical applications of boolean satisfiability
 In Workshop on Discrete Event Systems (WODES
, 2008
"... Abstract — Boolean Satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Abstract — Boolean Satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis
Speculative Pruning for Boolean Satisfiability
, 1998
"... Much recent work on boolean satisfiability has focussed on incomplete algorithms that sacrifice accuracy for improved running time. Statistical predictors of satisfiability do not return actual satisfying assignments, but at least two have been developed that run in linear time. Search algorithm ..."
Abstract
 Add to MetaCart
Much recent work on boolean satisfiability has focussed on incomplete algorithms that sacrifice accuracy for improved running time. Statistical predictors of satisfiability do not return actual satisfying assignments, but at least two have been developed that run in linear time. Search
Results 1  10
of
101,666