A Semantics for Concurrent Logic Programming Languages Based on Multiple- Valued Logic

@article{BenJacob2012ASF,
  title={A Semantics for Concurrent Logic Programming Languages Based on Multiple- Valued Logic},
  author={Marion G. Ben-Jacob},
  journal={International Journal of Advanced Computer Science and Applications},
  year={2012},
  volume={3}
}
  • M. Ben-Jacob
  • Published 2012
  • Computer Science
  • International Journal of Advanced Computer Science and Applications
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… 

Tables from this paper

References

SHOWING 1-10 OF 34 REFERENCES

A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language

  • K. Ueda
  • Computer Science
    Computational Logic: Logic Programming and Beyond
  • 2002
This paper discusses the construction of a meta-interpreter of Flat GHC, one of the simplest and earliest concurrent constraint languages.Meta-interpretation has a long history in logic programming,

Concurrent constraint programming

This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and entailment, and develops the cc family of languages, which is very similar to Milner's CCS.

A grammatical view of logic programming

The grammatical point of view shows that many useful extensions of Horn clauses incorporated in Prolog without theoretical justification correspond to well-established grammatical concepts, which gives a natural framework for defining extensions to the concept of logic program.

Fully abstract denotational semantics for flat Concurrent Prolog

It is proved that the denotational semantics is fully abstract in the sense that it records the minimal amount of extra information beyond the observables to make it compositional.

Bilattices and the Semantics of Logic Programming

  • M. Fitting
  • Philosophy, Computer Science
    J. Log. Program.
  • 1991

The well-founded semantics for general logic programs

It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.

Stratified and Three-valued Logic Programming Semantics

This work shows how to extend the familiar fixed point semantics for Horn clause programs to the family of stratified logic programs, producing a semantics they call weak stratified, that is compatible with but not the same as the conventional stratified semantics.

Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part I

This book discusses Logic in Databases and Information Integration, non-deductive Reasoning, and Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning.

Towards Effective Evaluation of General Logic Programs

An extension of SLDNF, called SLG resolution, is presented, with the following distinctive features, which it is believed will provide the computational basis for the next generation of logic programming systems.