Graph Algorithms for Improving Type-Logical Proof Search
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES] | |
| dc.contributor.author | MOOT, Richard | |
| dc.date.accessioned | 2024-04-15T09:50:28Z | |
| dc.date.available | 2024-04-15T09:50:28Z | |
| dc.date.issued | 2004 | |
| dc.date.conference | 2004-06 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198344 | |
| dc.description.abstractEn | Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little attention to the use of graph theoretic algorithms for type-logical proof search. In this paper we will look at several ways in which standard graph theoretic algorithms can be used to restrict the search space. In particular, we will provide an O(n4 ) algorithm for selecting an optimal axiom link at any stage in the proof search as well as a O(kn3 ) algorithm for selecting the k best proof candidates. | |
| dc.language.iso | en | |
| dc.subject.en | Automated Deduction | |
| dc.subject.en | Floyd-Warshall Algorithm | |
| dc.subject.en | Lambek Calculus | |
| dc.subject.en | Proof Net | |
| dc.subject.en | Ranked Assignments | |
| dc.title.en | Graph Algorithms for Improving Type-Logical Proof Search | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Informatique et langage [cs.CL] | |
| dc.identifier.arxiv | 0805.2303 | |
| bordeaux.page | 13-28 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | Categorial grammars - an efficient tool for natural language processing | |
| bordeaux.country | FR | |
| bordeaux.conference.city | Montpellier | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00012408 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00012408v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2004&rft.spage=13-28&rft.epage=13-28&rft.au=MOOT,%20Richard&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||