An improved data-dependency-based backtracking scheme for Prolog (Q1823727): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal unifiable subsets and minimal non-unifiable subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A data-dependency-based intelligent backtracking scheme for PROLOG / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90121-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975735118 / rank | |||
Normal rank |
Latest revision as of 11:49, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved data-dependency-based backtracking scheme for Prolog |
scientific article |
Statements
An improved data-dependency-based backtracking scheme for Prolog (English)
0 references
1989
0 references
The article describes modification of data dependency based backtracking scheme for Prolog. Its idea stems from observation that data dependent backtracking scheme used in another approaches is not sufficiently selective. It argues that it is not necessary to include as backtrack points all so called contributing goals. In this respect the article is interesting modification of \textit{V. Kumar}, \textit{Y. J. Lin} [J. Logic Program. 5, No.2, 165-181 (1988; Zbl 0645.68102)]. Concerning the implementation in WAM the presentation is not precise enough to show what modifications are necessary. It is clear that introduction of tags will double memory needed for every variable. Moreover, the implementation of \(``>''\) relationship requires to add some kind of time tags. It would lead to considerable overhead both in memory and time.
0 references
unification
0 references
intelligent backtracking
0 references
data dependency
0 references
WAM
0 references