561 search results - page 92 / 113 » Slicing of Constraint Logic Programs |
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
CASCON
2004
14 years 11 months ago
2004
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
AAAI
1994
14 years 11 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
75
Voted
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...