Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
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
Bounded Nondeterminism of Logic Programs
Annals of Mathematics and Artificial Intelligence
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
On termination of binary CLP programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Deciding the bisimilarity relation between datalog goals
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Hi-index | 0.00 |