arXiv:2608. 18813v1 Announce Type: cross Abstract: In the last years, a number of proofs of the fact that $O_2$ is a multiple context-free grammar (MCFG) were given.
arXiv:2609.23567v1 Announce Type: cross Abstract: We reconsider the theory of probabilistic formal languages generated by n-gram models and by probabilistic context-free grammars (PCFGs). The expecte...
arXiv:2607. 18961v1 Announce Type: new Abstract: Large language models (LLMs) generate fluent text by incrementally predicting the next token from a prefix.
arXiv:2607. 12443v1 Announce Type: cross Abstract: Motivated by the power of large language models, there has been renewed interest in the Gold-Angluin model of language identification in the limit, with an eye toward variants of the model that might overcome the negative results for its original formulation.
arXiv:2607. 18357v1 Announce Type: cross Abstract: Large language models now write a growing share of the world's code, increasingly inside agents and serving systems that compile, execute, or dispatch generated code without line-by-line review.
arXiv:2605. 11644v2 Announce Type: replace-cross Abstract: We study positive-data learning of languages admitting reduced working binary linear nondeleting multiple context-free grammar presentations of bounded fan-out.
arXiv:2605. 26908v2 Announce Type: replace Abstract: Exploiting the indistinguishability of objects in a probabilistic graphical model such as a factor graph is key to lifted probabilistic inference algorithms and allows for tractable probabilistic inference problems with respect to domain sizes.
arXiv:2603.01243v3 Announce Type: replace Abstract: Large language models (LLMs) are powerful tools that have found applications beyond human-machine interfaces and chatbots. Beside free-form generat...
arXiv:2606. 16077v1 Announce Type: cross Abstract: In this note, we introduce a polynomial-time version of the mistake-bounded language generation (MBLG) framework due to Kleinberg, Peale, and Reingold (2026).
arXiv:2605. 11644v3 Announce Type: replace-cross Abstract: Positive data can show that two tuple occurrences share a successful sentence context without certifying that they are safely interchangeable.
The paper presents three Isabelle/HOL embeddings of monadic second‑order logic (MSO): a deep embedding, a maximal‑shallow embedding, and a minimal‑shallow embedding that collapses formulas to bool. It introduces a two‑sorted substitution system that ensures capture‑avoiding substitution and proves the faithfulness of all embeddings. A fully mechanised two‑sorted downward Löwenheim‑Skolem theorem is established, showing that the minimal embedding recovers deep validity relative to countable assignments and aligns with both the general (Henkin‑style) and standard readings of MSO, while also demonstrating differences in classical MSO properties across the embeddings.
arXiv:2607. 20483v1 Announce Type: new Abstract: Constraining the generation of autoregressive large language models (LLMs) is an important component of integrating language models into formal systems.
arXiv:2608. 15536v1 Announce Type: new Abstract: In value-based argumentation, an audience's ordering of values decides which attacks succeed as defeats.