Unification with abstraction and theory instantiation in saturation-based reasoning
From MaRDI portal
(Redirected from Publication:2324203)
Recommendations
Cited in
(18)- Towards satisfiability modulo parametric bit-vectors
- A combinator-based superposition calculus for higher-order logic
- Layered clause selection for theory reasoning (short paper)
- Making theory reasoning simpler
- Towards bit-width-independent proofs in SMT solvers
- SAT Encoding of Unification in $\mathcal{EL}$
- The 9th IJCAR automated theorem proving system competition -- CASC-J9
- Superposition with Delayed Unification
- Program Synthesis in Saturation
- ALASCA: reasoning in quantified linear arithmetic
- Difference of constrained patterns in logically constrained term rewrite systems
- Partial redundancy in saturation
- SMT and functional equation solving over the reals: challenges from the IMO
- Ground truth: checking \textsc{Vampire} proofs via satisfiability modulo theories
- Automating induction by reflection
- Refining unification with abstraction
- Reducibility constraints in superposition
- A higher-order Vampire (short paper)
This page was built for publication: Unification with abstraction and theory instantiation in saturation-based reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324203)