Author:
Nguyen Manh Thang,De Schreye Danny
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Apt, K.R.: Logic programming. In: Handbook of theoretical computer science: formal models and semantics, vol. B, pp. 493–574. MIT Press, Cambridge (1990)
2. Bossi, A., Cocco, N., Fabris, M.: Proving termination of logic programs by exploiting term properties. In: TAPSOFT, vol. 2, pp. 153–180 (1991)
3. Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. J. Auto. Reason. (2005)
4. De Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. J. Log. Program. 19-20, 199–260 (1994)
5. De Schreye, D., Serebrenik, A.: Acceptability with general orderings. In: Computational Logic: Logic Programming and Beyond, pp. 187–210. Springer, Heidelberg (2002)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献