A game-theoretic characterization of Boolean grammars
From MaRDI portal
Publication:631778
DOI10.1016/j.tcs.2010.12.051zbMath1207.68175OpenAlexW2152409000MaRDI QIDQ631778
Vassilis Kountouriotis, Panos Rondogiannis, Christos Nomikos
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.051
2-person games (91A05) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)
Related Items (3)
A game semantics for disjunctive logic programming ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Linear-space recognition for grammars with contexts
Cites Work
- Well-founded semantics for Boolean grammars
- Locally stratified Boolean grammars
- Descriptive set theory
- Borel determinacy
- Boolean grammars
- An infinite-game semantics for well-founded negation in logic programming
- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
- Well-Founded Semantics for Boolean Grammars
- Minimum model semantics for logic programs with negation-as-failure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A game-theoretic characterization of Boolean grammars
