Building tractable disjunctive constraints

Abstract

Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more… (More)
DOI: 10.1145/355483.355485

Topics

Statistics

0510'01'03'05'07'09'11'13'15'17
Citations per Year

60 Citations

Semantic Scholar estimates that this publication has 60 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Cohen2000BuildingTD, title={Building tractable disjunctive constraints}, author={David A. Cohen and Peter Jeavons and Peter Jonsson and Manolis Koubarakis}, journal={J. ACM}, year={2000}, volume={47}, pages={826-853} }