On modular termination proofs of general logic programs
暂无分享,去创建一个
Sandro Etalle | Sabina Rossi | S. Etalle | S. Rossi | A. Bossi | N. Cocco | Logi ProgramsAnnalisa Bossi | Ni oletta Co
[1] Jan Maluszynski,et al. AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs , 1985, SLP.
[2] Saumya K. Debray,et al. Static inference of modes and data dependencies in logic programs , 1989, TOPL.
[3] Danny De Schreye,et al. Termination proofs for logic programs with tabling , 2001, TOCL.
[4] Dino Pedreschi,et al. Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..
[5] Saumya K. Debray,et al. Automatic Mode Inference for Logic Programs , 1988, J. Log. Program..