We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive denitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
Borgwardt, S., Leyva Galano JA, ., Peñaloza, R. (2014). Gödel FL0 with Greatest Fixed-Point Semantics. In 27th International Workshop on Description Logics, DL 2014: July 17–20, 2014, Vienna, Austria (pp.71-82). CEUR.
Gödel FL0 with Greatest Fixed-Point Semantics
Peñaloza R
2014
Abstract
We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive denitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
BoLP-DL14.pdf
accesso aperto
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Dimensione
407.67 kB
Formato
Adobe PDF
|
407.67 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
