Optimized algorithms for the incremental analysis of logic programs

Puebla Sánchez, Alvaro Germán y Hermenegildo, Manuel V. (1996). Optimized algorithms for the incremental analysis of logic programs. En: "Third International Symposium, SAS '96", September 24 - 26, 1996, Aachen, Germany. ISBN 9783540617396.

Descripción

Título: Optimized algorithms for the incremental analysis of logic programs
Autor/es:
  • Puebla Sánchez, Alvaro Germán
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Third International Symposium, SAS '96
Fechas del Evento: September 24 - 26, 1996
Lugar del Evento: Aachen, Germany
Título del Libro: Optimized algorithms for incremental analysis of logic programs
Fecha: 1996
ISBN: 9783540617396
Volumen: 1145
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (921kB) | Vista Previa

Resumen

Global analysis of logic programs can be performed effectively by the use of one of several existing efficient algorithms. However, the traditional global analysis scheme in which all the program code is known in advance and no previous analysis information is available is unsatisfactory in many situations. Incrementa! analysis of logic programs has been shown to be feasible and much more efficient in certain contexts than traditional (non-incremental) global analysis. However, incremental analysis poses additional requirements on the fixpoint algorithm used. In this work we identify these requirements, present an important class of strategies meeting the requirements, present sufficient a priori conditions for such strategies, and propose, implement, and evalúate experimentally a novel algorithm for incremental analysis based on these ideas. The experimental results show that the proposed algorithm performs very efficiently in the incremental case while being comparable to (and, in some cases, considerably better than) other state-of-the-art analysis algorithms even for the non-incremental case. We argüe that our discussions, results, and experiments also shed light on some of the many tradeoffs involved in the design of algorithms for logic program analysis.

Más información

ID de Registro: 14409
Identificador DC: http://oa.upm.es/14409/
Identificador OAI: oai:oa.upm.es:14409
URL Oficial: http://link.springer.com/chapter/10.1007%2F3-540-61739-6_47?LI=true
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 05 Feb 2013 19:54
Ultima Modificación: 21 Abr 2016 14:03
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM