ALASCA: reasoning in quantified linear arithmetic
From MaRDI portal
Publication:6535381
Recommendations
Cites work
- scientific article; zbMATH DE number 1303342 (Why is no real title available?)
- A model-constructing satisfiability calculus
- AC-KBO revisited
- AVATAR: The Architecture for First-Order Theorem Provers
- An AC-compatible Knuth-Bendix order.
- Beagle -- a hierarchic superposition theorem prover
- Conflict Resolution
- Efficient E-Matching for SMT Solvers
- Extending reduction orderings to ACU-compatible reduction orderings
- Faster, higher, stronger: E 2.3
- Implementing Superposition in iProver (System Description)
- Integrating Linear Arithmetic into Superposition Calculus
- Ordered chaining calculi for first-order theories of transitive relations
- Paramodulation-based theorem proving
- Resolution theorem proving
- SPASS-SATT. A CDCL(LA) solver
- Satisfiability modulo theories and assignments
- Seventeen provers under the hammer
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Unification with abstraction and theory instantiation in saturation-based reasoning
This page was built for publication: ALASCA: reasoning in quantified linear arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535381)