Stratified boolean grammars

Authors:
Michał Wrona
Affiliations:
Institute of Computer Science, University of Wrocław
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 4
Cited 3

Model checking and boolean graphs

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Horn clauses and the fixpoint query hierarchy

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Boolean grammars

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Locally stratified Boolean grammars

Information and Computation
Well-founded semantics for Boolean grammars

Information and Computation
Well-Founded semantics for boolean grammars

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar generates a language according to this semantics. We show, that stratified semantics covers a class of important and natural languages. We introduce a recognition algorithm for Boolean grammars compliant to this semantics.