Abstract
An OR process is an independent interpreter created to solve a goal statement of exactly one literal. An OR process created to solve an n-ary literal p(X1 ... Xn.) is expected to return every tuple in the set Dl(p), i.e. it must construct bindings for the variables of the literal through a proof of a goal containing only this literal.
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). Parallel OR Processes. 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_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1987-0_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9187-9
Online ISBN: 978-1-4613-1987-0
eBook Packages: Springer Book Archive