A Rewriting Approach to the Combination of Data Structures with Bridging Theories
From MaRDI portal
Publication:2964468
DOI10.1007/978-3-319-24246-0_17zbMath1471.68107OpenAlexW2294882755MaRDI QIDQ2964468
Paula Chocron, Pascal Fontaine, Christophe Ringeissen
Publication date: 27 February 2017
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01206187/file/ds-bridging.pdf
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Model-theoretic methods in combined constraint satisfiability
- Combining nonstably infinite theories
- Combination of convex theories: modularity, deduction completeness, and explanation
- A rewriting approach to satisfiability procedures.
- 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
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Term Rewriting and All That
- 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
This page was built for publication: A Rewriting Approach to the Combination of Data Structures with Bridging Theories
