Superposition decides the first-order logic fragment over ground theories
From MaRDI portal
Publication:1949088
DOI10.1007/s11786-012-0135-4zbMath1262.68160MaRDI QIDQ1949088
Christoph Weidenbach, Evgeny Kruglov
Publication date: 25 April 2013
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-012-0135-4
03B25: Decidability of theories and sets of sentences
Related Items
Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, An efficient subsumption test pipeline for BS(LRA) clauses, Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories, Politeness and combination methods for theories with bridging functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On deciding satisfiability by theorem proving with speculative inferences
- Orderings for term-rewriting systems
- Refutational theorem proving for hierarchic first-order theories
- A rewriting approach to satisfiability procedures.
- Superposition as a decision procedure for timed automata
- Modular proof systems for partial functions with Evans equality
- Automatic Generation of Invariants for Circular Derivations in SUP(LA)
- Superposition Modulo Non-linear Arithmetic
- Solving SAT and SAT Modulo Theories
- Integrating Linear Arithmetic into Superposition Calculus
- Superposition Modulo Linear Arithmetic SUP(LA)
- Proving termination with multiset orderings
- Term Rewriting and All That
- Superposition-Based Analysis of First-Order Probabilistic Timed Automata
- New results on rewrite-based satisfiability procedures
- On Local Reasoning in Verification
- (LIA) - Model Evolution with Linear Integer Arithmetic Constraints
- On the Saturation of YAGO
