Skip to Main content Skip to Navigation
Conference papers

Filtering Axiom Links for Proof Nets

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00413334
Contributor : Richard Moot <>
Submitted on : Thursday, September 3, 2009 - 5:31:19 PM
Last modification on : Friday, November 6, 2020 - 11:42:27 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:24:51 PM

File

FG.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00413334, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

78

Files downloads

484