Higher-order linear logic programming of categorial deduction Export

@inproceedings{citeulike:5042918, abstract = {We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions.}, address = {San Francisco, CA, USA}, author = {Morrill, Glyn}, booktitle = {Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics}, citeulike-article-id = {5042918}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=976993}, citeulike-linkout-1 = {http://dx.doi.org/10.3115/976973.976993}, comment = {This paper very neatly anticipates Frank's and my translation of ordered logic into linear logic, but does so in a rather obfuscated way that doesn't lead to a general treatment of linear logic that we need for our framework; furthermore, it is very "horn-oriented" and does not deal with existential creation. However, the stuff me and Frank have positied is possible should almost certainly be seen as a straightforward generalization of this to a higher-powered version of ordered logic. }, doi = {10.3115/976973.976993}, keywords = {categorial-logic, focusing, higher-order-logic-programming, linear-logic, logic-programming, weanreview}, location = {Dublin, Ireland}, pages = {133--140}, posted-at = {2009-07-02 16:21:36}, priority = {0}, publisher = {Morgan Kaufmann Publishers Inc.}, title = {Higher-order linear logic programming of categorial deduction}, url = {http://dx.doi.org/10.3115/976973.976993}, year = {1995} }

TY - CONF ID - citeulike:5042918 L3 - citeulike-article-id:5042918 N2 - We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions. CY - Dublin, Ireland AD - San Francisco, CA, USA EP - 140 TI - Higher-order linear logic programming of categorial deduction PB - Morgan Kaufmann Publishers Inc. T2 - Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics SP - 133 KW - categorial-logic KW - focusing KW - higher-order-logic-programming KW - linear-logic KW - logic-programming KW - weanreview N1 - This paper very neatly anticipates Frank's and my translation of ordered logic into linear logic, but does so in a rather obfuscated way that doesn't lead to a general treatment of linear logic that we need for our framework; furthermore, it is very "horn-oriented" and does not deal with existential creation. However, the stuff me and Frank have positied is possible should almost certainly be seen as a straightforward generalization of this to a higher-powered version of ordered logic. AU - Morrill, Glyn PY - 1995/// UR - http://dx.doi.org/10.3115/976973.976993 ER -