Tor: Modular search with hookable disjunction.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 94905925 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Tor: Modular search with hookable disjunction. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Schrijvers%2C+Tom%22">Schrijvers, Tom</searchLink><relatesTo>1</relatesTo><i> tom.schrijvers@ugent.be</i><br /><searchLink fieldCode="AR" term="%22Demoen%2C+Bart%22">Demoen, Bart</searchLink><relatesTo>2</relatesTo><i> Bart.Demoen@cs.kuleuven.be</i><br /><searchLink fieldCode="AR" term="%22Triska%2C+Markus%22">Triska, Markus</searchLink><relatesTo>3</relatesTo><i> triska@dbai.tuwien.ac.at</i><br /><searchLink fieldCode="AR" term="%22Desouter%2C+Benoit%22">Desouter, Benoit</searchLink><relatesTo>1</relatesTo><i> Benoit.Desouter@ugent.be</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. May2014, Vol. 84, p101-120. 20p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Search+algorithms%22">Search algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Denotational+semantics%22">Denotational semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Program+transformation%22">Program transformation</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Control+theory+%28Engineering%29%22">Control theory (Engineering)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=94905925 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.scico.2013.05.008 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 20 StartPage: 101 Subjects: – SubjectFull: Search algorithms Type: general – SubjectFull: Computer software Type: general – SubjectFull: Denotational semantics Type: general – SubjectFull: Program transformation Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Control theory (Engineering) Type: general Titles: – TitleFull: Tor: Modular search with hookable disjunction. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Schrijvers, Tom – PersonEntity: Name: NameFull: Demoen, Bart – PersonEntity: Name: NameFull: Triska, Markus – PersonEntity: Name: NameFull: Desouter, Benoit IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2014 Type: published Y: 2014 Identifiers: – Type: issn-print Value: 01676423 Numbering: – Type: volume Value: 84 Titles: – TitleFull: Science of Computer Programming Type: main |
| ResultId | 1 |
