Kuniaki Uehara, Ryo Ochitani, Osamu Kakusho, and Junichi Toyoda. A bottom-up parser based on predicate logic: A survey of the formalism and its implementation techique. In Proceedings of the  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Slr Inference: An Inference System For Fixed-Mode Logic.. - Rosenblueth, Peralta (Correct)
....[b 0 ; b 0 ; b 0 z n ; a 0 ] Z) The original DCG under Prolog takes an exponential time in n to succeed, whereas our method takes a linear time. 7. COMPARISONS WITH OTHER METHODS There are several inference methods for logic programs, that use variants of LR parsing [13, 21, 28, 30, 34, 35]. In this section, we review some of these methods and compare them with SLR inference. 23 7.1. A comparison with Nilsson s AID Nilsson s alternative implementation of DCGs (AID) 21] is perhaps closest to the present work. Essentially, Nilsson first generates LR parsing tables ignoring the ....
Kuniaki Uehara, Ryo Ochitani, Osamu Kakusho, and Junichi Toyoda. A bottom-up parser based on predicate logic: A survey of the formalism and its implementation techique. In Proceedings of the
Layer Sharing: an improved Structure-Sharing Framework - Clergerie (1993) (1 citation) (Correct)
....have been proposed for extending or replacing the standard WAM based implementation of PROLOG. For instance, one may cite the parallel models (independent AND parallelism[DeG84, HG90] OR parallelism[War87] the tabular models (OLDT[TS86] SLDAL[Vie87] XWAM[War89] or the magic set models[BMSU86, Sek89, UOKT84]. These models dif This work has been partially supported by the Eureka Software Factory (ESF) project. fer from the original one essentially in that they simultaneously maintain several computation branches instead of only one. This implies in particular that a variable may have multiple ....
Kuniaki Uehara, Ryo Ochitani, Osamu Kakusho, and Junichi Toyoda. A bottom-- up parser based on predicate logic: A survey of the formalism and its implementation technique. In Proc. of the 1984 Int. Symps. on Logic Programming, 1984.
The Structure of Shared Forests in Ambiguous Parsing - Billot, Lang (1989) (42 citations) (Correct)
.... relation between the coding of parse trees in the shared forest and the parsing schema used 2 We do not consider CF recognizers that have asymptotically the lowest complexity, but are only of theoretical interest here [35, 5] 3 There are several other published implementation of chart parsers [23, 20, 33], but they often do not give much detail on the output of the parsing process, or even side step the problem altogether [33] We do not consider here the well formed substring tables of Sheil [26] which falls somewhere in between in our classification. They do not use pointers and parse trees are ....
.... have asymptotically the lowest complexity, but are only of theoretical interest here [35, 5] 3 There are several other published implementation of chart parsers [23, 20, 33] but they often do not give much detail on the output of the parsing process, or even side step the problem altogether [33]. We do not consider here the well formed substring tables of Sheil [26] which falls somewhere in between in our classification. They do not use pointers and parse trees are only indirectly visible, but may be extracted rather simply in linear time. The table may contain useless constituents. ....
Uehara, K.; Ochitani, R.; Kakusho, O.; Toyoda, J. 1984 A Bottom-Up Parser based on Predicate Logic: A Survey of the Formalism and its Implementation Technique. 1984 Internat. Symp. on Logic Programming, Atlantic City (New Jersey), : 220-227.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC