Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Extending SLD resolution to equational horn clauses using E-unification
Journal of Logic Programming
Untyped sets, invention, and computable queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Journal of Computer and System Sciences
Set constructors in a logic database language
Journal of Logic Programming
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Handbook of theoretical computer science (vol. B)
Compilation of set terms in the logic data language (LDL)
Journal of Logic Programming
On the complexity of queries in the logical data model
ICDT Selected papers of the 4th international conference on Database theory
A logic programming view of CLP
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
Complexity of Query Answering in Logic Databases with Complex Values
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
A CLP View of Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
The "Hardest'' Natural Decidable Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Query Rewriting with Symmetric Constraints
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Decision Procedure for Term Algebras with Queues
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Query rewriting with symmetric constraints
AI Communications
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Complexity of higher-order queries
Proceedings of the 14th International Conference on Database Theory
| Hi-index | 0.00 |