A Formal Framework for Synthesis and Verification of Logic Programs
暂无分享,去创建一个
Mauro Ferrari | Camillo Fiorentini | Alessandro Avellone | A. Avellone | Mauro Ferrari | Camillo Fiorentini
[1] Pascal Van Hentenryck. The Halting Problem for Deductive Synthesis of Logic Programs , 1994 .
[2] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[3] Mario Ornaghi,et al. Regular Search Spaces as a Foundation of Logic Programming , 1993, ELP.
[4] Helmut Schwichtenberg,et al. Basic proof theory , 1996, Cambridge tracts in theoretical computer science.
[5] Yves Deville,et al. Logic Program Synthesis , 1994, J. Log. Program..
[6] Mauro Ferrari,et al. Extracting information from intermediate semiconstructive HA-systems - extended abstract , 2001, Math. Struct. Comput. Sci..
[7] Mauro Ferrari,et al. On uniformly constructive and semiconstructive formal systems. Submitted to , 1999 .
[8] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[9] Samuel R. Buss,et al. The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic , 1999, Ann. Pure Appl. Log..
[10] D. Prawitz. Natural Deduction: A Proof-Theoretical Study , 1965 .
[11] Kung-Kiu Lau,et al. On Specification Frameworks and Deductive Synthesis of Logic Programs , 1994, International Workshop/Symposium on Logic-based Program Synthesis and Transformation.
[12] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[13] Pierangelo Miglioli,et al. Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods , 1994, J. Symb. Comput..
[14] P. Miglioli,et al. Extracting information from intermediate T-systems , 2000 .