Finite Failures and Partial Computations in Concurrent Logic Languages

Abstract This paper investigates some semantic properties of concurrent logic languages. Concurrent logic languages with a commit operator differ from pure logic languages in the finite failure set. Since the new finite failure set depends on the computation rule, we define an operational semantics based on a parallel computation rule and a fair search rule. Failures with a parallel computation rule are shown to be strongly related to partial computed answer substitutions. The set of partial computed answer substitutions and the set of finite failures are defined as the least fixpoint of a transformation on pairs of interpretations.

[1]  Vijay A. Saraswat,et al.  GHC: Operational Semantics, Problems, and Relationships with CP(|, |) , 1987, SLP.

[2]  Giorgio Levi,et al.  The Declarative Semantics of Logical Read-Only Variables , 1985, SLP.

[3]  Kazunori Ueda,et al.  Guarded Horn Clauses , 1986, LP.

[4]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[5]  Ehud Shapiro,et al.  The family of concurrent logic programming languages , 1989, CSUR.

[6]  C. Palamidessi A fixpoint semantics for guarded Horn clauses , 1988 .

[7]  Giorgio Levi,et al.  A New Declarative Semantics for Logic Languages , 1988, ICLP/SLP.

[8]  K. Ueds,et al.  Guarded horn clauses: A parallel logic programming language with the concept of a guard , 1988 .

[9]  Keith L. Clark,et al.  A relational language for parallel programming , 1981, FPCA '81.

[10]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[11]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

[12]  Kazunori Ueda,et al.  Parallelism in Logic Programming , 1989, IFIP Congress.

[13]  Keith L. Clark,et al.  PARLOG: parallel programming in logic , 1986, ACM Trans. Program. Lang. Syst..

[14]  Masaki Murakami Nested Guarded horn Clauses : A Language Provided with a Complete Set of Unfolding Rules , 1990 .

[15]  Steve Gregory,et al.  Parallel logic programming in PARLOG - the language and its implementation , 1987 .

[16]  Vijay Saraswat,et al.  Problems with concurrent prolog , 1986 .

[17]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[18]  Ehud Shapiro,et al.  A subset of Concurrent Prolog and its interpreter , 1988 .

[19]  Michael J. Maher Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[20]  Ehud Shapiro Concurrent Prolog: A Progress Report , 1986, Computer.

[21]  Giorgio Levi,et al.  Semantic Models for a Version of PARLOG , 1989, ICLP.