Sciweavers

81 search results - page 2 / 17
» Constraint Logic: A Uniform Framework for Modeling Computati...
Sort
View
ICWS
2008
IEEE
13 years 6 months ago
A Framework for the Semantic Composition of Web Services Handling User Constraints
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process....
Youssef Gamha, Nacéra Bennacer, Guy Vidal-N...
CSL
2006
Springer
13 years 8 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
JAIR
2006
102views more  JAIR 2006»
13 years 4 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski
LICS
1994
IEEE
13 years 9 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
MFCS
2001
Springer
13 years 9 months ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine