The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Inductive pebble games and the expressive power of datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
The effect of two cycles on the complexity of colouring by directed graphs
Discrete Applied Mathematics
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Datalog vs. polynomial time (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Stable networks and product graphs
Stable networks and product graphs
The complexity of circuit value and network stability
Journal of Computer and System Sciences
On the expressive power of datalog: tools and a case study
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Closure properties of constraints
Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Complexity of homomorphisms to direct products of graphs
Information Processing Letters
Uniform and nonuniform recognizability
Theoretical Computer Science
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Composing schema mappings: second-order dependencies to the rescue
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraints, consistency and closure
Artificial Intelligence
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Constraint satisfaction parameterized by solution size
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Satisfiability of Inequalities in a Poset
Fundamenta Informaticae
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |