• Aucun résultat trouvé

About Subsumption in Fuzzy EL

N/A
N/A
Protected

Academic year: 2022

Partager "About Subsumption in Fuzzy EL"

Copied!
13
0
0

Texte intégral

Références

Documents relatifs

Let us, therefore, abandon the idea that the explananda of Hull's theory are the dependent variables of the theory: it is obvious that intervening variables are supposed to

The creation of the topic feature vectors is a one-time procedure done at the bootstrapping phase of the algorithm, and the resulting topics are used for applying algorithm QSub to

In order to show the feasibility of such an integrated constructive reasoning ap- proach, we here present a prototype implementation in Logic Programming solving Least Common

FL 0 is a lightweight description logic that only allows as concept constructors conjunction, universal role restrictions, and top concept.. The subsumption

The case where K is a class of transitive frames has been considered in [8], and one can easily modify the proofs given there to show that all universal classes of transitive

Borgwardt, S., Peñaloza, R.: Algorithms for reasoning in very expressive descrip- tion logics under infinitely valued Gödel semantics. Bou, F., Cerami, M., Esteva, F.:

The framework has the following advantages: (1) it is easy to under- stand; (2) the simplest algorithm within this framework takes only a few dozen lines of Prolog code and is

A single join actor, the root of the tree, is linked with the output actor (Algorithm 1 presents the way we build the whole network).. Note that all the opera- tions of the actors