589 search results - page 21 / 118 » Introducing Dynamic Constraints in B |
116
click to vote
CP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
116
Voted
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
112
click to vote
SSDBM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. With the drastic increase of object trajectory data, the analysis and exploration of trajectories has become a major research focus with many applications. In particular,...
128
Voted
ALT
2006
Springer
15 years 7 months ago
2006
Springer
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a par...
133
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...