Issues of non-determinism inPROLOGand the Committed Choice Non-Deterministic logic languages
✍ Scribed by R. Trehan; P. F. Wilk
- Book ID
- 104638729
- Publisher
- Springer Netherlands
- Year
- 1990
- Tongue
- English
- Weight
- 925 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0269-2821
No coin nor oath required. For personal study only.
✦ Synopsis
Issues of logic programming have always been bound with those of search. Logic programs are generally thought of as a logical specification of the problem (the declarative reading) in terms of clauses. The inference mechanism of the given logic language provides a means by which the clauses can be used to prove a query to the system (procedural interpretation). The problem of search can be related into forms of non-determinism. That is how to select a possible solution path (clause). It is this criteria that is used to consider the issues of search in PROLOG and the Committed Choice Non-Deterministic execution models.