Paper: An Algebraic Model of Parallel Execution of Logic Programs (at LICS 1986)

Authors: Lennart Beckman Rune Gustavsson Annika Wærn

Abstract

A mapping of logic programs into communicating processes is given. The communicating processes form an algebra based on CCS by R. Milner. The mapping is shown to maintain soundness and completeness. One application of the process representation is to provide a formal semantics for concurrent logic programming languages.

BibTeX

  @InProceedings{Wrn-AnAlgebraicModelofP,
    author = 	 {Lennart Beckman and Rune Gustavsson and Annika Wærn},
    title = 	 {An Algebraic Model of Parallel Execution of Logic Programs},
    booktitle =  {Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)},
    year =	 {1986},
    month =	 {June}, 
    pages =      {50--57},
    location =   {Cambridge, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }