Well-founded semantics for Boolean grammars

DOI10.1016/J.IC.2009.05.002MaRDI QIDQ840701zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• BOOLEAN FUZZY SETS
• Boolean grammars
• Locally stratified Boolean grammars
• Logic programming and negation: A survey
• Mathematical Foundations of Computer Science 2005
• Minimum model semantics for logic programs with negation-as-failure
• The well-founded semantics for general logic programs
• Well-Founded Semantics for Boolean Grammars

Cited in

(22)

• Locally stratified Boolean grammars
• Boolean grammars and gsm mappings
• Input-driven languages are linear conjunctive
• Two-sided context specifications in formal grammars
• Language equations with complementation: expressive power
• A game-theoretic characterization of Boolean grammars
• Language equations
• Boolean grammars
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Unambiguous Boolean grammars
• 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
• Ternary Equational Languages
• Unambiguous conjunctive grammars over a one-symbol alphabet
• Mathematical Foundations of Computer Science 2005
• Well-Founded Semantics for Boolean Grammars
• The hardest language for conjunctive grammars
• Parsing Boolean grammars over a one-letter alphabet using online convolution
• An extension of context-free grammars with one-sided context specifications
• Linear-space recognition for grammars with contexts
• Hardest languages for conjunctive and 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)