Superposition Modulo Non-linear Arithmetic
From MaRDI portal
Publication:3172887
DOI10.1007/978-3-642-24364-6_9zbMath1348.68218OpenAlexW1801713495MaRDI QIDQ3172887
Andreas Eggers, Stefan Kupferschmid, Tino Teige, Evgeny Kruglov, Christoph Weidenbach, Karsten Scheibler
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Superposition Modulo Non-linear Arithmetic ⋮ Superposition decides the first-order logic fragment over ground theories ⋮ Harald Ganzinger’s Legacy: Contributions to Logics and Programming ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ An efficient subsumption test pipeline for BS(LRA) clauses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Refutational theorem proving for hierarchic first-order theories
- Superposition for fixed domains
- Superposition Modulo Non-linear Arithmetic
- Engineering DPLL(T) + Saturation
- The Image Computation Problem in Hybrid Systems Model Checking
- Superposition Modulo Linear Arithmetic SUP(LA)
- Conflict resolution for air traffic management: a study in multiagent hybrid systems
- (LIA) - Model Evolution with Linear Integer Arithmetic Constraints
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: Superposition Modulo Non-linear Arithmetic
