561 search results - page 63 / 113 » Slicing of Constraint Logic Programs |
104
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
126
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
104
click to vote
ENTCS
2008
14 years 12 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...
112
click to vote
KBSE
2010
IEEE
14 years 10 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...