Unification and Matching in Hierarchical Combinations of Syntactic Theories

DOI10.1007/978-3-319-24246-0_18zbMath1471.68108OpenAlexW2200038788MaRDI QIDQ2964469

Deepak Kapur, Serdar Erbatur, Paliath Narendran, Andrew M. Marshall, 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-01206669/file/combi-syntactic.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in a combination of arbitrary disjoint equational theories
• Combining matching algorithms: The regular case
• A proof theory for general unification
• Complete sets of transformations for general E-unification
• Decidability and complexity analysis by basic paramodulation
• Syntacticness, cycle-syntacticness and shallow theories
• Combining unification algorithms
• Combining decision algorithms for matching in the union of disjoint equational theories
• Unification in the union of disjoint equational theories: Combining decision procedures
• Term Rewriting and All That
• Hierarchical Combination
• On Asymmetric Unification and the Combination Problem in Disjoint Theories

This page was built for publication: Unification and Matching in Hierarchical Combinations of Syntactic Theories