Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
CaDiCaL
Description:
An open-source Boolean satisfiability solver used in automated reasoning and formal verification of computer systems.
Primary topic:
Constraint Satisfaction and Optimization (39%)
Related topics:
Constraint Satisfaction and Optimization (39%),
Formal Methods in Verification (21%),
Limits and Structures in Graph Theory (9%)
OpenAlex ID:
keywords/cadical
CaDiCaL 2.0
2024
·
Armin Biere
, Tobias Faller
, et al.
·
Lecture notes in computer science
·
201
PDF
Enhancing SAT solvers with glue variable predictions
2020
·
Han, Jesse Michael
·
arXiv (Cornell University)
·
24
PDF
Satisfiability Modulo User Propagators
2024
·
Katalin Fazekas
, Aina Niemetz
, et al.
·
Journal of Artificial Intelligence Research
·
20
PDF
SHA-256 Collision Attack with Programmatic SAT
2024
·
Alamgir, Nahiyan
, Nejati, Saeed
, et al.
·
arXiv (Cornell University)
·
16
PDF
From Clauses to Klauses
2024
·
Joseph E. Reeves
, Marijn J. H. Heule
, et al.
·
Lecture notes in computer science
·
9
PDF
Propositional Proof Skeletons
2023
·
Joseph E. Reeves
, Benjamin Kiesl-Reiter
, et al.
·
Lecture notes in computer science
·
8
PDF
Efficient All-UIP Learned Clause Minimization
2021
·
Mathias Fleury
, Armin Biere
·
Lecture notes in computer science
·
8
PDF
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
2024
·
Jha, Piyush
, Li, Zhengyu
, et al.
·
arXiv (Cornell University)
·
7
PDF
The four-colour Rado number of 2(x-y)=3z is 226: a cube-and-conquer computation with checked DRAT proofs
2026
·
Ichikawa, Takumi
·
Zenodo (CERN European Organization for Nuclear Research)
·
5
CaDiCaL 3.0 (Tool Paper)
2026
·
Pollitt, Florian
, Fleury, Mathias
, et al.
·
Leibniz international proceedings in informatics
·
5
PDF
Efficient proof checking with LRAT in CaDiCaL (work in progress)
2023
·
Pollitt, Florian
, Fleury, Mathias
, et al.
·
FreiDok plus (Universitätsbibliothek Freiburg)
·
4
CoPTIC: Constraint Programming Translated Into C
2023
·
Martin Mariusz Lester
·
Lecture notes in computer science
·
3
PDF
Order-7 CNF refutation for a Conway 99-graph encoding (CaDiCaL 1.9.5)
2026
·
Machuca Hortelano, Antonio Manuel
·
Zenodo (CERN European Organization for Nuclear Research)
·
2
Life span of SAT techniques
2024
·
Fleury, Mathias
, Kaufmann, Daniela
·
arXiv (Cornell University)
·
2
PDF
Unit Propagation with Stable Watches (Short Paper)
2021
·
Iser, Ashlin
, Balyo, Tomáš
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
LLM-Assisted SAT Solver Engineering: A Case Study on Enhancing CSFLOC
2026
·
Gábor Kusper
·
IEEE Conference on Information Technology and Data Science (CITDS)
·
1
Extension-rigidity of the known (5,5,42) Ramsey graphs, machine-certified
2026
·
James, Liju
·
Zenodo (CERN European Organization for Nuclear Research)
·
1
Improving SAT Solvers on Orthogonal Latin Square Problems
2026
·
Barnoff, Aaron
, Bright, Curtis
·
arXiv (Cornell University)
·
1
PDF
An UPgrade for HCP: Solving the Hamiltonian Cycle Problem via User Propagators
2026
·
Funder, Fabian
·
reposiTUm (TU Wien)
·
1
PDF
Artifact CaDiCaL 3.0 Paper
2026
·
Pollitt, Florian
, Fleury, Mathias
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
·
1
Simplify, Order, Break, Repeat
2026
·
Anders, Markus
, Codel, Cayden
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Implementation of the wave function collapse algorithm in SAT with custom propagator
2025
·
Ngo, Trung
·
Aaltodoc (Aalto University)
·
1
Revisiting DRUP-Based Interpolants with CaDiCaL 2.0
2025
·
Basel Khouri
, Yakir Vizel
·
Lecture notes in computer science
·
1
PDF
Analyzing Multiple Conflicts in SAT: An Experimental Evaluation
2023
·
Albert Oliveras
, Enric Rodríguez Carbonell
, et al.
·
EPiC series in computing
·
1
PDF
Proceedings of SAT Competition 2013 : Solver and Benchmark Descriptions
2013
·
Helda - University of Helsinki Institutional Repository
·
1
Show more works
View as search
Works count:
88
Citation count:
452
Year
Topic
Type