29 search results - page 5 / 6 » A Finite Basis for Failure Semantics |
DAGM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
DEDS
2007
13 years 6 months ago
2007
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
AC
2000
Springer
13 years 10 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
LPKR
1997
Springer
13 years 10 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
OTM
2009
Springer
14 years 25 days ago
2009
Springer
Collaboration in modeling is essential to success, but ORM diagrams intimidate many business people, and most would never install an ORM modeling tool on their computers. The Const...