From

Institution

Field

Type

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

Reset

Papers matching “satisfiability checking” 52

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Automated Exercise Generation for Satisfiability Checking
2023 Lecture notes in computer science conference-paper Computer Science Educational Technology and Assessment

Erika Ábrahám, Jasper Nalbach, Valentin Promies

2

citations
Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

0

citations
Accelerated bounded model checking with LoAT
2026 Science of Computer Programming article Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
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
First-Order Model-Checking in Random Graphs and Complex Networks
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
First-Order Model-Checking in Random Graphs and Complex Networks
2020 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Philipp Kuinke, Peter Rossmanith

1

citations
Logics of dependence and independence: The local variants
2021 Journal of Logic and Computation article Computer Science Logic, Reasoning, and Knowledge Open access

Erich Grädel, Phil Pützstück

1

citations
A Divide-and-Conquer Approach to Variable Elimination in Linear Real Arithmetic
2024 Lecture notes in computer science conference-paper Computer Science Polynomial and algebraic computation Open access

Valentin Promies, Erika Ábrahám

3

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
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
2023 arXiv (Cornell University) preprint Computer Science Polynomial and algebraic computation Open access

Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown

1

citations
SMT: Something You Must Try
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

Erika Ábrahám, József Kovács, Anne Remke

1

citations
Quantum Graph-State Synthesis with SAT
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Sebastiaan Brand, Tim Coopmans, Alfons Laarman

0

citations
Merging Adjacent Cells During Single Cell Construction
2024 Lecture notes in computer science conference-paper Computer Science Polynomial and algebraic computation

Jasper Nalbach, Erika Ábrahám

2

citations
Using GPUs And LLMs Can Be Satisfying for Nonlinear Real Arithmetic Problems
2025 RWTH Publications (RWTH Aachen) conference-paper Computer Science Polynomial and algebraic computation Open access

Christopher Brix, Julia Walczak, Nils Lommen, T. G. Noll

0

citations
Artifact for "Shifting-based Optimizable Linear Relaxations for General Activation Functions"
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Formal Methods in Verification Open access

Philipp Kern, László Antal, Erika Abraham, Carsten Sinz

0

citations
Acceleration Techniques for Symbolic Simulation of Railway Timetables
2022 Lecture notes in computer science conference-paper Engineering Railway Systems and Energy Efficiency

Rebecca Haehn, Erika Ábrahám

0

citations
Artifact for "Shifting-based Optimizable Linear Relaxations for General Activation Functions"
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Formal Methods in Verification Open access

Philipp Kern, László Antal, Erika Ábrahám, Carsten Sinz

0

citations
Artifact for "Shifting-based Optimizable Linear Relaxations for General Activation Functions"
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Formal Methods in Verification Open access

Philipp Kern, László Antal, Erika Abraham, Carsten Sinz

0

citations
Automated reasoning and randomization in separation logic
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Christoph Matheja

6

citations
Approximate Evaluation of First-Order Counting Queries
2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Peter Rossmanith

5

citations
Levelwise construction of a single cylindrical algebraic cell
2023 Journal of Symbolic Computation article Computer Science Polynomial and algebraic computation Open access

Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England

10

citations
Convex Optimization for Parameter Synthesis in MDPs
2021 IEEE Transactions on Automatic Control article Computer Science Formal Methods in Verification Open access

Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu

21

citations
Levelwise construction of a single cylindrical algebraic cell
2022 RWTH Publications (RWTH Aachen) article Computer Science Polynomial and algebraic computation Open access

Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England

0

citations
Counterexample-guided inductive synthesis for probabilistic systems
2021 Formal Aspects of Computing article Computer Science Formal Methods in Verification Open access

Milan Češka, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen

7

citations
More is Less: Adding Polynomials for Faster Explanations in NLSAT
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Valentin Promies, Jasper Nalbach, Erika Ábrahám

0

citations