| tech,4-1-C94-1077,ak | handling </term> . A new , flexible <term> | inference method | </term> for <term> Horn logic program </term> | #26767 A new, flexibleinference method for Horn logic program is proposed. | |
| other,7-1-C94-1077,ak | flexible <term> inference method </term> for <term> | Horn logic program | </term> is proposed . It is also a drastic | #26770 A new, flexible inference method forHorn logic program is proposed. | |
| tech,7-2-C94-1077,ak | is also a drastic generalization of <term> | chart Parsing | </term> , <term> partial instantiation </term> | #26783 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,ak | generalization of <term> chart Parsing </term> , <term> | partial instantiation | </term> of <term> clauses </term> in a program | #26786 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,ak | <term> partial instantiation </term> of <term> | clauses | </term> in a program roughly corresponding | #26789 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,ak | a program roughly corresponding to <term> | arcs | </term> in a <term> chart </term> . <term> Chart-like | #26796 It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding toarcs in a chart. | |
| tech,0-3-C94-1077,ak | arcs </term> in a <term> chart </term> . <term> | Chart-like parsing | </term> and <term> semantic-head-driven generation | #26801 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,ak | <term> Chart-like parsing </term> and <term> | semantic-head-driven generation | </term> emerge from this method . With a <term> | #26804 Chart-like parsing andsemantic-head-driven generation emerge from this method. | |
| model,2-4-C94-1077,ak | </term> emerge from this method . With a <term> | parsimonious instantiation scheme | </term> for <term> ambiguity packing </term> | #26813 With aparsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms. | |
| tech,6-4-C94-1077,ak | parsimonious instantiation scheme </term> for <term> | ambiguity packing | </term> , the <term> parsing complexity </term> | #26817 With a parsimonious instantiation scheme forambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms. | |
| other,10-4-C94-1077,ak | <term> ambiguity packing </term> , the <term> | parsing complexity | </term> reduces to that of standard <term> | #26821 With a parsimonious instantiation scheme for ambiguity packing, theparsing complexity reduces to that of standard chart-based algorithms. | |
| tech,17-4-C94-1077,ak | </term> reduces to that of standard <term> | chart-based algorithms | </term> . We present an efficient , <term> | #26828 With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standardchart-based algorithms. |
