351 search results - page 14 / 71 » Perfect Constraints Are Tractable |
CP
2008
Springer
13 years 9 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
AAAI
1994
13 years 9 months ago
1994
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
DLOG
2011
12 years 11 months ago
2011
Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interference between nodes directly limits the capacity of mobile ad hoc networks. This paper focuses on spatial interference cancelation with perfect channel state infor...