Conjunctive-Query Containment and Constraint Satisfaction

This publication has 31 references indexed in Scilit:

• Hypertree Decompositions and Tractable Queries
  Journal of Computer and System Sciences, 2002
• The complexity of acyclic conjunctive queries
  Journal of the ACM, 2001
• An algebraic characterization of tractable constraints
  Published by Springer Nature ,1995
• Structure identification in relational data
  Artificial Intelligence, 1992
• Decomposing a relation into a tree of binary relations
  Journal of Computer and System Sciences, 1990
• Horn clause queries and generalizations
  The Journal of Logic Programming, 1985
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• Computational problems related to the design of normal form relational schemas
  ACM Transactions on Database Systems, 1979
• Maximal sublattices of finite distributive lattices. II
  Proceedings of the American Mathematical Society, 1974
• The decision problem for some classes of sentences without quantifiers
  The Journal of Symbolic Logic, 1943