Memorias de investigación
Artículos en revistas:
Supporting Pruning in Tabled LP
Año:2013
Áreas de investigación
  • Ciencias de la computación y tecnología informática
Datos
Descripción
This paper analyzes issues which appear when supporting pruning operators in tabled LP. A version of the once/1 control predicate tailored for tabled predicates is presented, and an implementation analyzed and evaluated. Using once/1 with answer-on-demand strategies makes it possible to avoid computing unneeded solutions for problems which can benefit from tabled LP but in which only a single solution is needed, such as model checking and planning. The proposed version of once/1 is also directly applicable to the efficient implementation of other optimizations, such as early completion, cut-fail loops (to, e.g., prune at the top level), if-then-else, and constraint-based branch-and-bound optimization. Although once/1 still presents open issues such as dependencies of tabled solutions on program history, our experimental evaluation confirms that it provides an arbitrarily large efficiency improvement in several application areas.
Internacional
Si
JCR del ISI
No
Título de la revista
Practical Aspects of Declarative Languages (PADL'13), LNCS, Springer Verlag
ISSN
978-3-642-45283-3
Factor de impacto JCR
0,23
Información de impacto
Volumen
7752
DOI
Número de revista
Desde la página
60
Hasta la página
76
Mes
ENERO
Ranking
CORE: B. CiteseerX position (ave) top 23%, impact (ave) 0.230. Average position: top 44%.
Esta actividad pertenece a memorias de investigación
Participantes
Grupos de investigación, Departamentos, Centros e Institutos de I+D+i relacionados
  • Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
  • Departamento: Inteligencia Artificial