Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Perspectives on database theory
ACM SIGACT News
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inherent complexity of recursive queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
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
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Computability by Sequences of Queries
Fundamenta Informaticae
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
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
Computability by Sequences of Queries
Fundamenta Informaticae
Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines
Fundamenta Informaticae
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
| Hi-index | 0.00 |