The Scope Grammar of Natural-Language Rules: Counting and Enumerating Readings modulo Logical Equivalence
cs.FL, cs.CL, cs.LO
Submitted: 2026-11-01
Updated: 2026-11-04
Terminology
Sources
- Counting false entries in truth tables of bracketed formulae connected by implication
- General combinatorical structure of truth tables of bracketed formulae connected by implication
- Neurosymbolic Auditing of Natural-Language Software Requirements
Related papers
- Quantitative Verification of Infinite-State Networks
- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
- Positive-Data Learning of Fixed-Observation Linear MCFGs from Working Binary Presentations
- On the Separability Problem of VASS Reachability Languages
- Exact Accepting-State Spectrum for Reversal of Permutation Automata
- On Word Representations and Embeddings in Complex Matrices