A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “Boolean satisfiability” 4

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Applying aspiration in local search for satisfiability
2020 PLoS ONE article Computer Science Constraint Satisfaction and Optimization Open access

Peng Cong, XU Zhong-wei, Meng Mei

5

citations
The Compilability Thresholds of 2-CNF to OBDD
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Alexis de Colnet, Alfons Laarman, Joon Lee

0

citations
Hybrid divide-and-conquer approach for tree search algorithms
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Mathys Rennela, Sebastiaan Brand, Alfons Laarman, Vedran Dunjko

9

citations
Extensions of the Cylindrical Algebraic Covering Method for Quantifiers
2026 Mathematics in Computer Science article Computer Science Polynomial and algebraic computation Open access

Jasper Nalbach, Gereon Kremer

1

citations

4 results