On Combinations of Local Theory Extensions

DOI10.1007/978-3-642-37651-1_16zbMath1383.03020arXiv0810.2653OpenAlexW1633653664MaRDI QIDQ4916087

Viorica Sofronie-Stokkermans

Publication date: 19 April 2013

Published in: Programming Logics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.2653

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Combined logics (03B62)

Related Items (2)

Unnamed Item ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Cites Work

• Unnamed Item
• Unnamed Item
• Model-theoretic methods in combined constraint satisfiability
• Modular proof systems for partial functions with Evans equality
• Automated complexity analysis based on ordered resolution
• Interpolation in Local Theory Extensions
• Simplification by Cooperating Decision Procedures
• Polynomial Time Uniform Word Problems
• Automatic recognition of tractability in inference relations
• Connecting many-sorted theories
• Automated Reasoning
• Automated Deduction – CADE-20

This page was built for publication: On Combinations of Local Theory Extensions