CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
TOR: modular search with hookable disjunction
Authors
Bart Demoen
Benoit Desouter
Tom Schrijvers
Markus Triska
Publication date
1 January 2014
Publisher
'Elsevier BV'
Doi
Cite
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.publisher: Elsevier articletitle: Tor: Modular search with hookable disjunction journaltitle: Science of Computer Programming articlelink: http://dx.doi.org/10.1016/j.scico.2013.05.008 content_type: article copyright: Copyright © 2013 Elsevier B.V. All rights reserved.status: publishe
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Lirias
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:lirias2repo.kuleuven.be:12...
Last time updated on 10/12/2019
Ghent University Academic Bibliography
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:archive.ugent.be:4132237
Last time updated on 12/11/2016