Sciweavers

2688 search results - page 192 / 538
» A formal semantics for P3P
Sort
View
LISP
2006
105views more  LISP 2006»
15 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
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...
Paul Blain Levy
PPDP
2007
Springer
16 years 21 days ago
A simple rewrite notion for call-time choice semantics
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...
Francisco Javier López-Fraguas, Juan Rodr&i...
ESWS
2005
Springer
16 years 3 days ago
DRAGO: Distributed Reasoning Architecture for the Semantic Web
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...
Luciano Serafini, Andrei Tamilin
KCAP
2003
ACM
15 years 11 months ago
Using transformations to improve semantic matching
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...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
ESWS
2010
Springer
15 years 11 months ago
Reactive Policies for the Semantic Web
Semantic Web policies are general statements defining the behavior of a system that acts on behalf of real users. These policies have various applications ranging from dynamic age...
Piero A. Bonatti, Philipp Kärger, Daniel Olme...