128 search results - page 24 / 26 » Class Algebra for Ontology Reasoning |
FLOPS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
117
click to vote
LICS
1998
IEEE
15 years 1 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
CALCO
2007
Springer
15 years 3 months ago
2007
Springer
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatype...
74
Voted
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
86
Voted
GI
2009
Springer
14 years 7 months ago
2009
Springer
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...