360 search results - page 2 / 72 » Constraint Checking with Partial Information |
PEPM
1995
ACM
13 years 9 months ago
1995
ACM
In [23] we presented a partial evaluation scheme for a “real life” subset of Prolog, containing first-order built-in’s, simple side-effects and the operational predicate i...
IFL
2007
Springer
13 years 12 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...
PADO
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
CP
1998
Springer
13 years 10 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...
AI
2007
Springer
13 years 6 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...