The intuitive simplicity of the so-called is-a (or subsumption) relationship has led to widespread ontological misuse. Where previous work has focused largely on the semantics of the relationship itself, we concentrate here on the ontological nature of its arguments, in order to tell whether a single is-a link is ontologically well-founded. For this purpose, we introduce some techniques based o...

While there has been a growing body of work on word embeddings, and recent directions better reflect sense-level representations, evaluation remains a challenge. We propose a method of query inventory generation for embedding evaluation that recasts the principle of subsumption preservation, a desirable property of semantic graph-based similarity measures, as a comparative similarity measure as...

Most deductive databases impose restrictions on the terms that can be used in them: they require that generated tuples be fully ground, i.e. contain no variables. Without this restriction, query evaluation of general programs needs subsumption tests in order to terminate correctly, and subsumption tests are expensive. We study a class of programs that can handle terms with both variables and fu...

In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that the subsumption problem for ordered clauses is NP-complete, as similar as the subsumption problem for ordinal clauses. Hence, the definition that a clause is a set of literals is inessential for the intractability of subs...

A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple t2. Therefore, the subsumed tuple t2 can be ignored with respect to Q in the presence of tuple t1 in relation R. This property nds use in a large number of problems. For instance: during query optimization subsumed tu...

We present a taxonomy automatically generated from the system of categories in Wikipedia. Categories in the resource are identified as either classes or instances and included in a large subsumption, i.e. isa, hierarchy. The taxonomy is made available in RDFS format to the research community, e.g. for direct use within AI applications or to bootstrap the process of manual ontology creation.

This article discusses the use of microservices in context HR processes and proposes a specific architecture to achieve this goal. The is interest everyone who interested improving using latest technologies.

We present a non-standard interpretation for concept expressions in ALCQ that defines approximate notions of subsumption based on approximating a subset of the concept and role names. We present the non-standard semantics, and the corresponding notion of approximate subsumption, discuss its formal properties and show that is can be computed by syntactic manipulations of concept expressions.