Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2012.031002
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 10, 2012.
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.
Marion Glazerman Ben-Jacob, “A Semantics for Concurrent Logic Programming Languages Based on Multiple-Valued Logic” International Journal of Advanced Computer Science and Applications(IJACSA), 3(10), 2012. http://dx.doi.org/10.14569/IJACSA.2012.031002