1278 search results - page 72 / 256 » On the Semantics of Logic Program Composition |
NJC
2002
13 years 7 months ago
2002
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
AAAI
2004
13 years 9 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
CLEF
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
ICWS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Several approaches have been proposed to introduce self-management capabilities for web service compositions. However, most of these works are limited as they are not ex...