Well-founded semantics for Boolean grammars

DOI10.1016/J.IC.2009.05.002zbMATH Open1181.68162OpenAlexW2110784116MaRDI QIDQ840701FDOQ840701

Authors: Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis 

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

Recommendations

• Well-Founded Semantics for Boolean Grammars
• Boolean grammars
• Unambiguous Boolean grammars
• scientific article; zbMATH DE number 2040923
• Conjunctive and Boolean grammars: the true general case of the context-free grammars

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

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

Cites Work

• The well-founded semantics for general logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boolean grammars
• Logic programming and negation: A survey
• Title not available (Why is that?)
• Minimum model semantics for logic programs with negation-as-failure
• BOOLEAN FUZZY SETS
• Mathematical Foundations of Computer Science 2005
• Locally stratified Boolean grammars
• Well-Founded Semantics for Boolean Grammars
• Title not available (Why is that?)

Cited In (22)

• A game-theoretic characterization of Boolean grammars
• Mathematical Foundations of Computer Science 2005
• Parsing Boolean grammars over a one-letter alphabet using online convolution
• Two-sided context specifications in formal grammars
• A simple P-complete problem and its language-theoretic representations
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Unambiguous Boolean grammars
• Locally stratified Boolean grammars
• Well-Founded Semantics for Boolean Grammars
• An extension of context-free grammars with one-sided context specifications
• Hardest languages for conjunctive and Boolean grammars
• Boolean grammars and gsm mappings
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Language equations with complementation: expressive power
• Ternary Equational Languages
• Boolean grammars
• Language equations
• Input-driven languages are linear conjunctive
• Unambiguous conjunctive grammars over a one-symbol alphabet
• Linear-space recognition for grammars with contexts
• The hardest language for conjunctive grammars
• Parsing by matrix multiplication generalized to Boolean grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840701)