A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
In this paper we give an overview of the Foafing the Music system. The system uses the Friend of a Friend (FOAF) and Rich Site Summary (RSS) vocabularies for recommending music t...
In a series of publications, we have proposed a foundational system of ontological categories which has been used to evaluate and improve the quality of conceptual modeling languag...
State-of-the-art statistical parsing models applied to free word-order languages tend to underperform compared to, e.g., parsing English. Constituency-based models often fail to c...