Conjunctive-query containment and constraint satisfaction
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 205-213
- https://doi.org/10.1145/275487.275511
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the algebraic structure of combinatorial problemsTheoretical Computer Science, 1998
- On the Expressive Power of Datalog: Tools and a Case StudyJournal of Computer and System Sciences, 1995
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Structure identification in relational dataArtificial Intelligence, 1992
- Infinitary logics and 0–1 lawsInformation and Computation, 1992
- Decomposing a relation into a tree of binary relationsJournal of Computer and System Sciences, 1990
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- Maximal sublattices of finite distributive lattices. IIProceedings of the American Mathematical Society, 1974
- The decision problem for some classes of sentences without quantifiersThe Journal of Symbolic Logic, 1943