Tootfinder

This https://arxiv.org/abs/2503.04779 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Can LLMs Reason About Program Semantics? A Comprehensive Evaluation of LLMs on Formal Specification Inference
Large Language Models (LLMs) are increasingly being used to automate programming tasks. Yet, LLMs' capabilities in reasoning about program semantics are still inadequately studied, leaving significant potential for further exploration. This paper introduces FormalBench, a comprehensive benchmark designed to evaluate LLMs' reasoning abilities on program semantics, particularly via the task of synthesizing formal program specifications to assist verifying program correctness. This task requires b…

Semantics-Aware Human Motion Generation from Audio Instructions
Zi-An Wang, Shihao Zou, Shiyao Yu, Mingyuan Zhang, Chao Dong
https://arxiv.org/abs/2505.23465

Semantics-Aware Human Motion Generation from Audio Instructions
Recent advances in interactive technologies have highlighted the prominence of audio signals for semantic encoding. This paper explores a new task, where audio signals are used as conditioning inputs to generate motions that align with the semantics of the audio. Unlike text-based interactions, audio provides a more natural and intuitive communication method. However, existing methods typically focus on matching motions with music or speech rhythms, which often results in a weak connection betw…

This https://arxiv.org/abs/2501.13114 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Continuous Algebra: Algebraic Semantics for Continuous Propositional Logic
We have introduced continuous algebra as the algebraic semantics for Continuous Propositional Logic (CPL). A Continuous algebra is an MV-algebra together with an unary operator $κ$, analogous to the unary connective $\dfrac{1}{2}$ in CPL. We establish structural results, including the subdirect representation theorem. We also introduce $\ell u^*$-groups, which are lattice ordered groups with strong unit $u$, denoted by $\ell u$-groups, with a partial operator $^*$ that mimics the behavior of $…

Recursive Difference Categories and Topos-Theoretic Universality
Andreu Ballus Santacana
https://arxiv.org/abs/2505.22931 https://arx…

Recursive Difference Categories and Topos-Theoretic Universality
We introduce a radically minimal categorical foundation for logic, semantics, and computation, built from a single generative axiom of recursive difference. From the null mnema M0 and iterated labeled extensions by D, we form the free category M and its sheaf topos Sh(M). We prove: Modal completeness: Lawvere-Tierney topologies on Sh(M) classify all standard modal logics (K, T, S4, S5) purely via submonoids of the free monoid D*. Fixed-point expressivity: The internal mu-calculus over infin…

Last week, we continued our #ISE2025 lecture on distributional semantics with the introduction of neural language models (NLMs) and compared them to traditional statistical n-gram models.
Benefits of NLMs:
- Capturing Long-Range Dependencies
- Computational and Statistical Tractability
- Improved Generalisation
- Higher Accuracy
@…

This https://arxiv.org/abs/2502.18200 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Zero-Shot Semantic Communication with Multimodal Foundation Models
Most existing semantic communication (SemCom) systems use deep joint source-channel coding (DeepJSCC) to encode task-specific semantics in a goal-oriented manner. However, their reliance on predefined tasks and datasets significantly limits their flexibility and generalizability in practical deployments. Multi-modal foundation models provide a promising solution by generating universal semantic tokens. Inspired by this, we introduce SemCLIP, a zero-shot SemCom framework leveraging the contrasti…

An instance of FreeCHR with refined operational semantics
Sascha Rechenberger, Thom Fr\"uhwirth
https://arxiv.org/abs/2505.22155 https://

An instance of FreeCHR with refined operational semantics
Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations of CHR for numerous host languages. However, the existing implementations often reinvent the way to embed CHR, which impedes maintenance and weakens assertions of correctness. To formalize and thereby unify the embedding of CHR into arbitrary host languages, we introduced the framework FreeCHR and proved it to be a valid rep…

The complexity of deciding characteristic formulae modulo nested simulation
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingolfsdottir
https://arxiv.org/abs/2505.22277

The complexity of deciding characteristic formulae modulo nested simulation
This paper studies the complexity of determining whether a formula in the modal logics characterizing the nested-simulation semantics is characteristic for some process, which is equivalent to determining whether the formula is satisfiable and prime. The main results are that the problem of determining whether a formula is prime in the modal logic characterizing the 2-nested-simulation preorder is CoNP-complete and is PSPACE-complete in the case of the n-nested-simulation preorder, when n>= 3. …

Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning
Xiaofeng Pan, Jing Chen, Haitong Zhang, Menglin Xing, Jiayi Wei, Xuefeng Mu, Zhongqian Xie
https://arxiv.org/abs/2505.23298

Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning
Recent works of music representation learning mainly focus on learning acoustic music representations with unlabeled audios or further attempt to acquire multi-modal music representations with scarce annotated audio-text pairs. They either ignore the language semantics or rely on labeled audio datasets that are difficult and expensive to create. Moreover, merely modeling semantic space usually fails to achieve satisfactory performance on music recommendation tasks since the user preference spac…

This https://arxiv.org/abs/2505.02548 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Modal logic for reasoning about uncertainty and confusion
We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we expand Gödel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim$ defined as $v({\sim}ϕ,w)=1-v(ϕ,w)$. We provide semantics with the finite model property for our new logic that we call $\mathbf{K}\mathsf{G_{inv}}$ and show its equivalence…

In the #ISE2025 lecture today we were introducing our students to the concept of distributional semantics as the foundation of modern large language models. Historically, Wittgenstein was one of the important figures in the Philosophy of Language stating thet "The meaning of a word is its use in the language."

Next stop in our NLP timeline is 2013, the introduction of low dimensional dense word vectors - so-called "word embeddings" - based on distributed semantics, as e.g. word2vec by Mikolov et al. from Google, which enabled representation learning on text.
T. Mikolov et al. (2013). Efficient Estimation of Word Representations in Vector Space.
…

Efficient Estimation of Word Representations in Vector Space
We propose two novel model architectures for computing continuous vector representations of words from very large data sets. The quality of these representations is measured in a word similarity task, and the results are compared to the previously best performing techniques based on different types of neural networks. We observe large improvements in accuracy at much lower computational cost, i.e. it takes less than a day to learn high quality word vectors from a 1.6 billion words data set. Fur…