Inferring Left-terminating Classes of Queries for Constraint Logic Programs
暂无分享,去创建一个
[1] David A. Plaisted,et al. Abstraction Mappings in Mechanical Theorem Proving , 1980, CADE.
[2] Jeffrey D. Ullman,et al. Efficient tests for top-down termination of logical rules , 1988, JACM.
[3] Annalisa Bossi,et al. Norms on Terms and their use in Proving Universal Termination of a Logic Program , 1994, Theor. Comput. Sci..
[4] Stefan Lüttringhaus-Kappel,et al. Control Generation for Logic Programs , 1993, ICLP.
[5] Gilberto Filé,et al. Computations, abstractions and constraints in logic programs , 1992, Proceedings of the 1992 International Conference on Computer Languages.
[6] Lutz Plümer. Termination Proofs for Logic Programs , 1990, Lecture Notes in Computer Science.
[7] John P. Gallagher,et al. Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions , 1995, PLILP.
[8] Danny De Schreye,et al. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures , 1991, ICLP.
[9] Michael J. Maher,et al. Constraint Logic Programming: A Survey , 1994, J. Log. Program..
[10] Elena Marchiori,et al. On Termination of Constraint Logic Programs , 1995, CP.
[11] Roberto Giacobazzi,et al. A Generalized Semantics for Constraint Logic Programs , 1992, Fifth Generation Computer Systems.
[12] Danny De Schreye,et al. Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..
[13] Allen Van Gelder,et al. Termination detection in logic programs using argument sizes (extended abstract) , 1991, PODS.
[14] Marc Bezem,et al. Characterizing Termination of Logic Programs with Level Mappings , 1989, NACLP.
[15] Frédéric Mesnard. Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations , 1994, JFPLC.
[16] Frédéric Mesnard,et al. Towards Automatic Control for CLP(x) Programs , 1995, LOPSTR.
[17] Danny De Schreye,et al. Deriving of Linear Size Relations by Abstract Interpretation , 1992, PLILP.