700 search results - page 76 / 140 » On Termination of Constraint Logic Programs |
CSL
2004
Springer
15 years 4 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
117
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
DAGSTUHL
1998
15 years 16 days ago
1998
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
FLOPS
2006
Springer
15 years 2 months ago
2006
Springer
We describe the design and implementation of a trust-management system Soutei, a dialect of Binder, for access control in distributed systems. Soutei policies and credentials are w...
TCS
1998
14 years 10 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...