LATPub126: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=This work introduces the concept language ALC F(M), which is an extension of ALC | |Abstract=This work introduces the concept language ALC F(M), which is an extension of ALC to many-valued logics. ALC F(M) allows to express vague concepts, e.g. more or less enlarged or very small. | ||
to many-valued logics. ALC F(M) allows to express vague concepts, e.g. more or | To realize this extension to many-valued logics, the classical notions of satisfiability and subsumption had to be modified appropriately. The main contribution of this paper is a sound and complete method for computing the degree of subsumption between two ALC F(M)-concepts. | ||
less enlarged or very small. | |||
To realize this extension to many-valued logics, the classical notions of | |||
satisfiability and subsumption had to be modified appropriately. The main | |||
contribution of this paper is a sound and complete method for computing the | |||
degree of subsumption between two ALC F(M)-concepts. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 46: | Zeile 39: | ||
year = {1998}, | year = {1998}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
A Description Logic for Vague Knowledge
C.B. TrespC.B. Tresp, R. MolitorR. Molitor
C.B. Tresp, R. Molitor
A Description Logic for Vague Knowledge
Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98), 361-365, 1998. J. Wiley and Sons
A Description Logic for Vague Knowledge
Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98), 361-365, 1998. J. Wiley and Sons
- KurzfassungAbstract
This work introduces the concept language ALC F(M), which is an extension of ALC to many-valued logics. ALC F(M) allows to express vague concepts, e.g. more or less enlarged or very small. To realize this extension to many-valued logics, the classical notions of satisfiability and subsumption had to be modified appropriately. The main contribution of this paper is a sound and complete method for computing the degree of subsumption between two ALC F(M)-concepts. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ TrespMolitor-ECAI-1998,
address = {Brighton, UK},
author = {C.B. {Tresp} and R. {Molitor}},
booktitle = {Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98)},
pages = {361--365},
publisher = {J.~Wiley and Sons},
title = {A Description Logic for Vague Knowledge},
year = {1998},
}
