268 search results - page 41 / 54 » Equivalence for the G3'-stable models semantics |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
LISP
2006
13 years 7 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...
IANDC
2006
13 years 7 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
ICAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Track 2 - Modeling and Abstraction of Services Process Session Chair: Dynamic Service Invocation Control in Service Composition Environments (SCC2010-2004) ...........................
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...