| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4945349 | International Journal of Approximate Reasoning | 2017 | 42 Pages |
Abstract
In this paper, we introduce two new algorithms for reasoning in very expressive FDLs under Gödel semantics. They combine the ideas of a previous automata-based algorithm for Gödel FDLs with the known crispification and tableau approaches for FDL reasoning. The results are the two first practical algorithms capable of reasoning in infinitely valued FDLs supporting general concept inclusions.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Stefan Borgwardt, Rafael Peñaloza,