← Search

Clemente Pasti

4 accepted papers

2025

Are Language Models Efficient Reasoners? A Perspective from Logic Programming

NeurIPS 2025poster

Modern language models (LMs) exhibit strong deductive reasoning capabilities, yet standard evaluations emphasize correctness while overlooking a key aspect of human-like reasoning: *efficiency*. In real-world reasoning scenarios, much of the available information is irrelevant, and effective deducti…

Cited by 0Source ↗Scholar ↗
2025

Language Models over Canonical Byte-Pair Encodings

ICML 2025poster

Modern language models represent probability distributions over character strings as distributions over (shorter) token strings derived via a deterministic tokenizer, such as byte-pair encoding. While this approach is highly effective at scaling up language models to large corpora, its current incar…

Cited by 0Source ↗PDF ↗Scholar ↗
2025

Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo

ICLR 2025oral

A wide range of LM applications require generating text that conforms to syntactic or semantic constraints. Imposing such constraints can be naturally framed as _probabilistic conditioning_, but exact generation from the resulting distribution—which can differ substantially from the LM’s base distri…

2024

An L* Algorithm for Deterministic Weighted Regular Languages

EMNLP 2024main

Extracting finite state automata (FSAs) fromblack-box models offers a powerful approachto gaining interpretable insights into complexmodel behaviors. To support this pursuit, wepresent a weighted variant of Angluin’s (1987)L* algorithm for learning FSAs. We stay faithful to the original formulation,…