## Modeling answer constraints in Constraint Logic Programs (1991)

Venue: | Proc. Eighth Int'l Conf. on Logic Programming |

Citations: | 36 - 11 self |

### BibTeX

@INPROCEEDINGS{Gabbrielli91modelinganswer,

author = {Maurizio Gabbrielli and Giorgio Levi},

title = {Modeling answer constraints in Constraint Logic Programs},

booktitle = {Proc. Eighth Int'l Conf. on Logic Programming},

year = {1991},

pages = {238--252},

publisher = {The MIT Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

The constraint logic programming paradigm CLP(X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic programming framework. This paradigm retains the semantic properties of logic languages, namely the existence of equivalent operational, model theoretic and fixpoint semantics. Moreover, since computation is performed over the particular domain of computation X , CLP(X) programs have an equivalent "algebraic" semantics, i.e. a semantics which is defined directly on the algebraic structure of the domain X . In this paper we propose an extension of such a semantics, for the success set case, in order to fully characterize the operational behaviour of programs. We introduce a framework for defining various notions of models, each corresponding to a specific operationally observable property. The construction is based on a new notion of interpretation (set of constrained atoms), on a natural exten...

### Citations

784 | Constraint Logic Programming
- Jaffar, Lassez
- 1987
(Show Context)
Citation Context ...ation framework which generalizes to the CLP case an approach developed for pure logic programs. 1 Introduction The Constraint Logic Programming paradigm CLP(X) has been proposed by Jaffar and Lassez =-=[17, 16]-=- in order to integrate a generic computational mechanism based on constraints with the logic programming framework. The benefits of such an integration are several. From a pragmatic point of view, CLP... |

436 | Concurrent Constraint Programming
- Saraswat, Rinard
- 1990
(Show Context)
Citation Context ...ams. By logical semantics we mean a fixpoint semantics based on an immediate consequences operator on interpretations (see for example [9, 13]), as opposed to an operational or denotational semantics =-=[15, 26, 7]-=-. Our results generalize the original algebraic semantics of CLP as proposed in [17, 16] by using essentially the approach in [12] which extends very naturally to CLP. In fact 1. interpretations in [1... |

218 |
Unification revisited
- Lassez, Maher, et al.
- 1986
(Show Context)
Citation Context ...property of the existence of a unique (up to variable renaming) canonical form of (f=g[; \Sigma)-constraints which allows to syntactically identify H-equivalent constraints, namely the solved form of =-=[20]-=-. This property allows to compute on the Herbrand universe in a purely syntactic way using unification theory. In particular the unification algorithm which computes the idempotent mgu can be consider... |

114 |
Declarative modeling of the operational behavior of logic languages
- Falaschi, Levi, et al.
- 1989
(Show Context)
Citation Context ...med over the particular domain of computation X, CLP(X) programs have an equivalent "algebraic" semantics [17] directly defined on the algebraic structure of X. This paper extends some recen=-=t results [11, 12]-=- on the semantics of (positive) logic programs to the case of constraint logic programs. The main result is the formalization of a framework for defining various notions of models, each corresponding ... |

104 | Equational problems and disunification
- Comon, Lescanne
- 1989
(Show Context)
Citation Context ...tially corresponds to PROLOG-II [4], where the domain is the infinitary Herbrand universe and the constraints are equations (s = t) and disequations (s 6= t). If \Sigma is an infinite set, results in =-=[19, 5]-=- show the existence of a normal form for sets of equations and disequations and give an algorithm for computing it. Canonical forms exist on arithmetic domains as well. For example, a canonical form f... |

80 |
Prolog and infinite trees
- Colmerauer
- 1982
(Show Context)
Citation Context ...alent constraints depends on the particular constraint system. For example, results analougous to the H case hold for the H II (f=; 6=g[; \Sigma) structure, which essentially corresponds to PROLOG-II =-=[4]-=-, where the domain is the infinitary Herbrand universe and the constraints are equations (s = t) and disequations (s 6= t). If \Sigma is an infinite set, results in [19, 5] show the existence of a nor... |

74 | A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs
- Barbuti, Giacobazzi, et al.
- 1993
(Show Context)
Citation Context ...the abstract model). Abstract interpretation of CLP(X) programs has only be considered in a denotational semantics framework [25], while with our semantics we can generalize the bottom up approach in =-=[1]-=-. Finally, a semantics modeling the observable behaviours is a first step towards the definition of a logical semantics for Concurrent Constraint logic programs. By logical semantics we mean a fixpoin... |

70 |
A model-theoretic reconstruction of the operational semantics of logic programs
- Falaschi, Levi, et al.
- 1993
(Show Context)
Citation Context ... 8A 1 2 I 1 9A 2 2 I 2 such thatA 1 v A 2 and ffl I 1 �� I 2 iff (I 1sI 2 ) and (I 2sI 1 implies I 1 ` I 2 ). The previous definition and the following lemmata extend to the CLP case results given=-= in [12] for log-=-ic programs. The proofs can easily be obtained from the ones in [12]. Lemma 5.4 The relation �� is an ordering on I. Moreover (I; ��) is a complete partial order. Lemma 5.5 Let M be the set of... |

62 |
The acceptability semantics for logic programs
- Kakas, Mancarella, et al.
(Show Context)
Citation Context ...f concurrent logic languages [22, 6, 9, 13], the semantics of partial computations [10], the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques =-=[23, 2]-=-, semantics of logic programs with negation [27] and the definition of a non ground finite failure set semantics [24]. The same kind of applications can be developed in the CLP case by using our SS 3 ... |

56 | Bottom-up abstract interpretation of logic programs
- Codish, Dams, et al.
- 1994
(Show Context)
Citation Context ...ansformation of logic programs. These include the semantics of concurrent logic languages [22, 6, 9, 13], the semantics of partial computations [10], the abstract interpretation of pure logic programs=-=[1, 3, 18]-=-, correctness of program transformation techniques [23, 2], semantics of logic programs with negation [27] and the definition of a non ground finite failure set semantics [24]. The same kind of applic... |

36 |
A canonical form for generalized linear constraints
- Lassez, McAloon
- 1992
(Show Context)
Citation Context ...puting it. Canonical forms exist on arithmetic domains as well. For example, a canonical form for generalized linear constraints (an extended class of linear arithmetic constraints) has been given in =-=[21]-=-, which plays the same role of the mgu on Herbrand constraints. When considering just the H structure, our definitions boil down to those of s-semantics [11], since the following lemma 2.11 is a strai... |

14 |
Unfolding and fixpoint semantics of concurrent constraint logic programs. Theoretical computer science
- Gabbrieli, Levi
- 1992
(Show Context)
Citation Context ...tion of a logical semantics for Concurrent Constraint logic programs. By logical semantics we mean a fixpoint semantics based on an immediate consequences operator on interpretations (see for example =-=[9, 13]-=-), as opposed to an operational or denotational semantics [15, 26, 7]. Our results generalize the original algebraic semantics of CLP as proposed in [17, 16] by using essentially the approach in [12] ... |

12 |
C.: On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences
- Boer, Palamidessi
- 1990
(Show Context)
Citation Context ...ams. By logical semantics we mean a fixpoint semantics based on an immediate consequences operator on interpretations (see for example [9, 13]), as opposed to an operational or denotational semantics =-=[15, 26, 7]-=-. Our results generalize the original algebraic semantics of CLP as proposed in [17, 16] by using essentially the approach in [12] which extends very naturally to CLP. In fact 1. interpretations in [1... |

12 |
An Algebraic Framework for the Abstract Interpretation of Logic Programs
- Kemp, Ringwood
- 1990
(Show Context)
Citation Context ...ansformation of logic programs. These include the semantics of concurrent logic languages [22, 6, 9, 13], the semantics of partial computations [10], the abstract interpretation of pure logic programs=-=[1, 3, 18]-=-, correctness of program transformation techniques [23, 2], semantics of logic programs with negation [27] and the definition of a non ground finite failure set semantics [24]. The same kind of applic... |

11 |
The CLP(R) Programmer 's Manual
- Heintze, Jaffar, et al.
- 1987
(Show Context)
Citation Context ...true2q(X)) computes the answer constraint X = a in W 2 only. Let us show an example of the semantics SS 3 (P; R) for a CLP (R) program (CLP (R) is defined on an arithmetical domain R of reals numbers =-=[8]-=-). Example 3.6 [8] The following program P computes the mortgage repayments. P is the principal,sT is the mortgage lifetime in months, I is the annual percentage interest rate, R is the monthly repaym... |

11 |
unfolding rules and fixpoint semantics, in
- Levi, Models
- 1988
(Show Context)
Citation Context ... the s-semantics has already been shown by several projects related to the semantics, the analysis, and the transformation of logic programs. These include the semantics of concurrent logic languages =-=[22, 6, 9, 13]-=-, the semantics of partial computations [10], the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques [23, 2], semantics of logic programs with n... |

10 |
Basic Transformation Operations for Logic Programs which Preserve Computed Answer Substitutions
- Bossi, Cocco
- 1993
(Show Context)
Citation Context ...f concurrent logic languages [22, 6, 9, 13], the semantics of partial computations [10], the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques =-=[23, 2]-=-, semantics of logic programs with negation [27] and the definition of a non ground finite failure set semantics [24]. The same kind of applications can be developed in the CLP case by using our SS 3 ... |

8 |
Finite failure and partial computations in concurrent logic languages
- Falaschi, Levi
- 1990
(Show Context)
Citation Context ...jects related to the semantics, the analysis, and the transformation of logic programs. These include the semantics of concurrent logic languages [22, 6, 9, 13], the semantics of partial computations =-=[10]-=-, the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques [23, 2], semantics of logic programs with negation [27] and the definition of a non gro... |

8 |
Failure and success made symmetric
- Levi, Martelli, et al.
- 1990
(Show Context)
Citation Context ...pure logic programs[1, 3, 18], correctness of program transformation techniques [23, 2], semantics of logic programs with negation [27] and the definition of a non ground finite failure set semantics =-=[24]-=-. The same kind of applications can be developed in the CLP case by using our SS 3 (P; !) semantics. In particular we are currently investigating the abstract interpretation of CLP programs. It is wor... |

7 |
Extending S-Models to Logic Programs with Negation
- Turi
- 1991
(Show Context)
Citation Context ...mantics of partial computations [10], the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques [23, 2], semantics of logic programs with negation =-=[27]-=- and the definition of a non ground finite failure set semantics [24]. The same kind of applications can be developed in the CLP case by using our SS 3 (P; !) semantics. In particular we are currently... |

6 |
Semantic Models for a Version of PARLOG
- Boer, Kok, et al.
- 1989
(Show Context)
Citation Context ... the s-semantics has already been shown by several projects related to the semantics, the analysis, and the transformation of logic programs. These include the semantics of concurrent logic languages =-=[22, 6, 9, 13]-=-, the semantics of partial computations [10], the abstract interpretation of pure logic programs[1, 3, 18], correctness of program transformation techniques [23, 2], semantics of logic programs with n... |

5 |
Reactive Behaviour semantics for Concurrent Constraint Logic Programs
- Gaifman, Maher, et al.
- 1989
(Show Context)
Citation Context ...ams. By logical semantics we mean a fixpoint semantics based on an immediate consequences operator on interpretations (see for example [9, 13]), as opposed to an operational or denotational semantics =-=[15, 26, 7]-=-. Our results generalize the original algebraic semantics of CLP as proposed in [17, 16] by using essentially the approach in [12] which extends very naturally to CLP. In fact 1. interpretations in [1... |

5 |
Solving disequations
- Kirchner, Lescanne
- 1987
(Show Context)
Citation Context ...tially corresponds to PROLOG-II [4], where the domain is the infinitary Herbrand universe and the constraints are equations (s = t) and disequations (s 6= t). If \Sigma is an infinite set, results in =-=[19, 5]-=- show the existence of a normal form for sets of equations and disequations and give an algorithm for computing it. Canonical forms exist on arithmetic domains as well. For example, a canonical form f... |

2 |
Nested Guarded Horn Clauses: a language provided with a complete set of Unfolding Rules
- Falaschi, Gabbrielli, et al.
- 1989
(Show Context)
Citation Context ...tion of a logical semantics for Concurrent Constraint logic programs. By logical semantics we mean a fixpoint semantics based on an immediate consequences operator on interpretations (see for example =-=[9, 13]-=-), as opposed to an operational or denotational semantics [15, 26, 7]. Our results generalize the original algebraic semantics of CLP as proposed in [17, 16] by using essentially the approach in [12] ... |

1 |
Analysis of constraint logic programs
- Marriot, Sondergaard
- 1990
(Show Context)
Citation Context ...e used for bottom-up abstract interpretation (i.e. fixpoint computation of the abstract model). Abstract interpretation of CLP(X) programs has only be considered in a denotational semantics framework =-=[25]-=-, while with our semantics we can generalize the bottom up approach in [1]. Finally, a semantics modeling the observable behaviours is a first step towards the definition of a logical semantics for Co... |