Graph Algorithms for Improving Type-Logical Proof Search

Details Graph Algorithms for Improving Type-Logical Proof Search Graph Algorithms for Improving Type-Logical Proof Search

2008-05-15

arxiv.org/abs/0805.2303v1

Dans Categorial grammars - an efficient tool for natural language processing - June 2004 - Categorial grammars - an efficient

Computer Science

Computation and Language

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graph Algorithms for Improving Type-Logical Proof Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Algorithms for Improving Type-Logical Proof Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Algorithms for Improving Type-Logical Proof Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509857