3009 search results - page 252 / 602 » The Expressive Rate of Constraints |
192
click to vote
CONTEXT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
139
click to vote
ESWS
2007
Springer
16 years 24 days ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
188
click to vote
PADL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
180
click to vote
LFCS
2009
Springer
15 years 11 months ago
2009
Springer
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
172
click to vote
AISC
1994
Springer
15 years 10 months ago
1994
Springer
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...