Τίτλος:
Well-founded semantics for boolean grammars
Γλώσσες Τεκμηρίου:
Αγγλικά
Περίληψη:
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 O(n3) 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. © Springer-Verlag Berlin Heidelberg 2006.
Συγγραφείς:
Kountouriotis, V.
Nomikos, C.
Rondogiannis, P.
Περιοδικό:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Λέξεις-κλειδιά:
Algorithms; Boolean algebra; Information analysis; Large scale systems; Logic design; Mathematical models, Boolean grammars; Context-free grammars; Parsing; Syntax, Semantics
