Abstract
Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In this paper we give a novel semantics for boolean grammars which applies to all such grammars, independently of their syntax. The key idea of our proposal comes from the area of negation in logic programming, and in particular from the so-called well-founded semantics which is widely accepted in this area to be the “correct” approach to negation. We show that for every boolean grammar there exists a distinguished (three-valued) language which is a model of the grammar and at the same time the least fixed point of an operator associated with the grammar. Every boolean grammar can be transformed into an equivalent (under the new semantics) grammar in normal form. Based on this normal form, we propose an \({\mathcal{O}(n^3)}\) algorithm for parsing that applies to any such normalized boolean grammar. In summary, the main contribution of this paper is to provide a semantics which applies to all boolean grammars while at the same time retaining the complexity of parsing associated with this type of grammars.
The first author’s work is being supported by a doctoral research grant by the General Secretariat for Research and Technology under the program ΠENEΔ (grant number 03EΔ 330).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K., Bol, R.: Logic Programming and Negation: A Survey. Journal of Logic Programming 19, 20, 9–71 (1994)
Okhotin, A.: Conjunctive Grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)
Okhotin, A.: Boolean Grammars. Information and Computation 194(1), 19–48 (2004)
Przymusinska, H., Przymusinski, T.: Semantic Issues in Deductive Databases and Logic Programs. In: Banerji, R. (ed.) Formal Techniques in Artificial Intelligence: a Source-Book, pp. 321–367. North-Holland, Amsterdam (1990)
Przymusinski, T.C: Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model. In: Proceedings of the 8th Symposium on Principles of Database Systems ACM SIGACT-SIGMOD, pp. 11–21 (1989)
Rondogiannis, P., Wadge, W.W.: Minimum Model Semantics for Logic Programs with Negation-as-Failure. ACM Transactions on Computational Logic 6(2), 441–467 (2005)
van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)
Wrona, M.: Stratified Boolean Grammars. MFCS, 801–812 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kountouriotis, V., Nomikos, C., Rondogiannis, P. (2006). Well-Founded Semantics for Boolean Grammars. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_19
Download citation
DOI: https://doi.org/10.1007/11779148_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)