Model Theoretic Syntax and Parsing

DOI10.1016/S1571-0661(05)82588-5zbMath1263.68169MaRDI QIDQ4923571

Adi Palm

Publication date: 24 May 2013

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

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50) Temporal logic (03B44)

Uses Software

• TABLEAUX

Cites Work

• The temporal logic of branching time
• Self-reference and modal logic
• Parsing schemata and correctness of parsing algorithms
• TABLEAUX: A general theorem prover for modal logics
• Syntactic codes and grammar refinement
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Deciding full branching time logic
• Efficient Temporal Satisfiability
• Propositional temporal logics: decidability and completeness
• Alternating automata: Unifying truth and validity checking for temporal logics
• An efficient context-free parsing algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model Theoretic Syntax and Parsing