Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of , we provide upper complexity bounds that match the complexity of crisp reasoning.
Borgwardt, S., Penaloza, R. (2012). A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices. In Web Reasoning and Rule Systems (pp.9-24). Springer Verlag [10.1007/978-3-642-33203-6_3].
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices
Penaloza, R
2012
Abstract
Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of , we provide upper complexity bounds that match the complexity of crisp reasoning.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
