Balancing clarity and efficiency in typed feature logic through delaying

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2004, Pages 239-246

  Penn, Gerald ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; LOGIC PROGRAMMING;

COMPUTATIONAL COSTS; DESIGN DECISIONS; GENERALISATION; LOGIC-PROGRAMMING; RESOURCE GRAMMARS; SIMPLE++; TYPED FEATURE LOGIC;

EFFICIENCY;

EID: 84882891831     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. H. Aït-Kaci, A. Podelski, and G. Smolka. 1992. A feature-based constraint system for logic programming with entailment. In Proceedings of the International Conference on Fifth Generation Computer Systems.
2. H. Aït-Kaći. 1984. A Lattice-theoretic Approach to Computation based on a Calculus of Partially Ordered Type Structures. Ph.D. thesis, University of Pennsylvania.
3. B. Carpenter and G. Penn. 1996. Compiling typed attribute-value logic grammars. In H. Bunt and M. Tomita, editors, Recent Advances in Parsing Technologies, pages 145–168. Kluwer.
4. B. Carpenter. 1992. The Logic of Typed Feature Structures. Cambridge.
5. A. Copestake, D. Flickinger, C. Pollard, and I. Sag. 2003. Minimal Recursion Semantics: An introduction. Journal submission, November 2003.
6. J. Doerre, M. Dorna, J. Junger, and K. Schneider, 1996. The CUF User’s Manual. IMS Stuttgart, 2.0 edition.
7. J. Doerre. 1993. Generalizing Earley deduction for constraint-based grammars. Technical Report R1.2.A, DYANA Deliverable.
8. D. Flickinger. 2000. On building a more efficient grammar by exploiting types. Natural Language Engineering, 6(1):15–28.
9. T. Goetz and W.D. Meurers. 1997. Interleaving universal principles and relational constraints over typed feature logic. In Proceedings of the 35th ACL / 8th EACL, pages 1–8.
10. M. Höhfeld and G. Smolka. 1988. Definite relations over constraint languages. LILOG Report 53, IBM Deutschland.
11. H.-U. Krieger and J. Nerbone. 1991. Feature-based inheritance networks for computational lexicons. In Proceedings of the ACQUILEX Workshop on Default Inheritance in the Lexicon, number 238 in University of Cambridge, Computer Laboratory Technical Report.
12. H.-U. Krieger and U. Schäfer. 1994. TDL — a type description language for HPSG part 1: Overview. Technical Report RR-94-37, Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI), November.
13. LinGO. 1999. The LinGO grammar and lexicon. Available on-line at http://lingo.stanford.edu.
14. G. Penn and K. Hoetmer. 2003. In search of epistemic primitives in the english resource grammar. In Proceedings of the 10th International Conference on Head-driven Phrase Structure Grammar, pages 318–337.
15. G. Penn. 2001. Tractability and structural closures in attribute logic signatures. In Proceedings of the 39th ACL, pages 410–417.
16. C. J. Pollard. 1998. Personal communiciation to the author.
17. G. Smolka. 1991. Residuation and guarded rules for constraint logic programming. Technical Report RR-91-13, DFKI.
18. G. Smolka. 1994. A calculus for higher-order concurrent constraint programming with deep guards. Technical Report RR-94-03, DFKI.
19. P. Van Roy. 1990. Can Logic Programming Execute as Fast as Imperative Programming? Ph.D. thesis, University of California, Berkeley.
20. S. Wintner. 2002. Modular context-free grammars. Grammars, 5(1):41–63.