949 search results - page 7 / 190 » Theory of Constraints |
94
Voted
TPLP
2008
15 years 10 days ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
92
Voted
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
83
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
94
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
83
Voted
ICLP
1994
Springer
15 years 4 months ago
1994
Springer
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...