3009 search results - page 127 / 602 » The Expressive Rate of Constraints |
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
CP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
DALT
2003
Springer
15 years 3 months ago
2003
Springer
Computees are abstractions of the entities that populate global and open computing environments. The societies that they populate give an institutional meaning to their interaction...
KES
1998
Springer
15 years 2 months ago
1998
Springer
Many events in the world occur with some quantity that shows a level of the occurrence. This paper discusses reasoning with the normalized level of the occurrence, which we call i...