Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Unification and Matching in Hierarchical Combinations of Syntactic Theories

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      Ludwig Maximilian University Munich = Ludwig Maximilians Universität München (LMU); The University of New Mexico Albuquerque; New Mexico Consortium (NMC); University of Mary Washington; University at Albany SUNY; State University of New York (SUNY); Combination of approaches to the security of infinite states systems (CASSIS); Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST); Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC); Université Bourgogne Franche-Comté COMUE (UBFC)-Université Bourgogne Franche-Comté COMUE (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC); Université Bourgogne Franche-Comté COMUE (UBFC)-Université Bourgogne Franche-Comté COMUE (UBFC)-Inria Nancy - Grand Est; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM); Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA); Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA); Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS); Carsten Lutz and Silvio Ranise
    • بيانات النشر:
      HAL CCSD
      Springer
    • الموضوع:
      2015
    • Collection:
      Université de Franche-Comté (UFC): HAL
    • الموضوع:
      Wroclaw; Poland
    • نبذة مختصرة :
      International audience ; We investigate a hierarchical combination approach to the unification problem in non-disjoint unions of equational theories. In this approach, the idea is to extend a base theory with some additional axioms given by rewrite rules in such way that the unification algorithm known for the base theory can be reused without loss of completeness. Additional techniques are required to solve a combined problem by reducing it to a problem in the base theory. In this paper we show that the hierarchical combination approach applies successfully to some classes of syntactic theories, such as shallow theories since the required unification algorithms needed for the combination algorithm can always be obtained. We also consider the matching problem in syntactic extensions of a base theory. Due to the more restricted nature of the matching problem, we obtain several improvements over the unification problem.
    • Relation:
      hal-01206669; https://inria.hal.science/hal-01206669; https://inria.hal.science/hal-01206669/document; https://inria.hal.science/hal-01206669/file/combi-syntactic.pdf
    • الرقم المعرف:
      10.1007/978-3-319-24246-0_18
    • الدخول الالكتروني :
      https://inria.hal.science/hal-01206669
      https://inria.hal.science/hal-01206669/document
      https://inria.hal.science/hal-01206669/file/combi-syntactic.pdf
      https://doi.org/10.1007/978-3-319-24246-0_18
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.B89A6CF