Theorem proving using lazy proof explication.
From MaRDI portal
Recommendations
Cited in
(23)- A framework for satisfiability modulo theories
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Lazy techniques for fully expansive theorem proving
- Efficient theory combination via Boolean search
- Preface to the special issue ``SI: satisfiability modulo theories
- Distributing the workload in a lazy theorem-prover
- Abstraction-based algorithm for 2QBF
- Satisfiability modulo theories
- SAT race 2015
- HordeSat: a massively parallel portfolio SAT solver
- Extending a Resolution Prover for Inequalities on Elementary Functions
- Combining equational reasoning
- Variant-Based Satisfiability in Initial Algebras
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- Complexity-sensitive decision procedures for abstract argumentation
- Theorem Proving in Higher Order Logics
- Tools and Algorithms for the Construction and Analysis of Systems
- Scalable fine-grained proofs for formula processing
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
- The SAT-based approach to separation logic
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- Fast congruence closure and extensions
- Synchronous counting and computational algorithm design
This page was built for publication: Theorem proving using lazy proof explication.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900690)
