Locally stratified Boolean grammars

DOI10.1016/J.IC.2008.03.022zbMath1328.68105OpenAlexW2031701978MaRDI QIDQ948094

Christos Nomikos, Panos Rondogiannis

Publication date: 8 October 2008

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Well-founded semantics for Boolean grammars ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A game-theoretic characterization of Boolean grammars ⋮ A Game-Theoretic Characterization of Boolean Grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unrestricted complementation in language equations over a one-letter alphabet
• Boolean grammars
• Temporal stratification tests for linear and branching-time deductive databases
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• Well-Founded Semantics for Boolean Grammars
• The well-founded semantics for general logic programs
• Minimum model semantics for logic programs with negation-as-failure
• Conjunctive Grammars Can Generate Non-regular Unary Languages
• Mathematical Foundations of Computer Science 2005
• Stratified negation in temporal logic programming and the cycle-sum test

This page was built for publication: Locally stratified Boolean grammars