A portable prolog predicate for printing rational terms

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2014

Autores

Mantadelis, T (Autor) Outra; Rocha, R (Autor) FCUP

Ata de Conferência Internacional

Título: Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-Based Methods in Programming Environments 2014, CICLOPS-WLPE 2014

Páginas: 141-154

International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-Based Methods in Programming Environments 2014, CICLOPS-WLPE 2014

17 July 2014 through 18 July 2014

Indexação

ISI Web of Knowledge

Scopus - 0 Citações

Outras Informações

ID Authenticus: P-00G-MQ8

Abstract (EN): Rational terms or rational trees are terms with one or more infinite sub-terms but with a finite representation. Rational terms appeared as a side effect of omitting the occurs check in the unification of terms, but their support across Prolog systems varies and often fails to provide the expected functionality. A common problem is the lack of support for printing query bindings with rational terms. In this paper, we present a survey discussing the support of rational terms among different Prolog systems and we propose the integration of a Prolog predicate, that works in several existing Prolog systems, in order to overcome the technical problem of printing rational terms. Our rational term printing predicate could be easily adapted to work for the top query printouts, for user printing and for debugging purposes.

Idioma: Inglês

Tipo (Avaliação Docente): Científica