2845 search results - page 136 / 569 » Constraints over Ontologies |
140
click to vote
SLP
1993
15 years 7 months ago
1993
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
175
click to vote
VVEIS
2007
15 years 7 months ago
2007
Research in web services has allowed reusable, distributed, loosely coupled components which can easily be composed to build systems or to produce more complex services. Compositio...
170
click to vote
CSCLP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
217
click to vote
PACT
1999
Springer
15 years 10 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
296
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...