Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Termination Analysis for Tabled Logic Programming
LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Termination of well-typed logic programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
Classes of terminating logic programs
Theory and Practice of Logic Programming
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Proving correctness and completeness of normal programs – a declarative approach
Theory and Practice of Logic Programming
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
The dependency triple framework for termination of logic programs
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Input-termination of logic programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Exploiting sparsity in polyhedral analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
Mutual exclusion by interpolation
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
| Hi-index | 5.23 |