Bibliographic Details
| Title: |
Tor: Modular search with hookable disjunction. |
| Authors: |
Schrijvers, Tom1 tom.schrijvers@ugent.be, Demoen, Bart2 Bart.Demoen@cs.kuleuven.be, Triska, Markus3 triska@dbai.tuwien.ac.at, Desouter, Benoit1 Benoit.Desouter@ugent.be |
| Source: |
Science of Computer Programming. May2014, Vol. 84, p101-120. 20p. |
| Subjects: |
Search algorithms, Computer software, Denotational semantics, Program transformation, Computer systems, Control theory (Engineering) |
| Abstract: |
Abstract: Horn Clause Programs have a natural exhaustive depth-first procedural semantics. However, for many programs this 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. The Tor library is already provided and used as an add-on to SWI-Prolog. [Copyright &y& Elsevier] |
|
Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
