| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 397641 | International Journal of Approximate Reasoning | 2014 | 22 Pages |
Abstract
The contribution of the paper is twofold. On the one hand, we provide a tableaux-based algorithm for deciding consistency when the underlying lattice is finite. The algorithm generalizes the one developed for classical SHI. On the other hand, we identify decidable and undecidable classes of fuzzy Description Logics over infinite lattices. For all the decidable classes, we also provide tight complexity bounds.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Stefan Borgwardt, Rafael Peñaloza,