2911 search results - page 57 / 583 » A Logic of Graph Constraints |
DATE
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
FUZZY
2004
Springer
14 years 3 months ago
2004
Springer
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...