Experiments with automated reasoning in the class
From MaRDI portal
Cites work
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic
- A heuristic prover for elementary analysis in \textit{Theorema}
- A machine program for theorem-proving
- An Automatic Method of Solving Discrete Programming Problems
- Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Fully incremental cylindrical algebraic decomposition
- Handbook of proof theory
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1157666 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
- On Gröbner bases in the context of satisfiability-modulo-theories solving over the real numbers
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Sharp thresholds of graph properties, and the k-sat problem
- Subtropical satisfiability
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- Theorema 2.0: A System for Mathematical Theory Exploration
- Theorema 2.0: computer-assisted natural-style mathematics
This page was built for publication: Experiments with automated reasoning in the class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102980)
