243 search results - page 29 / 49 » An Algebra for Composing Ontologies |
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
QSIC
2007
IEEE
14 years 2 months ago
2007
IEEE
Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system ...
COORDINATION
2007
Springer
14 years 2 months ago
2007
Springer
We investigate, in a process algebraic setting, a new notion of compliance that we call strong service compliance: composed services are strong compliant if their composition is bo...