mlsanityData to 14 Oct 2026

Proof Generation in CDSAT

arXiv 2107.02351 ↗First posted 6 Jul 2021cs.LO cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The main ideas in the CDSAT (Conflict-Driven Satisfiability) framework for SMT are summarized, leading to approaches to proof generation in CDSAT.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 6 Jul 2021.

Builds on

4 of 30 references.

References · 4

  1. 2016Efficient Certified RAT Verificationcited by 13
  2. 2019A CDCL-style calculus for solving non-linear constraintscited by 3
  3. 2019Extending Description Logic EL++ with Linear Constraints on the Probability of Axiomscited by 2
  4. 2020Solving bitvectors with MCSAT: explanations from bits and pieces (long version)cited by 1

Built on by

Not cited yet.