1144 search results - page 128 / 229 » Logic programming for combinatorial problems |
131
Voted
PPDP
2004
Springer
15 years 8 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
235
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
129
click to vote
EMSOFT
2009
Springer
15 years 6 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
116
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
116
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...