Making theory reasoning simpler
From MaRDI portal
Publication:2233504
Recommendations
Cites work
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
- Computing small clause normal forms
- Hierarchic superposition with weak abstraction
- Integrating Linear Arithmetic into Superposition Calculus
- Layered clause selection for theory reasoning (short paper)
- On deciding satisfiability by theorem proving with speculative inferences
- Refutational theorem proving for hierarchic first-order theories
- Rewriting
- Selecting the selection
- Superposition modulo linear arithmetic SUP(LA)
- Theory Instantiation
- Unification with abstraction and theory instantiation in saturation-based reasoning
Cited in
(6)- Coming to terms with quantified reasoning
- Fully reusing clause deduction algorithm based on standard contradiction separation rule
- Lemmaless induction in trace logic
- Unification with abstraction and theory instantiation in saturation-based reasoning
- Integer induction in saturation
- The 11th IJCAR automated theorem proving system competition – CASC-J11
This page was built for publication: Making theory reasoning simpler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233504)