Experiments with automated reasoning in the class
From MaRDI portal
Publication:6102980
DOI10.1007/978-3-031-16681-5_20MaRDI QIDQ6102980
Sorin Stratulat, Tudor Jebelean, Isabela Drămnesc, Erika Ábrahám, Gábor Kusper
Publication date: 2 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Handbook of proof theory
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- Subtropical satisfiability
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- A heuristic prover for elementary analysis in \textit{Theorema}
- Fully incremental cylindrical algebraic decomposition
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
- On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
- Theorema 2.0: A System for Mathematical Theory Exploration
- An Automatic Method of Solving Discrete Programming Problems
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
- Sharp thresholds of graph properties, and the $k$-sat problem
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
- Theorema 2.0: Computer-Assisted Natural-Style Mathematics
- A machine program for theorem-proving
This page was built for publication: Experiments with automated reasoning in the class
