CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Tractable Disjunctive Constraints Export

In Proceedings 3rd International Conference on Constraint Programming---CP'97 (Linz, October 1997), Vol. 1330 (1996), pp. 478-490.

Citation Format

[Posts]

View FullText article


stavros's tags for this article

ai csp

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X 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,...


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.