Augmenting an electronic Ising machine to effectively solve boolean satisfiability
With the slowdown of improvement in conventional von Neumann systems, increasing
attention is paid to novel paradigms such as Ising machines. They have very different …
attention is paid to novel paradigms such as Ising machines. They have very different …
Locality in random SAT instances
J Giráldez-Cru, J Levy - 2017 - digital.csic.es
Despite the success of CDCL SAT solvers solving industrial problems, there are still many
open questions to explain such success. In this context, the generation of random SAT …
open questions to explain such success. In this context, the generation of random SAT …
On the hierarchical community structure of practical Boolean formulas
Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of
variables and clauses, despite the theoretical intractability of the SAT problem. This gap …
variables and clauses, despite the theoretical intractability of the SAT problem. This gap …
Pool-based realtime algorithm configuration: A preselection bandit approach
A El Mesaoudi-Paul, D Weiß, V Bengs… - Learning and Intelligent …, 2020 - Springer
The goal of automatic algorithm configuration is to recommend good parameter settings for
an algorithm or solver on a per-instance basis, ie, for the specific problem instance being …
an algorithm or solver on a per-instance basis, ie, for the specific problem instance being …
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments
Computing diverse solutions for a given problem, in particular evolutionary diversity
optimisation (EDO), is a hot research topic in the evolutionary computation community. This …
optimisation (EDO), is a hot research topic in the evolutionary computation community. This …
Popularity-similarity random SAT formulas
J Giráldez-Cru, J Levy - Artificial Intelligence, 2021 - Elsevier
In the last decades, we have witnessed a remarkable success of algorithms solving the
Boolean Satisfiability problem (SAT) on instances encoding application or real-world …
Boolean Satisfiability problem (SAT) on instances encoding application or real-world …
Anomaly detection in context-aware feature models
J Mauro - Proceedings of the 15th International Working …, 2021 - dl.acm.org
Feature Models are a mechanism to organize the configuration space and facilitate the
construction of software variants by describing configuration options using features, ie, a …
construction of software variants by describing configuration options using features, ie, a …
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
Satisfiability is considered the canonical NP‐complete problem and is used as a starting
point for hardness reductions in theory, while in practice heuristic SAT solving algorithms …
point for hardness reductions in theory, while in practice heuristic SAT solving algorithms …
On the empirical time complexity of scale-free 3-SAT at the phase transition
The hardness of formulas at the solubility phase transition of random propositional
satisfiability (SAT) has been intensely studied for decades both empirically and theoretically …
satisfiability (SAT) has been intensely studied for decades both empirically and theoretically …
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT
T Friedrich, R Rothenberger - … of Satisfiability Testing–SAT 2018: 21st …, 2018 - Springer
We study non-uniform random k-SAT on n variables with an arbitrary probability distribution
pp on the variable occurrences. The number t= t (n) t= t (n) of randomly drawn clauses at …
pp on the variable occurrences. The number t= t (n) t= t (n) of randomly drawn clauses at …