5130 search results - page 486 / 1026 » Constraint Query Languages |
249
click to vote
IFL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
188
click to vote
LOPSTR
2007
Springer
16 years 1 months ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
138
click to vote
CP
2003
Springer
16 years 3 days ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
195
click to vote
FM
1997
Springer
15 years 11 months ago
1997
Springer
At rst sight, real-time and asynchronous message passing like in SDL and ROOM seem to be incompatible. Indeed these languages fail to model real-time constraints accurately. In thi...
226
click to vote
CGO
2011
IEEE
14 years 10 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...