Title: Tor : extensible search with hookable disjunction
Authors: Schrijvers, Tom
Triska, Markus
Demoen, Bart #
Issue Date: Sep-2012
Publisher: ACM SIGPLAN
Host Document: Principles and Practice of Declarative Programming, 14th International symposium pages:103-114
Conference: Principles and Practice of Declarative Programming edition:14 location:Leuven date:19-21 September 2012
Abstract: Horn Clause Programs have a natural depth-first procedural semantics. However, for many programs this procedural semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches.
Tor, a well-defined hook into Prolog disjunction, provides this ability. It is light-weight thanks to its library approach and efficient because it is based on program transformation. Tor is general enough to mimic search-modifying predicates like ECLiPSe's search/6. Moreover, Tor supports modular composition of search methods and other hooks. Our library is already provided and used as an add-on to SWI-Prolog.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:
File Description Status SizeFormat
paper2.pdf Published 422KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.