1144 search results - page 126 / 229 » Logic programming for combinatorial problems |
106
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
125
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
118
Voted
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....
252
Voted
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
148
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...