The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Conjunctive-query containment and constraint satisfaction
Open accessAbstract
in database query evaluation and optimization, At the mtx bitnc, constraint satisfaction is recognized as A fnndamcntal problem in artificial intelligence.What do mlljunctive-query containment and constraint satisfaction linvc In common?Our main conceptual contribution in this paper iR to point out, that, despite their very different formu-
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
The complexity of satisfiability problems
Schaefer, T. J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804350 · Cited by 1,737
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,629
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Encyclopedia of Artificial Intelligence
(2009) · IGI Global eBooks · doi:10.4018/978-1-59904-849-9 · Cited by 1,396
Networks of constraints: Fundamental properties and applications to picture processing
Montanari, U. (1974) · Information Sciences · doi:10.1016/0020-0255(74)90008-5 · Cited by 1,275
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
Feder, T., & Vardi, M. Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794266766 · Cited by 1,030
Self-citationLinear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
Algorithms for constraint-satisfaction problems: a survey
Kumar, V. (1992) · doi:10.1609/aimag.v13i1.976 · Cited by 874
On the complexity of H-coloring
Hell, P., & Nešetřil, J. (1990) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(90)90132-j · Cited by 665
Tree clustering for constraint networks
Dechter, R., & Pearl, J. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90037-4 · Cited by 539
Levy, A. Y., Mendelzon, A. O., Sagiv, Y., & Srivastava, D. (1999) · The MIT Press eBooks · doi:10.7551/mitpress/4472.003.0012 · Cited by 538
Computational problems related to the design of normal form relational schemas
Beeri, C., & Bernstein, P. A. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320066 · Cited by 461
Answering queries using views (extended abstract)
Levy, A. Y., Mendelzon, A. O., & Sagiv, Y. (1995) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/212433.220198 · Cited by 407
Conjunctive query containment revisited
Chekuri, C., & Rajaraman, A. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00220-0 · Cited by 316
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
Node-Deletion Problems on Bipartite Graphs
Yannakakis, M. (1981) · SIAM Journal on Computing · doi:10.1137/0210022 · Cited by 306
On the complexity of bounded-variable queries (extended abstract)
Vardi, M. Y. (1995) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/212433.212474 · Cited by 235
Self-citationAnswering Queries using Templates with Binding Patterns
Rajaraman, A., Sagiv, Y., & Ullman, J. D. (1995) · Symposium on Principles of Database Systems · Cited by 227
Decomposing constraint satisfaction problems using database techniques
Gyssens, M., Jeavons, P. G., & Cohen, D. A. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90003-5 · Cited by 173
Answering queries using templates with binding patterns (extended abstract)
Rajaraman, A., Sagiv, Y., & Ullman, J. D. (1995) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/212433.220199 · Cited by 173
On the expressive power of datalog: tools and a case study
Kolaitis, P. G., & Vardi, M. Y. (1990) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/298514.298542 · Cited by 155
Self-citationMonotone monadic SNP and constraint satisfaction
Feder, T., & Vardi, M. Y. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167245 · Cited by 137
Self-citationStructure identification in relational data
Dechter, R., & Pearl, J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90009-m · Cited by 130
On the Expressive Power of Datalog: Tools and a Case Study
Kolaitis, P. G., & Vardi, M. Y. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1055 · Cited by 112
Self-citationHypertree decompositions and tractable queries
Gottlob, G., Leone, N., & Scarcello, F. (1999) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/303976.303979 · Cited by 110
A unifying framework for tractable constraints
Jeavons, P., Cohen, D. A., & Gyssens, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60299-2_17 · Cited by 58
The complexity of constraint satisfaction revisited
Mackworth, A. K., & Freuder, E. C. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90170-g · Cited by 56
Jeavons, P., Cohen, D. A., & Gyssens, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61551-2_80 · Cited by 41
The complexity of acyclic conjunctive queries
Gottlob, G., Leone, N., & Scarcello, F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743521 · Cited by 33
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Green, T. J., Karvounarakis, G., & Tannen, V. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265535 · Cited by 812
A comparison of structural CSP decomposition methods
Gottlob, G., Leone, N., & Scarcello, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00078-3 · Cited by 328
Metadata
- Authors
- Kolaitis, P. G., & Vardi, M. Y.
- Venue
- Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 1998-05
- Pages
- 205-213
- OpenAlex
- W2026745535
- Cited by
- 387
- References
- 33
- FWCI
- 12.77
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.