[1]LIU Dong-ning,TANG Yong,HUANG Chang-qin,et al.Concurrence Lambek calculus and its categorical grammar? in temporal querying languages[J].CAAI Transactions on Intelligent Systems,2009,4(3):245-250.
Copy

Concurrence Lambek calculus and its categorical grammar? in temporal querying languages

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 4 Number of periods: 2009 3 Page number: 245-250 Column: 学术论文—自然语言处理与理解 Public date: 2009-06-25
Title:
Concurrence Lambek calculus and its categorical grammar? in temporal querying languages
Author(s):
LIU Dong-ning1; 2;  TANG Yong1;  HUANG Chang-qin1; 3;  TANG Na1
1.Department of Computer Science, Sun Yatsen University, Guangzhou 510275, China;
2. Department of Maths, Sun Yatsen University, Guangzhou 510275, China;
3.College of Educational Information Technology, South China Normal University, Guangzhou 510631, China
Keywords:
temporal querying language;  syntactic analysis;  concurrence Lambek calculus;  categorial grammars
CLC:
TP301
DOI:
-
Abstract:
Axiomatic systems and proof methods for temporal logic have so far found relatively few applications in querying language modeling of temporal databases because the standard temporal logic is not recursively axiomatizable. As a result, temporal logic can not use axiomatic systems and proof methods to religiously depict inference and querying of a temporal database. Thus it is necessary to find a replacement for temporal logic which, by axiomatic methods, can become the implement of a syntactic and semantic analysis of temporal querying languages. The Lambek calculus and its categorical grammar as the former and λcalculus as the latter have become those substitutes in this paper, because of the properties of type theory, the comparability between SQL and state sentence, the axiomatic and proof methods of Lambek calculus and λcalculus，and their correspondence by CurryHoward Isomorphism. So, according to the operations of temporality, we built a new axiomatic system used in syntactic analysis which is called concurrence Lambek calculus (LCTQ), and use its categorial grammar to deal with the temporal querying language. Prof theory shows that for protection of computable resources, LCTQ is more regorous and ideal.
References:
［1】CHOMICKI J,TOMAN D.Temporal logic information systems［M］//CHOMICKI J, SAAKE G. Logics for databases and information systems. Norwell, USA: Kluwer Academic Publishers, 1998: 3170.
?［2］GABBAY D M, HODKINSON I, REYNOLDS M. Temporal logic: mathematical foundations and computational aspects ［M］. New York, USA：Oxford University Press, 1994.
［3］BUSZKOWSKI W. Categorial grammars and substructural logics［C］//Proceedings of the 5th International Conference on Logic and Cognition. Guangzhou, China, 2006.
［4］RESTALL G. An introduction to substructural logics［M］. New York, USA: Routledge, 2000
［5］GER G.Anaphora and type logical grammar［M］. Dordrecht, the Netherlands： Springer, 2005.
［6］LAMBEK J. The mathematics of sentence structure［J］. The American Mathematical Monthly, 1958, 65: 154170.
［7］BARENDEGT H P. The lambda calculus: its syntax and semantics: volume 103 of studies in logic and the foundations of mathematics［M］.Amsterdam, the Netherlands: Elsevier, 1984.
［8］PENTUS M. Lambek grammars are contextfree［C］//Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science. Montreal, Canada, 1993: 429433.
［9）PENTUS M. Lambek calculus is Lcomplete：Report LP 9314 ［R］. Amsterdam: Institute for Logic, Language and Computation, University of Amsterdam, 1993.
?［10］PENTUS M. Models for the Lambek calculus［J］. Annals of Pure and Applied Logic, 1995, 75 (1/2): 179213.
［11］PENTUS M. Lambek caculus is NPcomplete: CUNY PhD Program in Computer Science Technical Report TR2003005［R］. New York: The Graduate Center, The City University of New York, 2003.
［12］CURRY H B, Some logic aspects of grammatical structure ［C］//Proceedings of the Twelfth Symposium in Applied Mathematics. New York, USA: American Mathematical Society, 1961: 5668
［13］HOWARD W. The formulaeastypes notion of construction［M］//SELDIN J R, HINDLEY J P. To H B Curry: essays on combinatory logic, Lambda calculus and formalism. New York: Academic Press, 1980: 479490.
［14］RAO J H, K〖AKU¨〗NGAS P, MATSKIN M. Logicbased Web services composition: from service description to process model［C］// Proceedings of the IEEE International Conference on Web Services. Washington DC, USA: IEEE Computer Society, 2004: 446453.
?［15］UUSTALU T, VENE V. The essence of dataflow programming［J］. Lecture Notes in Computer Science, 2006, 4164: 135167.
［16］HAJEK P. Metamathematics of fuzzy logic［M］. Dordrecht, the Netherlands: Kluwer Academic Publishers, 1998.
［17］Research Team on Temporal Data Processing Component. TempDB［EB/OL］. ［20080711］. http://www.cosoft.sysu.edu.cn/TempDB/index.htm, 2008.
［18］ALLEN J F. Maintaining knowledge about temporal intervals［J］. Communications of the ACM, 1983, 26(11): 832843.
Similar References:

Memo

-

Last Update: 2009-08-31

Copyright © CAAI Transactions on Intelligent Systems