A Labelled Analytic Theorem Proving Environment for Categorial Grammar

Simple item page
dc.creatorLuz-Filho, Saturnino F.
dc.creatorSturt, Patrick
dc.date1995-08-15
dc.date.accessioned2026-07-07T09:09:59Z
dc.date.available2026-07-07T09:09:59Z
dc.descriptionWe present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.
dc.description11 pages, LaTeX2e, uses examples.sty and a4wide.sty
dc.identifierhttps://arxiv.org/abs/cmp-lg/9508009
dc.identifierhttp://arxiv.org/abs/cmp-lg/9508009
dc.identifierTo appear in the Proceedings of IWPT-95
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151230
dc.subjectComputation and Language
dc.titleA Labelled Analytic Theorem Proving Environment for Categorial Grammar
dc.typetext

Files

Collections

arXiv