16 search results - page 1 / 4 » The Limits of Unification |
ACL
2006
13 years 8 months ago
2006
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
AAAI
1993
13 years 8 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
ACL
1990
13 years 8 months ago
1990
Current complex-feature based grammars use a single procedure--unification--for a multitude of purposes, among them, enforcing formal agreement between purely syntactic features. ...
SEKE
2005
Springer
14 years 27 days ago
2005
Springer
Generics (templates) attempt to unify similar program structures to avoid redundancy. How well do generics serve this purpose in practice? We try to answer this question through e...
IJAR
2008
13 years 7 months ago
2008
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...