Model-Checking Parse Trees

  title={Model-Checking Parse Trees},
  author={Anudhyan Boral and Sylvain Schmitz},
  journal={2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science},
Parse trees are fundamental syntactic structures in both computational linguistics and programming language design. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy of propositional dynamic logic (PDL) on trees in these applications, and study as a sanity check the complexity of the corresponding model-checking problem: although complete for exponential… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 12 references

Conditional XPath

  • M. Marx
  • ACM Trans. Database Syst., vol. 30, pp. 929–959…
  • 2005
Highly Influential
9 Excerpts

Parsing and grammar engineering with tree automata

  • T. Cornell
  • AMiLP 2000, 2000, pp. 267–274.
  • 2000
Highly Influential
6 Excerpts

Propositional tense logic of finite trees

  • ——
  • MOL 6, 1999.
  • 1999
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…