Non-Termination Inference of Logic Programs
<|reference_start|>Non-Termination Inference of Logic Programs: We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argument positions from the text of a program. Atomic left looping queries are generated bottom-up from selected subsets of the binary unfoldings of the program of interest. We propose a set of correct algorithms for automating the approach. Then, non-termination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool. An experimental evaluation is reported. When termination and non-termination analysis produce complementary results for a logic procedure, then with respect to the leftmost selection rule and the language used to describe sets of atomic queries, each analysis is optimal and together, they induce a characterization of the operational behavior of the logic procedure.<|reference_end|>
@article{payet2004non-termination,
    title={Non-Termination Inference of Logic Programs},
    author={Etienne Payet and Fred Mesnard},
    journal={arXiv preprint arXiv:cs/0406041},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0406041},
    primaryClass={cs.PL cs.LO}
}