veriT
From MaRDI portal
Software:19326
swMATH7281MaRDI QIDQ19326FDOQ19326
Author name not available (Why is that?)
Cited In (33)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Scalable fine-grained proofs for formula processing
- Flexible proof production in an industrial-strength SMT solver
- Quantifier simplification by unification in SMT
- A Meta-level Annotation Language for Legal Texts
- Towards an Executable Methodology for the Formalization of Legal Texts
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
- Building bridges between symbolic computation and satisfiability checking
- Compression of Propositional Resolution Proofs by Lowering Subproofs
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
- A superposition calculus for abductive reasoning
- Compression of Propositional Resolution Proofs via Partial Regularization
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers
- Decision procedures for flat array properties
- Semi-intelligible Isar proofs from machine-generated proofs
- Combining decision procedures by (model-)equality propagation
- Reliable reconstruction of fine-grained proofs in a proof assistant
- Exploiting Symmetry in SMT Problems
- Complexity of translations from resolution to sequent calculus
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
- A learning-based fact selector for Isabelle/HOL
- Congruence Closure with Free Variables
- Positive solutions of systems of signed parametric polynomial inequalities
- Extending SMT solvers to higher-order logic
- SMT proof checking using a logical framework
- Modular SMT Proofs for Fast Reflexive Checking Inside Coq
- Integration of SMT-solvers in B and Event-B development environments
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses
- Satisfiability Modulo Theories
- Title not available (Why is that?)
- Modular strategic SMT solving with \textbf{SMT-RAT}
- versat: A Verified Modern SAT Solver
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description)
This page was built for software: veriT
