A Web Odyssey: from Codd to XML
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
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
DS '01 Proceedings of the 4th International Conference on Discovery Science
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
SIGACT news complexity theory column 43
ACM SIGACT News
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties
ACM SIGMOD Record
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Effective rule induction from labeled graphs
Proceedings of the 2006 ACM symposium on Applied computing
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
On the minimization of XPath queries
Journal of the ACM (JACM)
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Efficient core computation in data exchange
Journal of the ACM (JACM)
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
Homomorphism preservation theorems
Journal of the ACM (JACM)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
ACM Computing Surveys (CSUR)
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
The complexity of constraint satisfaction games and QCSP
Information and Computation
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Tractable reasoning in first-order knowledge bases with disjunctive information
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Conditional constraint satisfaction: logical foundations and complexity
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Algorithms for propositional model counting
Journal of Discrete Algorithms
ACM Transactions on Computational Logic (TOCL)
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
A logic-based approach to relation extraction from texts
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Conjunctive query containment over trees
Journal of Computer and System Sciences
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Generic expression hardness results for primitive positive formula comparison
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Conjunctive query evaluation by search tree revisited
ICDT'05 Proceedings of the 10th international conference on Database Theory
Consistent query answers in virtual data integration systems
Inconsistency Tolerance
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Proceedings of the 15th International Conference on Database Theory
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
The Multivariate Algorithmic Revolution and Beyond
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Lower Bounds for Existential Pebble Games and k-Consistency Tests
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Generic expression hardness results for primitive positive formula comparison
Information and Computation
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS) - Invited papers issue
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
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.02 |