Filtering Axiom Links for Proof Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Filtering Axiom Links for Proof Nets


An important problem for proving statements in multimodal categorial grammar is that even when using proof nets — which improve upon proof search in natural deduction and sequent calculus by identifying all equivalent proofs — the number of possible axiom links to consider is still enormous. We will propose several efficient strategies to reduce the number of axiom links and will evaluate the resulting combined strategy against a large number of random, provable Lambek calculus statements and find that we eliminate 97.92% of the planar axiom links which do not correspond to any proof net.
Fichier principal
Vignette du fichier
FG.pdf (158.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00413334 , version 1 (03-09-2009)


  • HAL Id : inria-00413334 , version 1


Richard Moot. Filtering Axiom Links for Proof Nets. Formal Grammar 2007, Laura Kallmeyer and Paola Monachesi and Gerald Penn and Giorgio Satta, Aug 2007, Dublin, Ireland. ⟨inria-00413334⟩


35 View
143 Download


Gmail Facebook X LinkedIn More