Reasoning about termination of pure Prolog programs
Information and Computation
Sound and complete partial deduction with unfolding based on well-founded measures
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Proving Termination of Constraint Solver Programs
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
An Abstract Analysis of the Probabilistic Termination of Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Automatic generation of CHR constraint solvers
Theory and Practice of Logic Programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
A glimpse of symbolic-statistical modeling by PRISM
Journal of Intelligent Information Systems
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
Termination Analysis of CHR Revisited
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automating Termination Proofs for CHR
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Constraint Handling Rules
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Automated termination analysis for logic programs with cut*
Theory and Practice of Logic Programming
Chr(prism)-based probabilistic logic learning
Theory and Practice of Logic Programming
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
A hybrid approach to conjunctive partial evaluation of logic programs
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Constraint Handling Rules: Compilation, Execution, and Analysis
Constraint Handling Rules: Compilation, Execution, and Analysis
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog, and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is required. As far as we know, the termination of probabilistic logical programs has not received any attention in the community so far. Termination of a probabilistic program is not a crisp notion. Given a query, such a program does not simply either terminate or not terminate, but it terminates with a certain probability. In this paper, we explore this problem in the context of CHRiSM, a probabilistic extension of CHR. We formally introduce the notion of probabilistic termination. We study this concept on the basis of a number of case studies. We provide some initial sufficient conditions to characterize probabilistically terminating programs and queries. We also discuss some challenging examples that reveal the complexity and interest of more general settings. The paper is intended as a first step in a challenging and important new area in the analysis of Logic Programs.