Connecting Many-Sorted Theories

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Toggle side column

Connecting Many-Sorted Theories

Franz BaaderFranz Baader,  Silvio GhilardiSilvio Ghilardi
Franz Baader, Silvio Ghilardi
Connecting Many-Sorted Theories
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume LTCS-05-04, 2005. LTCS-Report
  • KurzfassungAbstract
    Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme.
  • Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BaaderGhilardiLTCS-05-04,
  address = {Germany},
  author = {Franz {Baader} and Silvio {Ghilardi}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-04},
  title = {Connecting Many-Sorted Theories},
  type = {LTCS-Report},
  year = {2005},
}