1144 search results - page 95 / 229 » Logic programming for combinatorial problems |
99
Voted
EPIA
2007
Springer
15 years 8 months ago
2007
Springer
As we face the real possibility of modelling agent systems capable of non-deterministic self-evolution, we are confronted with the problem of having several different possible futu...
208
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
112
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
125
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
112
click to vote
ECCC
2002
15 years 2 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...