Searcharxiv⌕ Search

arXiv · 2610.34327

Vector space embeddings of modal logic formulas: theory and application

Abstract

Reasoning tasks over modal logics are notoriously difficult, comprising problems which are often semi-decidable. Hence, it is not rare for applications leveraging such tasks to exploit heuristic approaches able to give results in an acceptable amount of time, at the cost of some inaccuracies. Some approaches may benefit from vector embeddings, allowing for instance to involve neural networks and machine learning models in the reasoning process. This work aims at providing a new way to provide such embeddings specifically for the modal case, aiming for faster reasoning through both mathematical and learning techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Casavecchia, Alberto Paparella, Leonardo Serrentino. 2026-10-25. Vector space embeddings of modal logic formulas: theory and application. https://arxiv.org/abs/2610.34327

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Qualitative Collapse of Concurrent Games (Extended Version)

In this paper, we construct an interpretation-preserving functor from a category of concurrent games to the category of Scott domains and Scott-continuous functions. We give a concrete description of this functor, extending earlier results on the relational collapse of game semantics. The crux is an intricate combinatorial lemma allowing us to synchronize states of strategies which reach the same resources, but with different multiplicity. Putting this together with the previously established relational collapse, this provides a new proof of the qualitative-quantitative correspondence first established by Ehrhard in his celebrated extensional collapse theorem. Whereas Ehrhard's proof is indirect and rests on an abstract realizability construction, our result gives a concrete, combinatorial description of the extraction of quantitative information from a qualitative model.

cs.LO↗

A meta-modal logic for bisimulations

We propose a novel modal study of bisimulations. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are bisimilar to the current one under a given bisimulation. We show that bisimulations are definable in this object language via frame validity (for the forth and back conditions) and model validity (for the atomic harmony condition). Additionally, some other related notions (refinements, simulations, bisimulations for a restricted set of variables, and $n$-bisimulations) are also shown to be definable. Second, we provide a sound and complete axiomatisation of the class of all pairs of Kripke models that are bisimulation-related. Third, we show that the satisfiability problem of this logic is decidable and PSPACE-complete via a translation to standard modal logic $K$ under a simple frame condition. All our results are encoded and verified by Isabelle/HOL.

cs.LO↗

Dynamic Planar Graph Isomorphism is in DynFO

Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the dynamic planar graph isomorphism problem into the dynamic descriptive complexity class DynFO. As a consequence, there is a dynamic constant-time parallel algorithm with polynomial-size auxiliary data which maintains whether two dynamic planar graphs are isomorphic.

cs.LO↗