Graph Algorithms for Improving Type-Logical Proof Search
MOOT, Richard
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
MOOT, Richard
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
< Réduire
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Langue
en
Communication dans un congrès
Ce document a été publié dans
Categorial grammars - an efficient tool for natural language processing, 2004-06, Montpellier. 2004p. 13-28
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Mots clés en anglais
Automated Deduction
Floyd-Warshall Algorithm
Lambek Calculus
Proof Net
Ranked Assignments
Origine
Importé de halUnités de recherche