A more expressive formulation of many sorted logic
暂无分享,去创建一个
[1] A. Schmidt. Über deduktive Theorien mit mehreren Sorten von Grunddingen , 1938 .
[2] A. Schmidt. Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik , 1951 .
[3] Hao Wang,et al. Logic of many-sorted theories , 1952, Journal of Symbolic Logic.
[4] Theodore Hailperin,et al. A theory of restricted quantification I , 1957, Journal of Symbolic Logic.
[5] P. Gilmore. An addition to “logic of many-sorted theories” , 1958 .
[6] H. Gelernter,et al. Realization of a geometry theorem proving machine , 1995, IFIP Congress.
[7] Arnold Oberschelp. Untersuchungen zur mehrsortigen Quantorenlogik , 1962 .
[8] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .
[9] Terry Winograd,et al. Understanding natural language , 1974 .
[10] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[11] Patrick J. Hayes,et al. Computation and Deduction , 1973, MFCS.
[12] Scott E. Fahlman,et al. A Planning System for Robot Construction Tasks , 1973, Artif. Intell..
[13] A. J. Nevins,et al. A Human Oriented Logic for Automatic Theorem-Proving , 1974, JACM.
[14] Joseph D. Becker. The Phrasal Lexicon , 1975, TINLAP.
[15] S. Ullman. Model-Driven Geometry Theorem Prover , 1975 .
[16] Mike Paterson,et al. Linear unification , 1976, STOC '76.
[17] Patrick J. Hayes,et al. In Defense of Logic , 1977, IJCAI.
[18] Jack Minker,et al. The Use of a Semantic Network in a Deductive Question-Answering System , 1977, IJCAI.
[19] William W. Wadge,et al. Data Types as Objects , 1977, ICALP.
[20] Drew McDermott,et al. Tarskian Semantics, or No Notation Without Denotation! , 1986, Cogn. Sci..
[21] Dennis de Champeaux. A Theorem Prover Dating a Semantic Network , 1978, AISB/GI.
[22] Robin Milner,et al. A Metalanguage for interactive proof in LCF , 1978, POPL.
[23] Raymond Reiter. On the Integrity of Typed First Order Data Bases , 1979, Advances in Data Base Theory.
[24] Robert A. Kowalski,et al. Algorithm = logic + control , 1979, CACM.
[25] J. A. Robinson,et al. Logic, form and function , 1979 .
[26] Randall Davis,et al. Meta-Rules: Reasoning about Control , 1980, Artif. Intell..
[27] William F. Clocksin,et al. Programming in Prolog , 1981, Springer Berlin Heidelberg.
[28] D. N. Cohen. Knowledge based theorem proving and learning , 1981 .
[29] C. A. R. Hoare,et al. The emperor's old clothes , 1981, CACM.
[30] Neil V. Murray. Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..
[31] D. McDermott. A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..
[32] Christoph Walther,et al. A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.
[33] Alan Mycroft,et al. A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.
[34] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .
[35] James F. Allen,et al. An overview of the HORNE logic programming system , 1983, SGAR.
[36] Michael R. Genesereth,et al. An Overview of Meta-Level Architecture , 1983, AAAI.
[37] Anthony G. Cohn. Improving the Expressiveness of Many Sorted Logic , 1983, AAAI.
[38] Christoph Walther. A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution , 1984, AAAI.
[39] Christoph Walther,et al. Unification in Many-Sorted Theories , 1984, ECAI.
[40] José Meseguer,et al. Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..
[41] Richard A. O'Keefe. A New Data-Structure for Type Trees , 1984, ECAI.
[42] Manfred Schmidt-Schauß. A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation , 1985, IJCAI.
[43] Alan M. Frisch. An investigation into inference with restricted quantification and a taxonomic representation , 1985, SGAR.
[44] Alan M. Frisch. Parsing with restricted quantification: an initial demonstration 1 , 1986, Comput. Intell..
[45] A. G. Cohn,et al. Many sorted logic=unsorted logic+control? , 1987 .
[46] D. Loveland,et al. Empirical explorations of the geometry-theorem proving machine , 1995 .
[47] Mark E. Stickel. Schubert's Steamroller problem: Formulations and solutions , 2004, Journal of Automated Reasoning.
[48] Mark E. Stickel,et al. Automated deduction by theory resolution , 1985, Journal of Automated Reasoning.
[49] A. J. J. Dick,et al. Rewrite systems on a lattice of types , 2004, Acta Informatica.