Well-founded semantics for Boolean grammars

DOI10.1016/j.ic.2009.05.002zbMath1181.68162OpenAlexW2110784116MaRDI QIDQ840701

Christos Nomikos, Panos Rondogiannis, Vassilis Kountouriotis

Publication date: 14 September 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.05.002

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (17)

Input-driven languages are linear conjunctive ⋮ Parsing by matrix multiplication generalized to Boolean grammars ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ A game-theoretic characterization of Boolean grammars ⋮ Linear-space recognition for grammars with contexts ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ An extension of context-free grammars with one-sided context specifications ⋮ The Hardest Language for Conjunctive Grammars ⋮ Parsing Boolean grammars over a one-letter alphabet using online convolution ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ BOOLEAN GRAMMARS AND GSM MAPPINGS ⋮ Ternary Equational Languages ⋮ Language equations with complementation: expressive power ⋮ Language equations ⋮ Two-sided context specifications in formal grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally stratified Boolean grammars
• Boolean grammars
• BOOLEAN FUZZY SETS
• Well-Founded Semantics for Boolean Grammars
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Minimum model semantics for logic programs with negation-as-failure
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Well-founded semantics for Boolean grammars