Skip to main content
Journal ArticleOPEN ACCESS

Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences (2000) 61(2) 302-332
DOI: 10.1006/jcss.2000.1713
247Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Constraint-query containment and constraint satisfaction problems are presented. Three non-uniform tractability results are exhibited. These results uniformize and give rise to polynomial-time solvable cases of constraint satisfaction and conjunctive-query containment.

Cite

CITATION STYLE

APA

Kolaitis, P. G., & Vardi, M. Y. (2000). Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61(2), 302–332. https://doi.org/10.1006/jcss.2000.1713

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free