Search Results for author:
Found 3 papers, 0 papers with code
Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems
Nevertheless, little has been said about its use in the context of AllSAT problems: problems where we are interested in listing all the models of a Boolean formula.
Existence versus Exploitation: The Opacity of Backbones and Backdoors Under a Weak Assumption
For example, in this paper we show that, under the assumption that P $\neq$ NP, there are easily recognizable families of Boolean formulas with strong backdoors that are easy to find, yet for which it is hard (in fact, NP-complete) to determine whether the formulas are satisfiable.
The Opacity of Backbones
We show that, under the widely believed assumption that integer factoring is hard, there exist sets of boolean formulas that have obvious, nontrivial backbones yet finding the values, $a_S$, of those backbones is intractable.
