Conjunctive-query containment and constraint satisfaction
type: Item
instance of: scholarly article
title: Conjunctive-query containment and constraint satisfaction
zbMATH Open document ID: 0963.68059
author: Phokion G. Kolaitis
author: Moshe Y. Vardi
published in: Journal of Computer and System Sciences
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1546524
zbMATH Keywords: conjunctive-query containment
MaRDI profile type: Publication
full work available at URL: jcss.2000.1713
OpenAlex ID: W4254380579
Wikidata QID: Q56168970
cites work: Q4864249
cites work: Constraint satisfaction from a deductive viewpoint
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: Horn clause queries and generalizations
cites work: Q4232773
cites work: Conjunctive query containment revisited
cites work: Decomposing a relation into a tree of binary relations
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Tree clustering for constraint networks
cites work: Structure identification in relational data
cites work: Monotone monadic SNP and constraint satisfaction
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Q3666827
cites work: Q4198056
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: On the complexity of H-coloring
cites work: On the algebraic structure of combinatorial problems
cites work: Infinitary logics and 0-1 laws
cites work: On the expressive power of Datalog: tools and a case study.
cites work: Q4389333
cites work: The decision problem for some classes of sentences without quantifiers
cites work: The complexity of constraint satisfaction revisited
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q3221403
cites work: Maximal Sublattices of Finite Distributive Lattices. II
cites work: The complexity of satisfiability problems
cites work: Information integration using logical views
cites work: Q4385515
cites work: Node-Deletion Problems on Bipartite Graphs
DBLP publication ID: journals/jcss/KolaitisV00
DOI: 10.1006/JCSS.2000.1713
description: scientific article; zbMATH DE number 1546524