D. S. Warren. Programming the PTQ grammar in XSB. In R. Ramakrishnan, editor, Applications of Logic Databases, pages 217-234. Kluwer Academic Publishers, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of penalty factor for each violated constraint like in [Men95] and [Erb93] Improving Efficiency When moving from a formalism for representing linguistic phenomena to a more expressive one, the price to pay is often a loss of efficiency. Efficiency can be recovered by using both memoing (see [War98] and coroutining techniques available in actual logic programming systems. As a guideline in pursuing efficiency improvement, an interesting approach can be found in [vNBKN97] where a head corner parsing is proposed that mixes top down and bottom up analyses. Furthermore a concurrent version of ....

David S. Warren. Programming the ptq grammar in xsb. Technical report, Computer Science Department - University of Stony Brook, 1998.

....resolution principle of tabling that we use, called SLG resolution, we first present some examples which motivate the need to freely mix LD resolution and tabled execution. 3. 1 Mixing Tabled and LD Execution: Motivating Examples It has long been noted in the literature (e.g. in Early [1970] and Warren [1995]) that tabled evaluation can be used for context free grammar recognition and parsing: tabling eliminates redundancy and handles grammars that would otherwise infinitely loop under Prolog style execution (e.g. left recursive ones) The following program, where all predicates are tabled, provides ....

WARREN, D. S. 1995. Programming the PTQ grammar in XSB. In Applications of Logic Databases, R. Ramakrishnan, Ed. Kluwer Academic Publishers, Chapter 10, 217--234.

....are some problems with it. For example, the order of the predicates in the recursive rule is important, as due to Prolog s computation rule, if the predicates are in the reverse order, then goals such as path(a,Y) will loop forever. This problem can be avoided by using a memoing system such as XSB [28], or a bottomup system such as Aditi [26] However, it is common to re write the program above so that the path found is returned as part of the answer. In such cases, system such as XSB and Aditi will only work for graphs which are acyclic. For example, consider the program below. ....

D.S. Warren. Programming the PTQ Grammar in XSB. in Applications of Logic Databases, Raghu Ramakrishna (ed.), Kluwer Academic, 1994.

....iterative deepening search, the Andorra model, etc. and yet it would seem to be useful to reason about the behaviour of programs in a variety of execution models. For example, consider a program containing the rule p : q, p. In Prolog, the goal p will run forever. In a system such as XSB[12] or Aditi[11] this query will terminate with failure. Hence we may see this as a bad Prolog program (it fails to terminate) and a good XSB or Aditi program (it terminates) However, there may be cases in which the 5 non termination is desirable, such as in a command processor or operating ....

D.S. Warren. Programming the PTQ Grammar in XSB. in Applications of Logic Databases, Raghu Ramakrishna (ed.), Kluwer Academic, 1994. 11

....negation that it should support: SLG style negation, and Existential Negation for both tabled and non tabled predicates. The last of these, Existential Negation for non tabled predicates is currently implemented as Prolog s 3 Copying can also prove a problem for DCGs. One solution is proposed in [88]. CHAPTER 5. PERFORMANCE 106 SLDNF, while Existential Negation for tabled predicates is implemented as described in Section 4.5. While SLG style negation is necessary to ensure polynomial data complexity, the well known stalemate game furnishes an example where Existential Negation is more ....

D. S. Warren. Programming the PTQ grammar in XSB. In Proc. ILPS'93 Workshop on Programming with Logic Databases, 1993.

....computation of penalty factor for each violated constraint like in [25] and [13] Improving EOEciency When moving from a formalism for representing linguistic phenomena to a more expressive one, the price to pay is often a loss of eOEciency. EOEciency can be recovered by using both memoing (see [35]) and coroutining techniques available in actual logic programming systems. As a guideline in pursuing eOEciency improvement, an interesting approach can be found in [34] where a head corner parsing is proposed that mixes top down and bottom up analyses. Furthermore a concurrent version of LHIP ....

David S. Warren. Programming the ptq grammar in xsb. Technical report, Computer Science Department - University of Stony Brook, 1998.

....of penalty factor for each violated constraint like in [Men95] and [Erb93] Improving Efficiency When moving from a formalism for representing linguistic phenomena to a more expressive one, the price to pay is often a loss of efficiency. Efficiency can be recovered by using both memoing (see [War98] and coroutining techniques available in actual logic programming systems. As a guideline in pursuing efficiency improvement, an interesting approach can be found in [vNBKN97] where a head corner parsing is proposed that mixes top down and bottom up analyses. Furthermore a concurrent version of ....

David S. Warren. Programming the ptq grammar in xsb. Technical report, Computer Science Department - University of Stony Brook, 1998.

....are some problems with it. For example, the order of the predicates in the recursive rule is important, as due to Prolog s computation rule, if the predicates are in the reverse order, then goals such as path(a,Y) will loop forever. This problem can be avoided by using a memoing system such as XSB [18], or a bottom up system such as Aditi [17] However, it is more common to re write the program above so that the path found is returned as part of the answer. In such cases, system such as XSB and Aditi will only work for graphs which are acyclic. For example, consider the program below. ....

David S. Warren. Programming the PTQ Grammar in XSB. in Applications of Logic Databases, Raghu Ramakrishna (ed.), Kluwer Academic, 1994.

....are some problems with it. For example, the order of the predicates in the recursive rule is important, as due to Prolog s computation rule, if the predicates are in the reverse order, then goals such as path(a,Y) will loop forever. This problem can be avoided by using a memoing system such as XSB [20], or a bottom up system such as Aditi [18] However, it is common to re write the program above so that the path found is returned as part of the answer. In such cases, systems such as XSB and Aditi will only work for graphs which are acyclic. For example, consider the program below. ....

D.S. Warren. Programming the PTQ Grammar in XSB. in Applications of Logic Databases, Raghu Ramakrishna (ed.), Kluwer Academic, 1994.

....Searching for ambiguities and finding a complete and correct grammar for Old Hebrew were two of the goals linguists reached with AMOS. Being successful on the syntactical level, we explored how to do the next step, the semantical analysis, via a common variant of Montague grammars (as [8] and [13] did it for Prolog) using deductive database technology. In 1973 Richard Montague published an influential paper on formal semantics for natural languages, titled The Proper Treatment of Quantification in Ordinary English or PTQ for short [6] In this paper he gave (1. a formal grammar for an ....

....easier. At that time Montague grammars become more popular. But still all Prolog implementations have the disadvantage of forbidden left recursion, so all left recursive PTQ rules have to be transformed, but transforming the syntactic rules corresponds to a change of the semantic rules. Warren [13] solved this problem by introducing a tabling method in his Prolog system. In the essence, tabling corresponds to a sort of seminaive evaluation of recursion. Thus we found it worthwhile to think about implementing a PTQ system as a deductive database, which in general evaluates seminaive, ....

[Article contains additional citation context not shown here]

Warren D. S.: Programming the PTQ Grammar in XSB, in Ramakrishnan R.: Applications of Logic Databases, Kluwer Academic, 1995, pp. 217 -- 234

....some problems with it. For example, the order of the predicates in the recursive rule is important, as due to Prolog s computation rule, if the predicates are in the reverse order, then goals such as path(a,Y) will loop forever. This problem can be avoided by using a memoing system such as XSB [War94] or a bottom up system such as Aditi [VRD 94] However, it is common to re write the program above so that the path found is returned as part of the answer. In such cases, systems such as XSB and Aditi will only work for graphs which are acyclic. For example, consider the program below. ....

David S. Warren. Programming the ptq grammar in xsb. In Raghu Ramakrishna, editor, Applications of Logic Databases. Kluwer Academic, 1994.

....large amount of copying and a great deal of space used. What happens is that the input string (i.e. list) may be copied into and out of the table many times. To avoid this problem, the input list can be transformed into a set of datalog atoms. Currently this must be done manually, as explained in [40], available in the tech reports directory. Chapter 9 Library Utilities In this chapter we introduce some useful predicates that are supplied with the system. These predicates are available only when imported them from (or explicitly consult) the corresponding modules. 9.1 List Processing The ....

....NAME ) To delete an index named INDEX NAME These following predicates are the supported PRODBI syntax for deleting and inserting rows: db add record( DEPT , 30, SALES , CHICAGO ] arguments are a list composed of field values and the table name to insert the row. delete record( DEPT , [40, ) to delete rows from DEPT matching the list of values mentioned in second argument. For other SQL statements use db sql 1 with the SQL statement as the first argument. For example: db sql( grant connect to fred identified by bloggs ) CHAPTER 12. XSB ORACLE INTERFACE 148 12.3.9 Interface ....

David S. Warren. Programming the PTQ grammar in XSB. In Raghu Ramakrishnan, editor, Applications of Logic Databases, pages 217--234. Kluwer Academic Publishers, 1995.

....large amount of copying and a great deal of space used. What happens is that the input string (i.e. list) may be copied into and out of the table many times. To avoid this problem, the input list can be transformed into a set of datalog atoms. Currently this must be done manually, as explained in [47], available in the tech reports directory. Chapter 9 Restrictions and Current Known Bugs In this chapter we indicate some features and bugs of XSB that may a ect the users at some point in their interaction with the system. If at some point in your interaction with the system you suspect that ....

D. S. Warren. Programming the PTQ grammar in XSB. In R. Ramakrishnan, editor, Applications of Logic Databases, pages 217-234. Kluwer Academic Publishers, 1995.

No context found.

D. S. Warren. Programming the PTQ grammar in XSB. In R. Ramakrishnan, editor, Applications of Logic Databases, pages 217-234. Kluwer Academic Publishers, 1995.

No context found.

D.S. Warren. Programming the PTQ Grammar in XSB. in Applications of Logic Databases, Raghu Ramakrishna #ed.#, Kluwer Academic, 1994.

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