Sciweavers

2084 search results - page 186 / 417
» Set Constraints in Logic Programming
Sort
View
ICWS
2008
IEEE
13 years 9 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...
ICFEM
2004
Springer
14 years 1 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
ICDE
1992
IEEE
126views Database» more  ICDE 1992»
14 years 13 days ago
Logical Database Design with Inclusion Dependencies
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
Tok Wang Ling, Cheng Hian Goh
ICLP
2009
Springer
14 years 9 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
14 years 2 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...