Higher-order linear logic programming of categorial deduction

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 variet...

ver descrição completa

Detalhes bibliográficos
Autor: Morrill, Glyn|||0000-0002-5528-4384
Tipo de documento: relatório científico
Data de publicação:1994
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositório:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglês
OAI Identifier:oai:upcommons.upc.edu:2117/96971
Acesso em linha:https://hdl.handle.net/2117/96971
Access Level:Acceso aberto
Palavra-chave:Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
Descrição
Resumo: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. We illustrate categorial calculi of discontinuity, and calculi with unary bracket operators.