On the complexity of RSRL

DOI10.1016/S1571-0661(05)82580-0MaRDI QIDQ4923561zbMATH OpenFDO

Authors Stephan Kepser

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(05)82580-0

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Linguistics (91F20)

Recommendations

• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
• Fragments of language
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
• scientific article; zbMATH DE number 1488208
• More fragments of language.

Cites work

• A note on the Entscheidungsproblem
• A variant of a recursively unsolvable problem
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar

Cited in

(3)

• Polyadic dynamic logics for HPSG parsing
• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
• On the complexity of MMSNP

This page was built for publication: On the complexity of RSRL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923561)