The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
type: Item
instance of: scholarly article
title: The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
zbMATH Open document ID: 0919.03026
DOI: 10.1023/A:1008247127922
author: Paul John King
author: Kiril Ivanov Simov
author: Bjørn Aldag
published in: Journal of Logic, Language and Information
publication date: 1999-08-31T00:00:00Z
Mathematics Subject Classification ID: 03B65
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 1282866
zbMATH Keywords: constraint logics
zbMATH Keywords: speciate re-entrant logic
zbMATH Keywords: head-driven phrase structure grammar
zbMATH Keywords: modellability in a signature
zbMATH Keywords: complexity of modellability
MaRDI profile type: Publication
full work available at URL: a:1008247127922
OpenAlex ID: W2000011000
description: scientific article; zbMATH DE number 1282866