![]() |
CiteULike | ![]() |
stavros's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Tractable Disjunctive ConstraintsIn Proceedings 3rd International Conference on Constraint Programming---CP'97 (Linz, October 1997), Vol. 1330 (1996), pp. 478-490.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
Abstract. Many combinatorial search problems can be expressed as `constraint satisfaction problems', and this class of problems is known to be NP-complete in general. In this paper we investigate `disjunctive constraints', that is, constraints which have the form of the disjunction of two constraints of specified types. We show that when the constraint types involved in the disjunction have a certain property, which we call `independence', and when a certain restricted class of problems is tractable,...
BibTeX record
RIS record