A constraint-based bottom-up counterpart to definite clause grammars

Christiansen, Henning

doi:10.1075/cilt.260.24chr

Part of

Recent Advances in Natural Language Processing III: Selected papers from RANLP 2003
Edited by Nicolas Nicolov, Kalina Bontcheva, Galia Angelova and Ruslan Mitkov
[Current Issues in Linguistic Theory 260] 2004
► pp. 227–

A constraint-based bottom-up counterpart to definite clause grammars

Henning Christiansen

Published online: 30 November 2004

https://doi.org/10.1075/cilt.260.24chr

Cited by

Cited by 1 other publications

De Koninck, Leslie, Tom Schrijvers & Bart Demoen

2007. The Correspondence Between the Logical Algorithms Language and CHR. In Logic Programming [Lecture Notes in Computer Science, 4670], ► pp. 209 ff.

This list is based on CrossRef data as of 7 april 2024. Please note that it may not be complete. Sources presented here have been supplied by the respective publishers. Any errors therein should be reported to them.