LATPub122: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Marcel Lippmann (Diskussion | Beiträge)
KKeine Bearbeitungszusammenfassung
 
Marcel Lippmann (Diskussion | Beiträge)
KKeine Bearbeitungszusammenfassung
Zeile 9: Zeile 9:
|Year=1997
|Year=1997
|Month=
|Month=
|Booktitle=Proceedings of the 11th International Workshop on Unification, {UNIF-97}, {LIFO} Technical Report 97-8
|Booktitle=Proceedings of the 11th International Workshop on Unification, UNIF-97, LIFO Technical Report 97-8
|Editor=
|Editor=
|Note=
|Note=

Version vom 20. März 2015, 16:28 Uhr

Toggle side column

Unification of Concept Terms

F. BaaderF. Baader,  P. NarendranP. Narendran
F. Baader, P. Narendran
Unification of Concept Terms
Proceedings of the 11th International Workshop on Unification, UNIF-97, LIFO Technical Report 97-8, 1997. LIFO, Universitè de Orlèans
  • KurzfassungAbstract
    Unification of concept terms in Description Logics can be used

    to determine whether a newly introduced concept may have already been defined before, possibly using other atomic names or modelling concepts on a different level of granularity. We show that unification of concept terms in the small concept description language ${\cal FL}_0$ can be reduced to unification modulo an appropriate equational theory. Using results from unification theory, we can further reduce this unification problem to a formal language problem, which can be solved (in Exptime) with the help of tree automata. It can also be shown that the problem is

    PSPACE hard.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Baader-Narendran-UNIF-97,
  author = {F. {Baader} and P. {Narendran}},
  booktitle = {Proceedings of the 11th International Workshop on Unification, {UNIF-97}, {LIFO} Technical Report 97-8},
  publisher = {LIFO, Universit\`e de Orl\`eans},
  title = {Unification of Concept Terms},
  year = {1997},
}