Hard problems for simple logic programs
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Universal finiteness and satisfiability (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Linearizing Some Recursive Logic Programs
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
DATALOG SIRUPs uniform boundedness is undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
On the decidability of the termination problem of active database systems
Theoretical Computer Science
On the minimization of XPath queries
Journal of the ACM (JACM)
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
| Hi-index | 0.89 |