D11-1114 , i , h2h4 , j -RSB- The above deduction system infers items in a bottom-up fashion
J03-1006 independently from the weighted deduction system . <figurecaption> c ( c ) 2003
E95-1001 case for atoms within ordinary deduction systems . <title> Principle Based Semantics
D11-1114 dynamic programming algorithm as a deduction system ( Shieber et al. , 1995 ) . The
C88-2121 be formalized into a decidable deduction system that has finite search space
E83-1032 therefore a so called backward deduction system . The proof goes back from the
D11-1114 - An important property of the deduction system lar algorithm . More specifically
E09-1009 items . Productions In Shieber 's deduction systems the grammar is a constant and
D15-1043 on &#963; . Figure 1 shows the deduction system , where p is unordered and any
E09-1009 string . 5.1 Deduction Rules The deduction system deals with three types of items
E09-1034 represent these algorithms as deduction systems , we use the notion of D-rules
C88-2128 of it ) are parameters of the deduction system . The parameterization should
E99-1022 contrast to Johnson and D6rre 's deduction system , though , the selective magic
E14-1039 define the algorithm as weighted deduction system ( Nederhof , 2003 ) which generalizes
C88-2121 on trees ( similar to Lambek 's deduction system on categories ( 1958 and 1961
C88-2121 parsing problem in a decidable deduction system on trees ( similar to Lambek
C00-1080 items or edges . A grammatical deduction system or , in Sikkel 's terminology
E99-1020 closely related to grammatical deduction systems ( Shieber et al. , 1995 ) , where
E14-1039 Furthermore , we think of the deduction system as a way do derive a set of items
D11-1114 Shieber et al. , 1995 ) . The deduction system starts with axiom -LSB- cents
hide detail