804 search results - page 83 / 161 » On the Termination of the Chase Algorithm |
69
Voted
GPCE
2007
Springer
15 years 4 months ago
2007
Springer
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...
103
Voted
EMNLP
2007
15 years 2 months ago
2007
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
87
Voted
AAAI
1994
15 years 1 months ago
1994
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
60
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
87
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...