NTI
Abstract
NTI (Non-Termination Inference) is a non-termination prover for term-rewriting systems and logic programs.
![]()
Cites hal-04436108v1 Journal article Etienne Payet. Non-termination in Term Rewriting and Logic Programming. Journal of Automated Reasoning, 2024, 68 (4), pp.24. ⟨10.1007/s10817-023-09693-z⟩. ⟨hal-04436108⟩
![]()
Cites hal-04458773v1 Conference output Etienne Payet. Guided Unfoldings for Finding Loops in Standard Term Rewriting. 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Fred Mesnard; Peter J. Stuckey, Sep 2018, Frankfurt/Main, Germany. pp.22-37, ⟨10.1007/978-3-030-13838-7_2⟩. ⟨hal-04458773⟩