Fernando C. N. Peteira. Semantic inter- pretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA '90, pages 78-96, Amsterdam, Holland, 1991. SpringerVerlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....properties, as discussed below. In contrast to using the A calculus to combine fragments of meaning via ordered applications, we combine fragments of meaning through unordered conjunction, and implication. Rather than using A reduction to simplify mean ngs, we rel on deduction, as advocated by Pereira 1990; 1991J. The elements of the f structure provide an unordered set of constraints, expressed in the logic, governing how the semantics can fit together. Constraints for combining lexically provided meanings can be encoded in lexical items, as instructions for combining several arguments into a result. ....

....deduction framework enables us to use linear logic to state such operations in a formally well defined and tractable manner. In future work, we plan to explore more fully the semantics of modification, and to pursue the addition of a type system to the logic to treat quantifiers analogously to Pereira [1990; 1991]. 7 Acknowledgments We are grateful to Ron Kaplan, Stanley Peters, John Maxwell, Joan Bresnan, and Stuart Shieber for helpful comments on earlier versions of this paper. We would particularly like to thank Fernando Pereira for extensive ad very helpful discussion of the issues presented here. ....

Fernando C. N. Peteira. Semantic inter- pretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA '90, pages 78-96, Amsterdam, Holland, 1991. SpringerVerlag.

.... in Section 2 ( Nadathur and Miller, 1988] Pareschi, 1988] Some uses of Prolog in natural language analysis are discussed in Section 3 ( Miller and Nadathur, 1986] and Section 4 ( Pareschi and Miller, 1990] In Section 5 a dissenting opinion ( Moore, 1989] is presented, with the rebuttal in [Pereira, 1990c] following in Section 6. Finally, in Section 7 the proposals in [Miller, 1990] and [Hodas and Miller, 1990] are discussed. When evaluating a programming language for a particular task a number of obvious desiderata arise, such as representational ease, extensibility, and efficiency. In the case ....

....reviewed in detail in this section. His analysis bears upon the subtle issue of representational adequacy discussed earlier, where it was suggested that conventional Prolog might adequately simulate higher order analyses. A convincing argument against Moore s conclusions advanced by Pereira in [Pereira, 1990c] is reviewed in the next section. Although the examples in his paper are given in the unification grammar notation used in the Core Language Engine developed by SRI s Cambridge Research Center, they are translated into equivalent DCGs here for consistency s sake. 5.1 Unification vs. Functional ....

[Article contains additional citation context not shown here]

Fernando C. N. Pereira. Semantic interpretation as higher-order deduction. In Proceedings of the Second European Workshop on Logics and AI, Springer-Verlag, September 1990.

....Harrop formulas allow universal quantifications in the bodies of clauses. The combination of these two extensions provides a rich notion of dynamic scoping, which adresses important issues in as various fields as theorem proving [6, 18, 5] deductive databases [3] natural language processing [19, 17, 7], type inference [5, 20] software engineering [21] and modularity in logic programming [13] However, the concrete use of Hereditary Harrop formulas has too often been limited by its restriction to a top down evaluation strategy, described for instance in [16, 18, 10] Works in natural language ....

.... modularity in logic programming [13] However, the concrete use of Hereditary Harrop formulas has too often been limited by its restriction to a top down evaluation strategy, described for instance in [16, 18, 10] Works in natural language processing, notably Pereira s semantic interpretation [19], and in deductive databases [1] advocate evaluations based on a bottom up search. Fixpoint semantics have been provided for Hereditary Harrop formulas [12, 10] but they require infinite structures and thus cannot be given a procedural interpretation. The study of a direct, more flexible control ....

[Article contains additional citation context not shown here]

Fernando C. N. Pereira. Semantic interpretation as higher-order deduction. In Springer-Verlag, editor, Lecture Notes in Artificial Intelligence, pages 78--96, 1990.

....be coded directly. In the area of natural language parsing, Lambek [16, 17] used a logic that can be identified with a noncommutative variant of linear logic for inferring the syntactic categories of phrases. Recently, Pereira handled gaps using a (commutative) linear logic like context mechanism [26]. Neither of these approaches use or the of course operator and, hence, the apparent modal distinction between noun phrase as subject or object cannot be captured directly in them. 7 Conclusion There have been several examples in print of the need to refine the notion of intuitionistic ....

Fernando C. N. Pereira. Semantic interpretation as higher-order deduction. In Proceedings of the Second European Workshop on Logics and AI. Springer-Verlag, September 1990.

....dealing with long distance dependencies. 2 Background and Motivation Hypothetical reasoning extensions of logic programming and logic grammars have made it possible to give elegant, executable logic accounts of the types of higher order functions often involved in language processing (e.g. [8]) Previous approaches to long distance dependencies, for instance, had cluttered grammars with extra parameters that had to be carried around even by parts of the grammar that were not involved in the particular dependency treated. These parameters served for instance to relate the missing noun ....

F. C. N. Pereira. Semantic Interpretation as Higher-Order Deduction. Proc. Second European Workshop on Logics and AI, Springer-Verlag, 1990.

....properties, as discussed below. In contrast to using the calculus to combine fragments of meaning via ordered applications, we combine fragments of meaning through unordered conjunction, and implication. Rather than using reduction to simplify meanings, we rely on deduction, as advocated by Pereira [ 1990; 1991 ] The elements of the f structure provide an unordered set of constraints, expressed in the logic, governing how the semantics can fit together. Constraints for combining lexically provided meanings can be encoded in lexical items, as instructions for combining several arguments into a result. ....

....our deduction framework enables us to use linear logic to state such operations in a formally welldefined and tractable manner. In future work, we plan to explore more fully the semantics of modification, and to pursue the addition of a type system to the logic to treat quantifiers analogously to Pereira [ 1990; 1991 ] 7 Acknowledgments We are grateful to Ron Kaplan, Stanley Peters, John Maxwell, Joan Bresnan, and Stuart Shieber for helpful comments on earlier versions of this paper. We would particularly like to thank Fernando Pereira for extensive and very helpful discussion of the issues presented ....

Fernando C. N. Pereira. Semantic interpretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA'90, pages 78--96, Amsterdam, Holland, 1991. SpringerVerlag.

....meaning derivable for the utterance. 5 Quantification Our treatment of quantification (Dalrymple et al. 1994a; Dalrymple et al. 1994b; Dalrymple et al. 1995) and in particular of quantifier scope ambiguities and of the interactions between scope and bound anaphora, follows the analysis of Pereira (1990; 1991), but offers in addition a formal account of the syntax semantics interface, which was treated only informally in that earlier work. To illustrate our analysis of quantification, we will consider the following sentence: 12) Bill convinced everyone. The f structure for (12) is: 13) f : 2 6 6 4 ....

Pereira, Fernando C. N. 1991. Semantic interpretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA'90, pages 78--96, Amsterdam, Holland. Springer-Verlag.

....language parsing, Lambek (Lambek, 1958, 1987) has used a logic that can be identified with a non commutative variant of linear logic to infer the syntactic categories of phrases. Recently, Pereira described how the semantics of gaps could be computed using a linear logic like context mechanism (Pereira, 1990): his approach can be formalized using the logic described here. 9 Conclusion There have been several examples in print of the need to refine the notion of intuitionistic context found in programs written using hereditary Harrop formulas (Felty and Miller, 1988; Hodas and Miller, 1990; Pareschi ....

....be formalized using the logic described here. 9 Conclusion There have been several examples in print of the need to refine the notion of intuitionistic context found in programs written using hereditary Harrop formulas (Felty and Miller, 1988; Hodas and Miller, 1990; Pareschi and Miller, 1990; Pereira, 1990). In this paper, we proposed a refinement to hereditary Harrop formulas using a fragment of linear logic. We argued that this fragment is a sensible logic programming language by showing that interpreting it in a goal directed fashion did not lead to incompleteness and that it has a model theory ....

Pereira, F. C. N. (1990). Semantic Interpretation as Higher-Order Deduction. In Proceedings of the Second European Workshop on Logics and AI. Springer-Verlag.

....objects. There are many uses for these facilities originating from the fact that they lead to direct and declarative support for a higher order abstract syntax view of objects such as formulas and programs [MN87, PE88] Detailed discussions of applications can be found in the literature, e.g. see [Fel93, HM92, NM94, Per91, Pfe88]. Success encountered in these various experiments has driven an eoeort on our part towards developing a good implementation of the language. An important ingredient of such an implementation is, of course, a sensible treatment of lambda terms. The use that is made of lambda terms in Prolog is ....

Fernando C. N. Pereira. Semantic interpretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA'90, number 478 in Lecture Notes in Artiøcial Intelligence, pages 7896, Amsterdam, Holland, 1991. Springer-Verlag, Berlin, Germany.

....surveys some results and issues in the application of deductive interpretation to the analysis of quantification, bound anaphora and ellipsis, which were developed in collaboration with Mary Dalrymple, Martha Pollack and Stuart Shieber. Those results are the subject of several published papers [8, 24, 25, 26], which should be consulted for further motivation, details and examples. Since we are trying here to distill the pertinent issues of deductive interpretation to their simplest form, the discussion is cast in terms of a very simple and well known logic of type assignment [6, 14] which was the ....

....correspond to the di#erent possible scopings for the quantified noun phrase. Thus, the pair of Q i and x i plays in this system a role similar to that of a quantifier store element in storage based interpretation systems [5] In fact, related but more elaborate systems presented elsewhere [24, 25] use more finegrained types and rules that keep together the variable assumption and the quantifier term, enforcing directly the licensing condition outlined above. The derivation below corresponds to the only possible scoping for sentence (1) For layout reasons, the derivation is broken into ....

F. C. N. Pereira. Semantic interpretation as higher-order deduction. In J. van Eijck, editor, Logics in AI: European Workshop JELIA'90, number 478 in Lecture Notes in Artificial Intelligence, pages 78--96, Amsterdam, The Netherlands, 1991. Springer-Verlag, Berlin, Germany.

....and coherent meaning derivable for the utterance. 4 Quantification Our treatment of quantification (Dalrymple, Lamping, Pereira, and Saraswat 1995, 1996a, 1996b) and in particular of quantifier scope ambiguities and of the interactions between scope and bound anaphora, follows the analysis of Pereira (1990, 1991), but offers in addition a formal account of the syntax semantics interface, which was treated only informally in that earlier work. To illustrate our analysis of quantification, we will consider the following sentence: 20) Bill convinced everyone. The f structure for (20) is: 21) f : 2 6 4 ....

Pereira, Fernando C. N. 1991. Semantic interpretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA'90, pages 78--96, Amsterdam, Holland. Springer-Verlag.

No context found.

Pereira, F. C. N. (1990) "Semantic Interpretation as Higher-Order Deduction," Proc. Second European Workshop on Logics and AI, Amsterdam.

No context found.

Fernando C.N. Pereira. 1990. Semantic interpretation as higher-order deduction. In Jan van Eijck, editor, Logics in AI: European Workshop JELIA'90, Lecture Notes in Artificial Intelligence number 478, pages 78--96. Springer-Verlag, Berlin, Germany.

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