Exploring Properties of Normal Multimodal Logics in Simple Type Theory with LEO-II
暂无分享,去创建一个
[1] Daniel Gallin,et al. Intensional and Higher-Order Modal Logic , 1975 .
[2] Gerard P. Hubt. A mechanization of type theory , 1973, IJCAI 1973.
[3] Peter B. Andrews. General Models, Descriptions, and Choice in Type Theory , 1972, J. Symb. Log..
[4] Manfred Kerber. On the representation of mathematical concepts and their translation into first-order logic , 1992 .
[5] Linh Anh Nguyen. Multimodal logic programming , 2006, Theor. Comput. Sci..
[6] Jeroen Groenendijk,et al. Logic, language and meaning: Vol. II: Intensional logic and logical grammar , 1991 .
[7] Peter B. Andrews. General models and extensionality , 1972, Journal of Symbolic Logic.
[8] Laura Giordano,et al. A Framework for a Modal Logic Programming , 1996, JICSLP.
[9] Luis Fariñas del Cerro,et al. Declarative Semantics for Modal Logic Programs , 1988, FGCS.
[10] Gérard P. Huet,et al. A Mechanization of Type Theory , 1973, IJCAI.
[11] Joe Hurd. An LCF-Style Interface between HOL and First-Order Logic , 2002, CADE.
[12] L. T. F. Gamut. Logic, language, and meaning , 1991 .
[13] Christoph Benzmüller,et al. Progress Report on LEO-II -- An Automatic Theorem Prover for Higher-Order Logic , 2007 .
[14] Volker Sorge,et al. Combined reasoning by automated cooperation , 2008, J. Appl. Log..
[15] Stephan Schulz,et al. E - a brainiac theorem prover , 2002, AI Commun..
[16] Reinhard Muskens,et al. Type-logical semantics , 2010 .
[17] Linh Anh Nguyen. A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs , 2003, Fundam. Informaticae.
[18] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.
[19] Gert Smolka,et al. Higher-Order Syntax and Saturation Algorithms for Hybrid Logic , 2007, Electron. Notes Theor. Comput. Sci..
[20] Leon Henkin,et al. Completeness in the theory of types , 1950, Journal of Symbolic Logic.
[21] Lawrence C. Paulson,et al. Automation for interactive proof: First prototype , 2006, Inf. Comput..
[22] Peter B. Andrews,et al. TPS: A hybrid automatic-interactive system for developing proofs , 2006, J. Appl. Log..
[23] Christoph Benzmüller,et al. Higher-order semantics and extensionality , 2004, Journal of Symbolic Logic.
[24] Peter B. Andrews. On connections and higher-order logic , 2004, Journal of Automated Reasoning.
[25] Andreas Nonnengart. How to Use Modalities and Sorts in Prolog , 1994, JELIA.
[26] Geoff Sutcliffe,et al. Solving the $100 modal logic challenge , 2009, J. Appl. Log..
[27] Peter B. Andrews. An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.
[28] Hans Jürgen Ohlbach,et al. A Resolution Calculus for Modal Logics , 1988, CADE.
[29] Lawrence C. Paulson,et al. Experiments on Supporting Interactive Proof Using Resolution , 2004, IJCAR.
[30] Luis Fariñas del Cerro. MOLOG: A system that extends PROLOG with modal logic , 2009, New Generation Computing.