Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying

The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resource Grammar (LinGO, 1999, ERG). It is argued that a simple generalization of the conventional delay statements used in logic programming is sufficient to restore much of the functionality and concomitant benefit that the ERG elected to forego, with an acceptable although still perceptible computational cost.

[1]  Hans-Ulrich Krieger,et al.  Inheritance, Defaults and the Lexicon: Feature-Based Inheritance Networks for Computational Lexicons , 1994 .

[2]  Dan Flickinger,et al.  Minimal Recursion Semantics: An Introduction , 2005 .

[3]  Walt Detmar Meurers,et al.  Interleaving universal principles and relational constraints over typed feature logic , 1997 .

[4]  Peter Van Roy,et al.  Can Logic Programming Execute as Fast as Imperative Programming? , 1990 .

[5]  Gerald Penn,et al.  In search of epistemic primitives in the English Resource Grammar (or Why HPSG can't live without higher-order datatypes) , 2003, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[6]  Hans-Ulrich Krieger,et al.  Feature-based inheritance networks for computational lexicons , 1994 .

[7]  Gerald Penn.  Tractability and Structural Closures in Attribute Logic Type Signatures , 2001, ACL.

[8]  Gert Smolkaz,et al.  Deenite Relations over Constraint Languages , 1988 .

[9]  Gert Smolka,et al.  A Feature-Based Constraint System for Logic Programming with Entailment , 1992, FGCS.

[10]  H. Aït-Kaci.  A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification) , 1984 .

[11]  Bob Carpenter,et al.  Compiling Typed Attribute-Value Logic Grammars , 1993, IWPT.

[12]  Shuly Wintner.  Modular Context-Free Grammars , 2002, Grammars.

[13]  FlickingerDan.  On building a more efficient grammar by exploiting types , 2000 .

[14]  Gert Smolka.  Residuation and Guarded Rules for Constraint Logic Programming , 1991, WCLP.

[15]  S. Gerd,et al.  A calculus for higher-order concurrent constraint programming with deep guards , 1994 .

[16]  Gert Smolka,et al.  A Feature Constraint System for Logic Programming with Entailment , 1994, Theor. Comput. Sci..

[17]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .