A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Closure properties of constraints
Journal of the ACM (JACM)
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 2nd International Conference on Database Theory
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Theory of Relational Databases
Theory of Relational Databases
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Improving ASP Instantiators by Join-Ordering Methods
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On Tractable Queries and Constraints
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Efficient evaluation of n-ary conjunctive queries over trees and graphs
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
On the complexity of deriving schema mappings from database instances
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A tractability result for reasoning with incomplete first-order knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coupling CSP decomposition methods and diagnosis algorithms for tree-structured systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Undecidability and intractability results concerning datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
Schema mapping discovery from data instances
Journal of the ACM (JACM)
A greedy algorithm for constructing a low-width generalized hypertree decomposition
Proceedings of the 13th International Conference on Database Theory
GRN model of probabilistic databases: construction, transition and querying
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Scalable query rewriting: a graph-based approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Journal of Computer and System Sciences
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Theory and Practice of Logic Programming
Tractable queries for lightweight description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |