92 search results - page 8 / 19 » Fine hierarchies and m-reducibilities in theoretical compute... |
ERSHOV
2006
Springer
13 years 11 months ago
2006
Springer
We present an approach to support the evolution of online, distributed, reusable, and extendable ontologies based on the RDF data model. The approach works on the basis of atomic c...
IFIPTCS
2000
13 years 11 months ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
ICS
2005
Tsinghua U.
14 years 27 days ago
2005
Tsinghua U.
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our algorithm applies to arbitrary stencils in n-dimension...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far-away plane...