Everything about Boolean grammar
Boolean grammars, introduced by Okhotin, are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars allow implicit disjunction represented by multiple rules for a single nonterminal symbol, which is the only logical connective expressible in context-free grammars. Conjunction and negation can be used, in particular, to specify intersection and complement of languages. An intermediate class of grammars known as conjunctive grammars allows conjunction and disjunction, but not negation. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Boolean grammarA 5-minute orientation
- Skim a recent paper: Asymmetric magnetization switching and programmable complete Boolean logic enabled by long-range intralayer Dzyaloshinskii-Moriya interactionInfluential work since 2022
- Pick up a classic book: Flexibility principles in boolean semanticsThe most-reprinted book on the subject
- Read the landmark paper: Fast context-free grammar parsing requires fast boolean matrix multiplicationCited 71 times
- Go sideways: Conjunctive grammarA closely related topic
- Go sideways: Syntactic predicateA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
🆕 Influential since 2022
đź“š Books worth reading
Flexibility principles in boolean semanticsYoad Winter · 2001- 📕Flexible Boolean semanticsYoad Winter · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Conjunctive grammar Conjunctive grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars…
- Syntactic predicate A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies…
- List of rules of inference This is a list of rules of inference, logical laws that relate to mathematical formulae. Rules of inference are syntactical transform rules which one can…
- Attribute grammar An attribute grammar is a formal way to supplement a formal grammar with semantic information processing. Semantic information is stored in attributes…
- Language equation Language equations are mathematical statements that resemble numerical equations, but the variables assume values of formal languages rather than numbers…
- Range concatenation grammar Range concatenation grammar (RCG) is a grammar formalism developed by Pierre Boullier in 1998 as an attempt to characterize a number of phenomena of natural…
- Context-free grammar In formal language theory, a context-free grammar (CFG) is a formal grammar whose production rules can be applied to a nonterminal symbol regardless of…
- ID/LP grammar ID/LP Grammars are a subset of Phrase Structure Grammars, differentiated from other formal grammars by distinguishing between immediate dominance (ID)…