暂无分享,去创建一个
[1] Frédéric Mesnard,et al. Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs , 2001, SAS.
[2] Nachum Dershowitz,et al. Automatic Termination Analysis of Programs Containing Arithmetic Predicates , 2000, Verification of Logic Programs@ICLP.
[3] Francine Berman,et al. Grid Computing: Making the Global Infrastructure a Reality , 2003 .
[4] Micha Meier. SEPIA - a Bases for Prolog Extensions , 1992, LPAR.
[5] Joachim Schimpf,et al. ECLiPSe: A Platform for Constraint Logic Programming , 1997 .
[6] Jan Wielemaker,et al. An Overview of the SWI-Prolog Programming Environment , 2003, WLPE.
[7] Lobel Crnogorac,et al. A Comparison of Three Occur-Check Analysers , 1996, SAS.
[8] Miron Livny,et al. Condor and the Grid , 2003 .
[9] Bart Demoen,et al. Dynamic attributes, their hProlog implementation, and a first evaluation , 2002 .
[10] Roberto Bagnara,et al. Boolean functions for finite-tree dependencies , 2001, APPIA-GULP-PRODE.
[11] Peter Zoeteweij,et al. An Analysis of Arithmetic Constraints on Integer Intervals , 2007, Constraints.
[12] Ulrich Neumerkel,et al. Declarative program development in Prolog with GUPU , 2002, WLPE.
[13] Michael Codish,et al. A Semantic Basis for the Termination Analysis of Logic Programs , 1999, J. Log. Program..
[14] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.