Polyadic dynamic logics for HPSG parsing

DOI10.1007/s10849-008-9061-xzbMath1165.03332OpenAlexW2048770139MaRDI QIDQ1016030

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 checkingdynamic logicparsingHPSG

Mathematics Subject Classification ID

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

Cites Work

• Propositional dynamic logic of regular programs
• 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
• Model checking propositional dynamic logic with all extras
• Model checking hybrid logics (with an application to semistructured data)
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Linguistics, Logic and Finite Trees
• On the Complexity of RSRL
• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item

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