We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Calautti, Marco Greco, Sergio and Trubitsyna, Irina 2017. Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols. ACM Transactions on Computational Logic, Vol. 18, Issue. 4, p. 1.
CALAUTTI, MARCO GRECO, SERGIO MOLINARO, CRISTIAN and TRUBITSYNA, IRINA 2016. Using linear constraints for logic program termination analysis. Theory and Practice of Logic Programming, Vol. 16, Issue. 03, p. 353.
CALAUTTI, MARCO GRECO, SERGIO SPEZZANO, FRANCESCA and TRUBITSYNA, IRINA 2015. Checking termination of bottom-up evaluation of logic programs with function symbols. Theory and Practice of Logic Programming, Vol. 15, Issue. 06, p. 854.
GRECO, SERGIO MOLINARO, CRISTIAN and TRUBITSYNA, IRINA 2013. Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments. Theory and Practice of Logic Programming, Vol. 13, Issue. 4-5, p. 737.
Dershowitz, Nachum and Castedo Ellerman, E. 2007. Leanest quasi-orderings. Information and Computation, Vol. 205, Issue. 4, p. 535.
The term meta-programming refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis for a broad class of practical meta-interpreters, including negation and performing different tasks during the execution. It is based on combining the power of general orderings, used in proving termination of term-rewrite systems and programs, and on the well-known acceptability condition, used in proving termination of logic programs. The methodology establishes a relationship between the ordering needed to prove termination of the interpreted program and the ordering needed to prove termination of the meta-interpreter together with this interpreted program. If such a relationship is established, termination of one of those implies termination of the other one, i.e. the meta-interpreter preserves termination. Among the meta-interpreters that are analysed correctly are a proof trees constructing meta-interpreter, different kinds of tracers and reasoners.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
