Logo image
Back
The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics
Conference proceeding   Open access  Peer reviewed

The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics

Stefan Borgwardt, Jose A. Leyva Galano and R Peñaloza
Logics in Artificial Intelligence: 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014 : Proceedings, pp.62-76
Lecture Notes in Computer Science, 8761
14th European Conference On Logics In Artificial Intelligence, JELIA 2014 (Madeira, 24/09/2014 - 26/09/2014)
2014
DOI: https://doi.org/10.1007/978-3-319-11558-0_5
Handle:
https://hdl.handle.net/10863/33503

Abstract

We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel t-norm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is PSpace-complete. If the definitions do not contain cycles, subsumption becomesco-NP-complete.
pdf
BoLP-JELIA14434.71 kBDownloadView
Open Access
url
https://link.springer.com/chapter/10.1007/978-3-319-11558-0_5View

Details

Metrics

1 Record Views