tech,4-1-C94-1077,bq |
A new , flexible
<term>
inference method
</term>
for
<term>
Horn logic program
</term>
is proposed .
|
#20882
A new, flexibleinference method for Horn logic program is proposed. |
other,7-1-C94-1077,bq |
A new , flexible
<term>
inference method
</term>
for
<term>
Horn logic program
</term>
is proposed .
|
#20885
A new, flexible inference method forHorn logic program is proposed. |
tech,7-2-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
|
#20898
It is also a drastic generalization ofchart Parsing, partial instantiation of clauses in a program roughly corresponding to arcs in a chart. |
tech,10-2-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
|
#20901
It is also a drastic generalization of chart Parsing,partial instantiation of clauses in a program roughly corresponding to arcs in a chart. |
other,13-2-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
|
#20904
It is also a drastic generalization of chart Parsing, partial instantiation ofclauses in a program roughly corresponding to arcs in a chart. |
other,20-2-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
|
#20911
It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding toarcs in a chart. |
other,23-2-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
|
#20914
It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding to arcs in achart. |
tech,0-3-C94-1077,bq |
It is also a drastic generalization of
<term>
chart Parsing
</term>
,
<term>
partial instantiation
</term>
of
<term>
clauses
</term>
in a program roughly corresponding to
<term>
arcs
</term>
in a
<term>
chart
</term>
.
<term>
Chart-like parsing
</term>
and
<term>
semantic-head-driven generation
</term>
emerge from this method .
|
#20916
It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding to arcs in a chart.Chart-like parsing and semantic-head-driven generation emerge from this method. |
tech,3-3-C94-1077,bq |
<term>
Chart-like parsing
</term>
and
<term>
semantic-head-driven generation
</term>
emerge from this method .
|
#20919
Chart-like parsing andsemantic-head-driven generation emerge from this method. |
tech,3-4-C94-1077,bq |
With a parsimonious
<term>
instantiation scheme
</term>
for
<term>
ambiguity packing
</term>
, the
<term>
parsing complexity
</term>
reduces to that of standard
<term>
chart-based algorithms
</term>
.
|
#20929
With a parsimoniousinstantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms. |
tech,6-4-C94-1077,bq |
With a parsimonious
<term>
instantiation scheme
</term>
for
<term>
ambiguity packing
</term>
, the
<term>
parsing complexity
</term>
reduces to that of standard
<term>
chart-based algorithms
</term>
.
|
#20932
With a parsimonious instantiation scheme forambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms. |
other,10-4-C94-1077,bq |
With a parsimonious
<term>
instantiation scheme
</term>
for
<term>
ambiguity packing
</term>
, the
<term>
parsing complexity
</term>
reduces to that of standard
<term>
chart-based algorithms
</term>
.
|
#20936
With a parsimonious instantiation scheme for ambiguity packing, theparsing complexity reduces to that of standard chart-based algorithms. |
tech,17-4-C94-1077,bq |
With a parsimonious
<term>
instantiation scheme
</term>
for
<term>
ambiguity packing
</term>
, the
<term>
parsing complexity
</term>
reduces to that of standard
<term>
chart-based algorithms
</term>
.
|
#20943
With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standardchart-based algorithms. |