Modeling ontologies using OWL, Description Graphs, and Rules

The matrix A(G) considered above has an interesting property, when G is any circle graph; it can be transformed into an antisymmetric matrix with integral coefficients, by changing

If the device is being used in parasite power mode, within 10µs (max) after this command is issued the master must enable a strong pullup on the 1-Wire bus for the duration of

In response to this critique, in this paper we present a radically different approach to modelling complex objects via a novel formalism that we call Description Graph Logic

As a remedy, we present a novel semantic acyclicity condition. Roughly speaking, a precedence relation describing allowed implications between DGs is specified by the modeller; a

The purpose of our experiment is to evaluate the utility and scalability of de- scription graphs and rules for the representation of, and reasoning over, chemi-.. The knowledge base

In contrast to existing approaches that either remove data from the knowledge base or try to perform reasoning despite the existence of inconsis- tent information, the

unbounded but tree-like structures can be described using standard DL axioms, and the naturally bounded structured parts can be described using arbitrarily connected description

Condition #3 : Groups should have members of all different nationalities To classify bad groups in regard to this condition we constructed a rule “Same- NationalitiesRule” which