118 search results - page 12 / 24 » Constraint Functional Logic Programming over Finite Domains |
120
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
ENTCS
2008
14 years 9 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
171
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...