Abstract
Execution of a logic program begins when the user provides an initial goal statement. The interpreter computes values for variables of the goal through a series of resolutions. If the null clause can be derived, the substitutions used in the derivation provide values for the variables of the initial goal. The execution can be represented as a goal tree, where multiple descendants of a node indicate a choice of clauses for resolving the goal at that node.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Kluwer Academic Publishers
About this chapter
Cite this chapter
Conery, J.S. (1987). Parallelism in Logic Programs. In: Parallel Execution of Logic Programs. The Kluwer International Series in Engineering and Computer Science, vol 25. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1987-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1987-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9187-9
Online ISBN: 978-1-4613-1987-0
eBook Packages: Springer Book Archive