Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
Stijn Heymans, Jos de Bruijn, Livia Predoiu, Crist...
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The proposals are non-equi...