Logo image
Finite Lattices Do Not Make Reasoning in ALCI Harder
Conference proceeding   Open access  Peer reviewed

Finite Lattices Do Not Make Reasoning in ALCI Harder

Stefan Borgwardt and R Peñaloza
Proceedings of the 7th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2011), collocated with the 10th International Semantic Web Conference (ISWC 2011): Bonn, Germany, October 23, 2011, pp.51-62
CEUR Workshop Proceedings
7th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2011) (Bonn, 23/10/2011 - 23/10/2011)
2011
Handle:
https://hdl.handle.net/10863/26402

Abstract

We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.
pdf
proceedings2.38 MBDownloadView
Open Access
url
https://ceur-ws.org/Vol-778/View
url
http://ceur-ws.org/Vol-778/paper5.pdfView

Details

Metrics

22 File views/ downloads
3 Record Views