A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited
From MaRDI portal
Publication:3454111
DOI10.1007/978-3-319-21401-6_29zbMath1465.68303OpenAlexW1416602162MaRDI QIDQ3454111
Paula Chocron, Pascal Fontaine, Christophe Ringeissen
Publication date: 2 December 2015
Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01157898/file/bridging-nd-compact.pdf
Related Items
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited, A Rewriting Approach to the Combination of Data Structures with Bridging Theories, Unnamed Item, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, Politeness and combination methods for theories with bridging functions
Cites Work
- Unnamed Item
- Unnamed Item
- Model-theoretic methods in combined constraint satisfiability
- Combining sets with cardinals
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Decision procedures for term algebras with integer constraints
- Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator
- A Gentle Non-disjoint Combination of Satisfiability Procedures
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited
- Combining Theories with Shared Set Operations
- Simplification by Cooperating Decision Procedures
- Hierarchic Superposition with Weak Abstraction
- Polite Theories Revisited
- Combinable Extensions of Abelian Groups
- Locality Results for Certain Extensions of Theories with Bridging Functions
- Decision procedures for algebraic data types with abstractions
- New results on rewrite-based satisfiability procedures
- Connecting many-sorted theories
- Frontiers of Combining Systems
- Logic for Programming, Artificial Intelligence, and Reasoning
