Success and Failure for Hereditary Harrop Formulae
暂无分享,去创建一个
[1] Dov M. Gabbay,et al. N-Prolog: An Extension of Prolog with Hypothetical Implications I , 1984, J. Log. Program..
[2] L. Thorne McCarty,et al. Clausal Intuitionistic Logic I - Fixed-Point Semantics , 1988, J. Log. Program..
[3] D.M. Gabbay,et al. N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure , 1985, J. Log. Program..
[4] Kenneth Kunen,et al. Negation in Logic Programming , 1987, J. Log. Program..
[5] Tim Flannagan. The Consistency of Negation as Failure , 1986, J. Log. Program..
[6] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[7] Melvin Fitting,et al. A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..
[8] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[9] Journal of the Association for Computing Machinery , 1961, Nature.
[10] Sten-Åke Tärnlund,et al. Horn clause computability , 1977, BIT.
[11] Dale Miller,et al. A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..
[12] James Harland,et al. On hereditary Harrop formulae as a basis for logic programming , 1991 .
[13] James Harland,et al. On Normal Forms and Equivalence for Logic Programs , 1992, JICSLP.
[14] Smbat Abian,et al. A theorem on partially ordered sets, with applications to fixed point theorems , 1961 .
[15] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.
[16] Giorgio Levi,et al. A New Declarative Semantics for Logic Languages , 1988, ICLP/SLP.
[17] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .
[18] Liz Sonenberg,et al. Fixed Point Theorems and Semantics: A Folk Tale , 1982, Inf. Process. Lett..