11 citations · 57 across the 11 of their papers we have counts for
1 paper · 1 filter
E. Komendantskaya, P. Johann, M. Schmidt
Automated analysis of recursive derivations in logic programming is known to be a hard problem. Both termination and non-termination are undecidable problems in Turing-complete lan…