D. De Schreye and A. Serebrenik. Acceptability with general orderings. In Computational Logic: Logic Programming and Beyond, pages 187--210. Springer Verlag, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Polynomial Interpretations as a Basis - For Termination Analysis Self-citation (De schreye) (Correct)
No context found.
D. De Schreye and A. Serebrenik. Acceptability with general orderings. In Computational Logic: Logic Programming and Beyond, pages 187--210. Springer Verlag, 2002.
Polynomial Interpretations as a Basis - For Termination Analysis Self-citation (De schreye) (Correct)
No context found.
D. De Schreye and A. Serebrenik. Acceptability with general orderings. In Computational Logic: Logic Programming and Beyond, pages 187--210. Springer Verlag, 2002.
Proving Termination With Adornments - Alexander Serebrenik Danny Self-citation (De schreye Serebrenik) (Correct)
No context found.
D. De Schreye and A. Serebrenik. Acceptability with general orderings. In A. C. Kakas and F. Sadri, editors, Computational Logic. Logic Programming and Beyond. Essays in Honour of Robert A. Kowalski, Part I, volume 2407 of Lecture Notes in Computer Science, pages 187--210. Springer Verlag, July 2002.
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
No context found.
D. De Schreye and A. Serebrenik. Acceptability with general orderings. In F. Sadri and A. Kakas, editors, Computational Logic: Logic Programming and Beyond, Part I, volume 2407 of LNCS, pages 187--210. Springer-Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC