F. Mesnard. Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations. PhD thesis, Universit'e Paris VI, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[23,19] The Basic Andorra Model (BAM) 24] is a very well known proposal where co routining between determinate goals both constrains the search space and generates and parallelism, while or parallelism is achieved through exploiting alternatives of non determinate goals. The Andorra I prototype [22] demonstrated that the BAM can successfully exploit two forms of parallelism, or parallelism and dependent and parallelism, and that it can reduce the search space for a large category of programs. On the other hand, Andorra I depends on finding determinate applications. If determinacy cannot be ....

....Implementations of Prolog, pages 268 278. Ellis Horwood, 1984. 21] V. Santos Costa, A. Srinivasan, and R. Camacho. A note on two simple transformations for improving the efficiency of an ILP system. In Proceedings of ILP 2000, July 2000. Proceedings to appear in Springer Verlag LNAI series. [22] V. Santos Costa, D. H. D. Warren, and R. Yang. Andorra I: A Parallel Prolog System that Transparently Exploits both And and Or Parallelism. In Third ACM SIGPLAN Symposium on Principles Practice of Parallel Programming PPOPP, pages 83 93. ACM press, April 1991. SIGPLAN Notices vol 26(7) July ....

[Article contains additional citation context not shown here]

F. MESNARD. Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations. PhD thesis, Universite Paris VI, 1993.

....et al. 1993] and [Decorte et al. 1997] we are not aware of any other techniques in which suitable norms are automatically generated. This includes the techniques in [Lindenstrauss and Sagiv 1997] and [Speirs et al. 1997] mentioned in the previous section, but also the constraint based approach in [Mesnard 1993], Mesnard 1996] F. Mesnard and Maillard 1998] In all these works, the norm is given as input to the analysis. For the programs in the benchmarks of Section 8 this has no e ect. For all terminating programs in these benchmarks the term size norm is sucient. In Section 8, we already provided ....

....linear programming techniques, gets lost. Furthermore, inferring the interargument relations using e.g. Van Gelder 1991] on the basis of a symbolic norm seems dicult, since it involves global analysis. Introducing a further level of abstraction in the norm would make the analysis very complex. In [Mesnard 1993], Mesnard 1996] and [F. Mesnard and Maillard 1998] the technique of [Sohn and Van Gelder 1991] was used in a constraint based approach to prove termination of constraint logic programs. Technically, the main novelty in the approach is the introduction of several abstract versions of the analyzed ....

Mesnard, F. 1993. Etude de la terminaison des programmes logiques avec contraintes au moyen d'approximations. Ph.D. thesis, Paris VI.

....termination of flowchart programs. 1 Introduction The aim of this paper is to introduce a sufficient and necessary condition for termination of constraint logic programs (clp s for short) Termination of clp s is a fairly recent topic, and the only contribution we are aware of is by Mesnard [Mes93], cited in the recent survey [DSD94] on termination of logic programs. However, the aim of that work is different, namely to provide sufficient conditions for the termination problem of clp s, based on approximation techniques. Here we aim at an exact description of terminating clp s, to provide a ....

F. Mesnard. Etude de la terminaison des programmes logiques avec constraintes aux moyens d'approximations. PhD Thesis, Paris VI, 1993.

No context found.

F. Mesnard. Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations. PhD thesis, Universit'e Paris VI, 1993.

....x P re app3 (x; y; z; u) j (x y) x u) So any call C, app(X,Y,Z) where C is a CLP(H) constraint, left terminates if X or Z are ground in C etc. The main result on which cTI is based on is the following Theorem 2.1, which ensures correctness of the left termination condition. Theorem 2. 1 ([22]) Let P be a program, p and q be two predicate symbols of P . Assume that p is defined by m p rules r k : p( x) c k , p k;1 ( x k;1 ) p k;n k ( x k;n k ) and for each q 62 p and appearing in the rules defining p, a lefttermination condition P re q has been computed. If the set of ....

F. Mesnard. Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations. PhD thesis, Universit'e Paris VI, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC