2685 search results - page 195 / 537 » A Formal Semantics for SPKI |
203
click to vote
ECMDAFA
2008
Springer
15 years 8 months ago
2008
Springer
Model transformations support a model-driven design by providing an c translation of abstract models into more concrete ones, and eventually program code. Crucial to a successful a...
185
click to vote
LISP
2006
15 years 6 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
175
click to vote
PPDP
2007
Springer
16 years 27 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
184
click to vote
ESWS
2005
Springer
16 years 9 days ago
2005
Springer
The paper addresses the problem of reasoning with multiple ontologies interrelated with semantic mappings. This problem is becoming more and more relevant due to the necessity of b...
173
click to vote
KCAP
2003
ACM
16 years 1 days ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...