In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and predicates between them. For reasoning in the DL ALCALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete domains decidability can be regained. Typically, the concrete domain predicates are crisp, which is a limitation for some applications. In this paper we investigate crisp ALCALC in combination with fuzzy concrete domains for general TBoxes, devise conditions for decidability, and give a tableau-based reasoning algorithm.
Merz, D., Penaloza, R., Turhan, A. (2014). Reasoning in ALC with Fuzzy Concrete Domains. In KI 2014: Advances in Artificial Intelligence ; 37th Annual German Conference on AI, Stuttgart, Germany, September 22-26, 2014. Proceedings (pp.171-182). Springer Verlag [10.1007/978-3-319-11206-0_17].
Reasoning in ALC with Fuzzy Concrete Domains
Penaloza R
;
2014
Abstract
In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and predicates between them. For reasoning in the DL ALCALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete domains decidability can be regained. Typically, the concrete domain predicates are crisp, which is a limitation for some applications. In this paper we investigate crisp ALCALC in combination with fuzzy concrete domains for general TBoxes, devise conditions for decidability, and give a tableau-based reasoning algorithm.File | Dimensione | Formato | |
---|---|---|---|
Merz-2014-KI'14-AAM.pdf
accesso aperto
Descrizione: Conference Paper
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Licenza:
Altro
Dimensione
361.16 kB
Formato
Adobe PDF
|
361.16 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.