Alternation and the computational complexity of logic programs
Journal of Logic Programming
Journal of the ACM (JACM)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Parsing with discontinuous constituents
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Computing with features as formulae
Computational Linguistics
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A logical version of functional grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Information and Computation
New developments in parsing technology
Information and Computation
| Hi-index | 0.00 |
We investigate the weak expressive power of a notation using first-order logic, augmented with a facility for recursion, to give linguistic descriptions. The notation is precise and easy to read, using ordinary conventions of logic. Two versions of the notation are presented. One, called CLFP, speaks about strings and concatenation, and generates the class EXPTIME of languages accepted by Turing machines in time 2cn for some c 0. The other, called ILFP, speaks about integer positions in strings, and generates the class PTIME of languages recognizable in polynomial time. An application is given, showing how to code Head Grammars in ILFP, showing why these grammars generate only polynomial time languages.