Inferring and Compiling Termination for Constraint Logic Programs
暂无分享,去创建一个
[1] Maurizio Gabbrielli,et al. Modeling Answer Constraints in Constraint Logic Programs , 1991, ICLP.
[2] Serenella Cerrito,et al. A Linear Axiomatization of Negation as Failure , 1992, J. Log. Program..
[3] Allen Van Gelder,et al. Termination detection in logic programs using argument sizes (extended abstract) , 1991, PODS.
[4] Michael J. Maher,et al. Constraint Logic Programming: A Survey , 1994, J. Log. Program..
[5] Dino Pedreschi,et al. Studies in Pure Prolog: Termination , 1990 .
[6] Dino Pedreschi,et al. Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..
[7] Yehoshua Sagiv,et al. Automatic Termination Analysis of Logic Programs , 1997, ICLP.
[8] A. Rauzy,et al. Constraint logic programming and mu-calculus , 1997 .
[9] Zoltan Somogyi,et al. Termination Analysis for Mercury , 1997, SAS.
[10] Patrick Cousot,et al. Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..
[11] Frédéric Mesnard,et al. Inferring Left-terminating Classes of Queries for Constraint Logic Programs , 1996 .
[12] Danny De Schreye,et al. Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..
[13] Michael Codish,et al. A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints , 1997, APPIA-GULP-PRODE.