700 search results - page 68 / 140 » On Termination of Constraint Logic Programs |
PPDP
2001
Springer
15 years 3 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
109
click to vote
JMLR
2012
13 years 1 months ago
2012
We propose a novel mixtures of Gaussian processes model in which the gating function is interconnected with a probabilistic logical model, in our case Markov logic networks. In th...
DOCENG
2009
ACM
15 years 5 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
153
click to vote
POPL
2011
ACM
14 years 2 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
PLDI
2004
ACM
15 years 4 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...