Polyadic dynamic logics for HPSG parsing

DOI10.1007/S10849-008-9061-XMaRDI QIDQ1016030zbMATH OpenOpenAlexFDO

Authors Anders Søgaard, Martin Lange

Publication date 4 May 2009

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

Full work available at URL https://doi.org/10.1007/s10849-008-9061-x

zbMATH Keywords

model checkingparsingdynamic logicHPSG

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic in computer science (03B70) Natural language processing (68T50) Linguistics (91F20)

Recommendations

• Mechanizing Mathematical Reasoning
• scientific article; zbMATH DE number 1104366
• Model-checking parse trees
• Sources of Complexity in GPSG Theory
• Computational structure of GPSG models

Cites work

• scientific article; zbMATH DE number 2020180 (Why is no real title available?)
• scientific article; zbMATH DE number 1488208 (Why is no real title available?)
• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• A Theorem on Boolean Matrices
• Linguistics, Logic and Finite Trees
• Model checking hybrid logics (with an application to semistructured data)
• Model checking propositional dynamic logic with all extras
• On the complexity of RSRL
• Propositional dynamic logic of regular programs
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• The complexity of modellability in finite and computable signatures of a constraint logic for head-driven phrase structure grammar
• Unification grammars and off-line parsability

Cited in

(3)

• Model-checking parse trees
• Sequence-dominance grammars
• Mechanizing Mathematical Reasoning

This page was built for publication: Polyadic dynamic logics for HPSG parsing

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