Sciweavers

961 search results - page 59 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
PPOPP
2012
ACM
13 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CONCUR
2010
Springer
14 years 11 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt
ICLP
2009
Springer
15 years 10 months ago
Constraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
Martin Gebser, Max Ostrowski, Torsten Schaub
ICDS
2009
IEEE
15 years 4 months ago
PaTac: Urban, Ubiquitous, Personalized Services for Citizens and Tourists
This paper presents the general design of an architecture, based on software agents and oriented to the semantic Web, for the development and deployment of urban, ubiquitous servi...
Luigi Ceccaroni, Victor Codina, Manel Palau, Marc ...
ECOWS
2007
Springer
15 years 4 months ago
A Framework for Dynamic Web Services Composition
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...
Freddy Lécué, Eduardo Silva, Lu&iacu...