Type theoretic semantics for semnet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1085, Issue , 1996, Pages 582-595

  Shiu, S ^a   Luo, Z ^a   Garigliano, R ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION; SEMANTICS;

CONSTRUCTIVE TYPE THEORY; EPISTEMIC REASONINGS; FORMAL SEMANTICS; NATURAL LANGUAGES; REASONING MECHANISM; SEMANTIC MODEL; SEMANTIC NETWORK; THEORETIC SEMANTICS;

FORMAL METHODS;

EID: 33845999084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61313-7_102     Document Type: Conference Paper

References (22)

1. S. S. All and S. C. Shapiro. Natural language processing using a propositional semantic network with structured variables. Minds and Machines, 3, No 4, 1993.
2. Ronnie Cann. Formal Semantics, An Introduction. Cambridge University Press, 1993.
3. H. B. Curry and R. Feys. Cominatory Logic, volume 1. North Holland Publishing Company, 1958.
4. Th. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3), 1988.
5. R. L. Constable. Implementing Mathematics with the NuPRL Proof Development System. Prentice Hall, 1986.
6. G. Dowek. The coq proof assistant: User’s guide (version 5.6). Technical report, INRIA-Rocquencourt and CNRS-ENS Lyon, 1990.
7. C. Froidevaux and D. Kayser. Inheritance in semantic networks and default logic. In P. Smets, E. H. Mamdani, D. Dubois, and H. Prade, editors, NonStandard Logics for Automated Reasoning. Academic Press, Harcourt Brace Jovanovich Publishers, 1988.
8. J. Y. Girard. Interprétation fonctionelle et élimination des coupures de Varithmétique. PhD thesis, 1972.
9. W. A. Howard. The formulae-as-types notion of construction. In J. Hindley and J. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic. Academic Press, 1980.
10. D. Kumar and H. Chalupsky. Guest Editorial for Special Issue on Propositional Knowledge Representation. Journal of Experimental and Theoretical Artificial Intelligence, 5, No 2 and 3, 1993.
11. D. Long and R. Garigliano. Reasoning By Analogy And Causality: A model and application. Artificial Intelligence. Ellis Horwood, 1994.
12. Z. Luo and R. Pollack. LEGO Proof Development System: User’s Manual. Technical report, University of Edinburgh LFCS report series, 1992.
13. Z. Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford Science Publications, 1994.
14. R. Morgan et al. Description of the lolita system as used in muc-6. In to appear in - Proceedings Sixth Message Understanding Conference (MUC-6), 1995.
15. P. Martin-Lof. Intuitionistic Type Theory. Bibliopolis, 1984.
16. L. Magnusson and B. Nordström. The ALF proof editor and its proof engine. In Types for proof and programs, LNCS, 1994.
17. B. Nordstrom, K. Petersson, and J. Smith. Programming in Martin-Lofs Type Theory: An Introduction. Oxford University Press, 1990.
18. A. Rante. Type-Theoretical Grammar. Oxford Science Publications, 1994.
19. S. Short. Knowledge Representation of Lolita. PhD thesis, (to be submitted) Department of Computer Science, University of Durham, 1996.
20. J. F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. The Systems Programming Series. Addison Wesley, 1984.
21. W. A. Woods. Understanding subsumption and taxonomy: A framework for progress. In J. F. Sowa, editor, Principles of Semantic Networks: Explorations in the Representation of Knowledge, chapter 1. Morgan Kauffman, 1991.
22. W. A. Woods and J. G. Schmolze. The KL-One family. Computers Mathematics and Applications, 23, No 2 and 3:133-177, 1992.