Pages that link to "Item:Q3655193"
From MaRDI portal
The following pages link to Superposition Modulo Linear Arithmetic SUP(LA) (Q3655193):
Displaying 17 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- A superposition calculus for abductive reasoning (Q2013317) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Layered clause selection for theory reasoning (short paper) (Q2096461) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Making theory reasoning simpler (Q2233504) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Superposition Modulo Non-linear Arithmetic (Q3172887) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- Model Evolution with Equality Modulo Built-in Theories (Q5200017) (← links)
- Linear Quantifier Elimination as an Abstract Decision Procedure (Q5747770) (← links)
