Abstract
In order to obtain an understanding of parallel logic thought it is necessary to establish a fully abstract model of the denotational semantics of logic programming languages. In this paper, a fixed point semantics for the committed choice, non-deterministic family of parallel programming languages, i.e. the concurrent logic programming languages is developed. The approach is from an order theoretic viewpoint. We rigorously define a semantics for a Guarded Horn Clauses-type of language because of the minimal restrictions of the language. The extension to other concurrent logic programming languages would be direct and analogous, based on their specific rules of suspension. Today’s world is replete with multitasking and parallelism in general. The content of this paper reflects a paradigm of an application of multi-valued logic which is reflective of this.
Highlights
Parallelism in technology encourages us to examine the meaning of different logical operations being done concurrently
In the case of implementing a logic program via resolution, it appears that will parallelism increase efficiency but that the underlying inference procedure lends itself in a natural way toward concurrency; for any selected clause, many different instantiations of a selected atom might be attempted at once, more than one atom might be chosen for possible resolution, and any give atom might even select several different clauses that contain an atom against with which it might be resolved
With all these non-deterministic possibilities, obviously, concurrency controls must be guaranteed by parallel programming languages
Summary
Parallelism in technology encourages us to examine the meaning of different logical operations being done concurrently. In the case of implementing a logic program via resolution, it appears that will parallelism increase efficiency but that the underlying inference procedure lends itself in a natural way toward concurrency; for any selected clause, many different instantiations of a selected atom might be attempted at once, more than one atom might be chosen for possible resolution, and any give atom might even select several different clauses that contain an atom against with which it might be resolved. A reasonable model of what happens when pertinent information is spread over a number of sites that communicate with each other was investigated by Fitting [10, 11] It was based on Belnap’s four-valued logic, exhibited by a bi-lattice structure. The extension to the other concurrent logic programming languages would be natural and based on the languagedependent suspension rules
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
