The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar

DOI10.1023/A:1008247127922zbMath0919.03026OpenAlexW2000011000MaRDI QIDQ1285872

Bjørn Aldag, Paul John King, Kiril Ivanov Simov

Publication date: 31 August 1999

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008247127922

zbMATH Keywords

head-driven phrase structure grammarcomplexity of modellabilityconstraint logicsmodellability in a signaturespeciate re-entrant logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic of natural languages (03B65) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (2)

On the Complexity of RSRL ⋮ Polyadic dynamic logics for HPSG parsing

This page was built for publication: The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar