The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar (Q1285872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1282866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar |
scientific article; zbMATH DE number 1282866 |
Statements
The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar (English)
0 references
31 August 1999
0 references
constraint logics
0 references
speciate re-entrant logic
0 references
head-driven phrase structure grammar
0 references
modellability in a signature
0 references
complexity of modellability
0 references
0.8036312460899353
0 references
0.7255786657333374
0 references
0.7169274091720581
0 references
