- -

A Framework for Computing Finite SLD Trees

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Framework for Computing Finite SLD Trees

Show full item record

Nishid, N.; Vidal Oriola, GF. (2015). A Framework for Computing Finite SLD Trees. Journal of Logical and Algebraic Methods in Programming. 84(2):197-217. doi:10.1016/j.jlamp.2014.11.006

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/61396

Files in this item

Item Metadata

Title: A Framework for Computing Finite SLD Trees
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
The search space of SLD resolution, usually represented by means of a so-called SLD tree, is often infinite. However, there are many applications that must deal with possibly infinite SLD trees, like partial evaluation or ...[+]
Subjects: Logic programming , Semantics , Program analysis
Copyrigths: Reserva de todos los derechos
Source:
Journal of Logical and Algebraic Methods in Programming. (issn: 2352-2208 )
DOI: 10.1016/j.jlamp.2014.11.006
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.jlamp.2014.11.006
Thanks:
This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economia y Competitividad (Secretaria de Estado de Investigacion, Desarrollo e Innovacion) under grant TIN2013-44742-C4-1-R and by the ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record