Ghent University Academic Bibliography

Advanced

Tor: extensible search with hookable disjunction

Tom Schrijvers UGent, Markus Triska and Bart Demoen (2012) PPDP '12 : proceedings of the 14th symposium on principles and practice of declarative programming. p.103-114
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.
Please use this url to cite or link to this publication:
author
organization
year
type
conference
publication status
published
subject
keyword
search, modularity, Prolog, disjunction
in
PPDP '12 : proceedings of the 14th symposium on principles and practice of declarative programming
editor
Andy King
pages
103 - 114
publisher
Association for Computing Machinery (ACM)
place of publication
New York, NY, USA
conference name
14th International symposium on Principles and Practice of Declarative Programming (PPDP 2012)
conference location
Leuven, Belgium
conference start
2012-09-18
conference end
2012-09-20
ISBN
9781450315227
DOI
10.1145/2370776.2370790
language
English
UGent publication?
yes
classification
C1
copyright statement
I have transferred the copyright for this publication to the publisher
id
2963354
handle
http://hdl.handle.net/1854/LU-2963354
date created
2012-07-17 20:12:16
date last changed
2014-12-18 15:20:56
@inproceedings{2963354,
  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.},
  author       = {Schrijvers, Tom and Triska, Markus and Demoen, Bart},
  booktitle    = {PPDP '12 : proceedings of the 14th symposium on principles and practice of declarative programming},
  editor       = {King, Andy},
  isbn         = {9781450315227},
  keyword      = {search,modularity,Prolog,disjunction},
  language     = {eng},
  location     = {Leuven, Belgium},
  pages        = {103--114},
  publisher    = {Association for Computing Machinery (ACM)},
  title        = {Tor: extensible search with hookable disjunction},
  url          = {http://dx.doi.org/10.1145/2370776.2370790},
  year         = {2012},
}

Chicago
Schrijvers, Tom, Markus Triska, and Bart Demoen. 2012. “Tor: Extensible Search with Hookable Disjunction.” In PPDP  ’12 : Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming, ed. Andy King, 103–114. New York, NY, USA: Association for Computing Machinery (ACM).
APA
Schrijvers, T., Triska, M., & Demoen, B. (2012). Tor: extensible search with hookable disjunction. In Andy King (Ed.), PPDP  ’12 : proceedings of the 14th symposium on principles and practice of declarative programming (pp. 103–114). Presented at the 14th International symposium on Principles and Practice of Declarative Programming (PPDP 2012), New York, NY, USA: Association for Computing Machinery (ACM).
Vancouver
1.
Schrijvers T, Triska M, Demoen B. Tor: extensible search with hookable disjunction. In: King A, editor. PPDP  ’12 : proceedings of the 14th symposium on principles and practice of declarative programming. New York, NY, USA: Association for Computing Machinery (ACM); 2012. p. 103–14.
MLA
Schrijvers, Tom, Markus Triska, and Bart Demoen. “Tor: Extensible Search with Hookable Disjunction.” PPDP  ’12 : Proceedings of the 14th Symposium on Principles and Practice of Declarative Programming. Ed. Andy King. New York, NY, USA: Association for Computing Machinery (ACM), 2012. 103–114. Print.