M. Garc'ia de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In 1993 International Logic Programming Symposium, pages 130--146. MIT Press, Cambridge, MA, October 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....where modularity can help to reduce the size and the complexity of the analysis. The semantics for partial answers and call patterns can be used for the analysis of programs too. For example, informations on partially computed constraints can be used to detect independence of (sub)goals [25], thus providing the conditions for optimizations of CLP programs based on AND parallelism and intelligent backtracking. The paper is organized as follows. In the next section we recall the basic definitions of the CLP framework. In section 3 the new notion of interpretation and of model are ....

....such as partial answer constraints (partial answers for short) and call patterns. The interest in these observables arises from the context of program analysis and program optimization. Information on the partial results of computations can be used to detect which atoms in a goal are independent [25]. Independent atoms can be evaluated in parallel, thus optimizing programs executions. In this section we will obtain from suitable abstractions of F Omega a fully abstract semantic for partial answers and a correct semantics for call patterns. In the case of pure logic programs, semantics for ....

[Article contains additional citation context not shown here]

M.J. Garcia de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In Proceedings of the International Logic Programming Symposium, pages 130--146, MIT Press, Cambridge, MA 1993.

.... is an annotation (possibly automatically determined) used to prescribe the parallel execution of two goals. The second one from which the current proposal inherits is our DP log project [16, 15] and makes explicit use of vectors. Almost all these parallelization ideas have been lifted to CLP [29, 7, 8]. Most of the works in parallel constraint satisfaction consist in parallelizing a speci c algorithm, like backtracking search [30] or arc consistency computation [22] Other recent works tend to give parallel constraint propagation a strong theoretical basis [21] but the data distribution ....

M. Garcia de la Banda, M. Hermenegildo, and K. Marriott. Independence in constraint logic programs. In International Logic Programming Symposium, pages 130-146. MIT Press, 1993.

....of 1) a formal description of the parallel execution model, and 2) the posibility of recognizing much more parallelism. In fact, our semantics describes the parallelism at the smallest level of granularity. Therefore goals which appeared to be not parallelizable at all in the usual approach [7, 6] because of conflicts in small subparts of their execution trees, here they can be partially parallelizable. The paper is organized as follows. Section 2 describes the cc framework. Then, Section 3 gives the operational semantics for cc programs, Section 4 defines contextual nets, and Section 5 ....

....of logic programs [9] or constraint logic programs (CLP) 8] In fact, the aim is to run in parallel, independently, as many goals as possible while of course not loosing any solution (soundness) nor taking a longer time (efficiency) w.r.t. the sequential execution of the same program [7, 6]. The restriction to only sound and efficient parallelizations means that only goals which do not affect each other, that is, which are independent, can be run in parallel. Therefore any tool that can help understand whether two goals are independent or not would be of great help to such ....

M. Garcia de la Banda, M. Hermenegildo, and K. Marriott. Independence in constraint logic programs. In Proc. International Logic Programming Symposium. MIT Press, 1993.

No context found.

M. Garc'ia de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In 1993 International Logic Programming Symposium, pages 130--146. MIT Press, Cambridge, MA, October 1993.

....be decreased for two reasons. First, due to the asymmetry of strong independence g 2 can decrease the search space of g 1 for . Second, the answer for g 2 (if any) will never be recomputed. 2 Due to lack of space, all the proofs to the theorems in the paper will be omitted. They can be found in [4]. 3 This property is in general undecidable, but can be approximated. Note that the need for this property to hold in the following paragraphs is related to the preservation of the recomputation overhead due to the standard backtracking algorithm. Such preservation can also always be ensured ....

M. Garcia de la Banda, M. Hermenegildo, and K. Marriott. Independence in constraint logic programs. Technical report, U. of Madrid (UPM), Facultad Informatica UPM, 28660-Boadilla del Monte, MadridSpain, November 1992.

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