Model Checking Parse Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Model Checking Parse Trees

Résumé

Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. 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 time in the general case, we find natural restrictions on grammars for our applications and establish complexities ranging from nondeterministic polynomial time to polynomial space in the relevant cases.

Dates et versions

hal-00907951 , version 1 (22-11-2013)

Identifiants

Citer

Anudhyan Boral, Sylvain Schmitz. Model Checking Parse Trees. Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.153--162, ⟨10.1109/LICS.2013.21⟩. ⟨hal-00907951⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More