Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Performance of the compiler-based Andorra-I system
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Hybrid tree search in the Andorra model
Proceedings of the eleventh international conference on Logic programming
Programming languages for distributed applications
New Generation Computing
Herbrand constraint solving in HAL
Proceedings of the 1999 international conference on Logic programming
A Flexible Scheduler for the Andorra-I System
ICLP '91 Pre-Conference Workshop on Parallel Execution of Logic Programs
| Hi-index | 0.00 |
The Andorra Model is a computation model to improve the efficiency of Prolog programs as well as to exploit parallelism. The model was designed in two stages: the basic model and the extended model. The major difference between the two is that a binding determinacy principle replaced the original clause determinacy principle, and an and-or box rewriting computation replaced the traditional resolution. This work aims to tackle some unsolved problems left in the Extended Andorra Model. We propose to replace the original and-or box rewriting method by a targeted search. The search is called targeted because we only look for possible solutions of certain specified variables. The variables shared between different local computations can be dynamically changed to finite domain variables after the targeted search, and their consistency checked eagerly. Therefore, many unnecessary or-branches can be pruned at an early stage. A special feature of our domain variable is that we allow a domain to contain non-ground compound terms, i.e., open structures. Variables within these open structures can also become domain variables, leading to nested domain variables. We have tested our idea by an experimental implementation under SIC-Stus Prolog, and obtained very encouraging results.