Preference logic grammars

Computer Languages - Tập 24 - Trang 179-196 - 1998
Bharat Jayaraman1, Kannan Govindarajan2, Surya Mantha3
1Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, 14260, USA
2Java Products Group, Oracle Corporation, Redwood Shores, CA 94065, USA
3Computer and Electronic Equipment Group, Pittiglio Todd Rabin & McGrath, 1000, Potomac Street, N.W., Washington DC 20007, USA

Tài liệu tham khảo

Abramson H, Dahl V. Logic grammars. In: Symbolic computation. Springer, New York, 1989 Aho A, Ullman JD. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977 Abramson H. Definite Clause Translation Grammars. In: Proc. IEEE Int. Symposium on Logic Programming, 1984. p. 233–241 Govindarajan K. Optimization and relaxation in logic languages. Ph.D. thesis. Dept of Computer Science, SUNY-Buffalo, 1997 Govindarajan K, Jayaraman B, Mantha S. Preference logic programming. In: Proc. 12th Intl. Conf. on Logic Programming. MIT Press, Mass., 1995. p. 731–745 Govindarajan K, Jayaraman B, Mantha S. Optimization and relaxation in constraint logic languages. In: Proc. 23rd ACM Symp. on Principles of Programming Languages, 1996. p. 91–103 Brown A, Mantha S, Wakayama T. The declarative semantics of document processing. Computer and Mathematical Modelling, 1993 Aho, 1989, Code Generation using tree matching and dynamic programming, ACM Transactions on Programming Languages and Systems, 11, 491, 10.1145/69558.75700 Knuth, 1981, Breaking paragraphs into lines, Software Practice and Experience, 11, 1119, 10.1002/spe.4380111102 Lloyd JW. Foundations of logic programming. Springer, New York, 1987 Pereira, 1980, Definite clause grammars for language analysis—a survey of the formalism and a comparison with augmented transition networks, Artificial Intelligence, 13, 231, 10.1016/0004-3702(80)90003-X Clocksin WF, Mellish CS. Programming in prolog. Springer, New York, 1981 Warren, 1992, Memoing for logic Programs, Communications of the ACM, 35, 93, 10.1145/131295.131299 Sagonas K, Swift T, Warren DS. XSB as an Efficient deductive database engine. In: Proc. ACM SIGMOD Conference, 1994. p. 442–453 Jaffar J, Lassez JL. Constraint logic programming. In: Proc. 14th ACM Symp. on Principles of Programming Languages, 1987. p. 111–119 Jaffar, 1994, Constraint logic programming: a survey, Journal of Logic Programming, 19/20, 503, 10.1016/0743-1066(94)90033-7 Schubert L. Are there preference trade-offs in attachment decisions? In: Proc. AAAI, 1986. p. 601–605 Knuth, 1968, Semantics of context-free languages, Mathematical Systems Theory, 2, 127, 10.1007/BF01692511 van Hentenryck P. Constraint satisfaction in logic programming. MIT Press, Mass., 1989 Kimball, 1973, Seven principles of surface structure parsing in natural language, Cognition, 2, 15, 10.1016/0010-0277(72)90028-5 Pereira FCN. A new characterization of attachment preferences. In: Dowty DR, Karttunen L, Zwicky AM, editors. Natural language processing, ch. Chap. 9. Cambridge University Press, 1985. p. 307–319 Uszkoreit H. Strategies for adding control information to declarative grammars. In: Proc. 29th Conference of the Association of Computational Linguistics, 1991. p. 237–245 Wilson, 1993, Hierarchical constraint logic programming, Journal of Logic Programming, 16, 277, 10.1016/0743-1066(93)90046-J