Results 251 to 260 of about 3,203 (298)

Decidability of SHI with Transitive Closure of Roles. [PDF]

, 2009
This paper investigates a description logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms.
Le Duc, Chan, Chan Le Duc
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Transitive closure and betweenness relations

Fuzzy Sets and Systems, 2001
Peer ...
Boixader Ibáñez, Dionís, Jacas Moral, Juan, Recasens Ferrés, Jorge   +2 more
openaire   +3 more sources

A sensitive transitive closure algorithm

Information Processing Letters, 1981
exaly   +2 more sources

Transitive dependencies in transaction closures

Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156), 2002
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. termination or execution dependencies which are constraints on the occurrence of significant transaction events.
Kerstin Schwarz, Can Türker, Gunter Saake   +2 more
openaire   +1 more source

On computing the transitive closure of a relation

Acta Informatica, 1977
An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon Tarjan's algorithm [7] for finding the strongly connected components of a directed graph. A new formulation, justifying a somewhat simplified statement of the latter, characterises weaker restrictions on the form of the graph traversal than ...
J. Eve, Reino Kurki-Suonio
openaire   +1 more source

Dynamic Plane Transitive Closure

2007
In this paper we study the problem of transitive closure in dynamic directed plane graphs. We show a dynamic algorithm supporting updates and queries in worst-case O(√n) time. This is the first known algorithm for this problem with almost linear update time and query time product.
Krzysztof Diks, Piotr Sankowski
openaire   +1 more source

Polynomial Space and Transitive Closure

SIAM Journal on Computing, 1979
A characterization of PSPACE in terms of the regular sets and certain algebraic closure operations is developed. It is shown that NP = PSPACE if and only if NP is closed under a form of the transitive closure operation.
openaire   +2 more sources

Nested Pebbles and Transitive Closure

2006
First-order logic with k-ary deterministic transitive closure has the same power as two-way k-head deterministic automata that use a finite set of nested pebbles. This result is valid for strings, ranked trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family ...
Joost Engelfriet, Hendrik Jan Hoogeboom
openaire   +1 more source

A Transition Closure Model for Predicting Transition Onset

SAE Technical Paper Series, 1997
<div class="htmlview paragraph">A unified approach which makes it possible to determine the extent and onset of transition in one calculation is presented. It treats the laminar fluctuations in a manner similar to that used in describing turbulence. As a result, the complete flowfield can be calculated using existing CFD codes and without the use
E. S. Warren, H. A. Hassan
openaire   +1 more source

The expressivity of XPath with transitive closure

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2006
We extend Core XPath, the navigational fragment of XPath 1.0, with transitive closure and path equalities. The resulting language, Regular XPATH≈, is expressively complete for FO* (first-order logic extended with a transitive closure operator that can be applied to formulas with exactly two free variables). As a corollary, we obtain that Regular XPATH≈
openaire   +2 more sources