@inproceedings{luz-filho-sturt-1995-labelled,
title = "A Labelled Analytic Theorem Proving Environment for Categorial Grammar",
author = "Luz-Filho, Saturnino F. and
Sturt, Patrick",
booktitle = "Proceedings of the Fourth International Workshop on Parsing Technologies",
month = sep # " 20-24",
year = "1995",
address = "Prague and Karlovy Vary, Czech Republic",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/1995.iwpt-1.20",
pages = "152--161",
abstract = "We 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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="luz-filho-sturt-1995-labelled">
<titleInfo>
<title>A Labelled Analytic Theorem Proving Environment for Categorial Grammar</title>
</titleInfo>
<name type="personal">
<namePart type="given">Saturnino</namePart>
<namePart type="given">F</namePart>
<namePart type="family">Luz-Filho</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Patrick</namePart>
<namePart type="family">Sturt</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1995-sep" 20-24"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Fourth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Prague and Karlovy Vary, Czech Republic</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>We 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.</abstract>
<identifier type="citekey">luz-filho-sturt-1995-labelled</identifier>
<location>
<url>https://aclanthology.org/1995.iwpt-1.20</url>
</location>
<part>
<date>1995-sep" 20-24"</date>
<extent unit="page">
<start>152</start>
<end>161</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T A Labelled Analytic Theorem Proving Environment for Categorial Grammar
%A Luz-Filho, Saturnino F.
%A Sturt, Patrick
%S Proceedings of the Fourth International Workshop on Parsing Technologies
%D 1995
%8 sep" 20 24"
%I Association for Computational Linguistics
%C Prague and Karlovy Vary, Czech Republic
%F luz-filho-sturt-1995-labelled
%X We 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.
%U https://aclanthology.org/1995.iwpt-1.20
%P 152-161
Markdown (Informal)
[A Labelled Analytic Theorem Proving Environment for Categorial Grammar](https://aclanthology.org/1995.iwpt-1.20) (Luz-Filho & Sturt, IWPT 1995)
ACL