Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
We research whether the inclusion of information about an information user's social environment and his position in the social network of his peers leads to an improval in sea...
Sebastian Marius Kirsch, Melanie Gnasa, Armin B. C...
In the same way as the “static” Semantic Web deals with data model and language heterogeneity and semantics that lead to RDF and OWL, there is language heterogeneity and the ne...
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
Nick Bassiliades, Grigoris Antoniou, Ioannis P. Vl...
Our work deals with schema or ontology matching and is driven by the following statements: (1) Most of works only consider intensional description of schemas; (2) They mostly use s...