Tootfinder

Eine Insel der Harmonie am Nordufer https://weddingweiser.de/eine-insel-der-harmonie-am-nordufer/

The Weekly Grill
Great Australian Pods Podcast Directory: #GreatAusPods

Güneşin alnında badem dikiyorum. Umarım kurumazlar.

Tag 7 war nochmal #Trient gewidmet. Am Vormittag das herrliche Schloss Castello del Buonconsiglio. Am Nachmittag das Naturmuseum Muse, das extrem beliebt und ausgebucht ist.
#MeinRadUrlaub2025

Jag har för lätt att bli distraherad idag och stänger nee fliken med masto - men först: snygg tuppkam, röd och fin

Wir haben #Wetter auf dem #FediCamp!
Danke @…, sieht mega gut aus!

#Zugreisen sind in #Europa auf vielen grenzüberschreitenden Strecken noch immer teurer als #Flugreisen.
Laut #Greenpeace

Greenpeace-Preisrecherche: Zugfahren in Europa noch immer teurer als Fliegen
Eine neue europaweite Greenpeace-Studie zeigt, dass klimaschädliches Fliegen auf den meisten grenzüberschreitenden Strecken noch immer günstiger ist als Bahnfahren.

Well done AI for bagsying humans with the Chinese room.

Don't Upgrade To Windows 11, Get This Instead... - #SomeOrdinaryGamers
https://www.youtube.com/watch?v=-EkaZlF5eF0

Mémento au sujet de QEMU et de sa configuration réseau
#TIL #QEMU

Bei der Szene blieb mir der Mund offen stehen. Für einen Moment sah es so aus, als ob Auto und Fahrrad kollidieren.

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Beyond Monads and Biproducts: A Uniform Interpretation of Parallelism in Intuitionistic Logic
Alejandro D\'iaz-Caro, Octavio Malherbe

AI Methods for Permutation Circuit Synthesis Across Generic Topologies
Victor Villar, Juan Cruz-Benito, Ismael Faro, David Kremer
https://arxiv.org/abs/2509.16020 https://

AI Methods for Permutation Circuit Synthesis Across Generic Topologies
This paper investigates artificial intelligence (AI) methodologies for the synthesis and transpilation of permutation circuits across generic topologies. Our approach uses Reinforcement Learning (RL) techniques to achieve near-optimal synthesis of permutation circuits up to 25 qubits. Rather than developing specialized models for individual topologies, we train a foundational model on a generic rectangular lattice, and employ masking mechanisms to dynamically select subsets of topologies during…

Heritage Day in France - Le Journées Européennes du Patrimoine - #europe

Man kann und muss eine klare Kante zeigen. Irrelevantes muss aber nicht extra hervorgeben werden. Irrelevantes muss nicht unnötig Bedeutung bekommen.
Wir sollten dieses Rumgepöble, Gejammere und sinnlose Rumgeplärre viel öfter ignorieren. Lassen wir es doch verhallen und reagieren nicht mehr so stark darauf. Konzentrieren wir uns doch auf Positives und verkünden das viel intensiver. | Norbert Eder

Well yeh that's why my Epson HX-20's 'charge battery' triggers - the detector input is indeed dropping below the 1.2v threshold with serial running (and microcassette connected albeit idle). So the voltage detector is triggering at the right voltage.
It could just be the lack of real batteries I guess, but hmm, getting there.
#retrocomputing

Minimizing Task-Oriented Age of Information for Remote Monitoring with Pre-Identification
Shuying Gan, Xijun Wang, Chao Xu, Xiang Chen
https://arxiv.org/abs/2508.14575 https://

Minimizing Task-Oriented Age of Information for Remote Monitoring with Pre-Identification
The emergence of new intelligent applications has fostered the development of a task-oriented communication paradigm, where a comprehensive, universal, and practical metric is crucial for unleashing the potential of this paradigm. To this end, we introduce an innovative metric, the Task-oriented Age of Information (TAoI), to measure whether the content of information is relevant to the system task, thereby assisting the system in efficiently completing designated tasks. We apply TAoI to a wirel…

In Zeiten, wo sich #Hitze, #Duerre & #Sturm abwechseln, braucht es Bäume in der #Stadtnatur, die diesen Be…

Timmermans over onze bijdrage aan internationaal recht. 🎯🎯🎯
Debat Direct
https://debatdirect.tweedekamer.nl/2025-09-18/financien/plenaire-zaal/algemene-politieke-besc…

Spannend:
Die designierte Bahn-Chefin Evelyn Palla scheint nach dem, was man bisher über sie lesen kann, keine #Interessenkonflikte mitzubringen. Sie war offenbar in ihrer bisherigen Laufbahn nicht Automobil-Lobbyistin o.Ä., hat dafür laut Süddeutsche aber einen Triebfahrzeug-Schein.
Dabei schienen doch bisher nicht

Neuer Bahnchef ist eine Chefin: Evelyn Palla soll die Deutsche Bahn retten
Offenbar soll erstmals eine Frau die Bahn lenken – die bisherige Regionalvorständin. Wer ist sie und was erwartet sie?

The office last night... how it started

Vogt am Freitag geht schwimmen. Mit #KI. #dnip https://dnip.ch/2025/08/08/vogt-am-freitag-schwimmhilfe/

"Sinister bassoon music."

Replaced article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/1]:
- Tremors and horocycle dynamics on the moduli space of translation surfaces
Jon Chaika, John Smillie, Barak Weiss

Two Optimizations on the St\aa lmarck Procedure
Sergei Leonov, Liam Davis
https://arxiv.org/abs/2509.16172 https://arxiv.org/pdf/2509.16172

Two Optimizations on the Stålmarck Procedure
In this paper, we introduce StalmarckSAT, the a modern re-implementation of the Stålmarck Procedure for SAT solving, and present two novel strategies to improve the Procedure, Cardinality Driven Branching (CDB) and Deductive Priority Ordering (DPO). CDB is a heuristic to improve branching with the dilemma rule, and DPO intelligently orders simple rules based on their deductive potential. Our results demonstrate improved solve times with both strategies.

I think this will be a good new challenge for #3dprinting. I think the tube diameter needs to be sufficient for stability, otherwise it will be too elastic and act like a spring instead of a ball. #openscad (thanks @damarberlari@x for his stunning visual article

I am taking my time with Ted Season 1 for almost two years, and it's so worth it. I just watched episode 5 out of 7. Such a satisfying show. The teddy bear is pixel-perfect and the jokes are outrageous. It's like ALF but if everyone was stoned and honest of their expectations from life in general 😀
Ted season 2 : r/peacock

Am 17.9.25 gibt es ab 18:30 in der KulturMarktHalle #Berlin im Rahmen vom Projekt „Accessible Forest Practice“ eine Abschlussveranstaltung. Zielgruppe sind Leute aus den Bereichen Therapie, Pädagogik, #Umweltbildung oder soziale Arbeit & gezeigt wird inwiefern

[2025-09-22 Mon (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Holy hell, GPT-5 is snappy today. Did they switch to a diffusion model?

Was soll man da sagen.
Jetzt wo der Präsident vom Supreme Court abgesegnet über dem Gesetz steht, (an das sich Trump andernfalls eh nicht halten würde), ist er wohl auch zu Insidergeschäften berechtigt. Oder?
https://taz.de/Finanzgeschaefte-des-US-Praesidenten/!6…

Finanzgeschäfte des US-Präsidenten: Trump kaufte Anleihen für über 100 Millionen Dollar
Seit seinem Amtsantritt hat Donald Trump mehr als 600 mal in Aktien und Staatsanleihen investiert. Auch in Firmen, die von seiner Politik profitieren könnten.

Computer gets hot, open Activity monitor, CPU graph at its limit, force quit two hanging #vitest processes probably from #VSCode , CPU usage down to single digit percent value.
Computer gets slowly less hot, move on with whatever you were doing before.

HOPIUMFORTHEMASSES - Ministry Album Playlist
https://www.youtube.com/playlist?list=OLAK5uy_ltuahNTfFUMcF_if5GtrBUGpBck4n15I0

Density of finitely supported invariant measures for automorphisms of compact abelian groups
Rotem Yaari
https://arxiv.org/abs/2507.14113 https://

Density of finitely supported invariant measures for automorphisms of compact abelian groups
We study the structure of invariant measures for continuous automorphisms of compact metrizable abelian groups satisfying the descending chain condition. We show that the finitely supported invariant measures are weak-* dense in the space of all invariant probability measures, and that if the system is ergodic with respect to Haar measure, then the finitely supported ergodic invariant measures are also dense. A key ingredient in the proof is a variant of the specification property, which we est…

To Zip Through the Cost Analysis of Probabilistic Programs
Matthias Hetzenberger, Georg Moser, Florian Zuleger
https://arxiv.org/abs/2508.14249 https://arx…

To Zip Through the Cost Analysis of Probabilistic Programs
Probabilistic programming and the formal analysis of probabilistic algorithms are active areas of research, driven by the widespread use of randomness to improve performance. While functional correctness has seen substantial progress, automated reasoning about expected runtime remains comparatively limited. In this work, we address this challenge by introducing a refinement-typed probability monad in Liquid Haskell. Our monad enables automated reasoning about expected values and costs by encodi…

The one thing they don't tell you when you - like the fool you are - brag about how cool is Linux, is that you instantly become the person to ask for OS support, and that you'll absolutely love it, trying to figure out problems armed only with the knowledge that "it doesn't work" or "it doesn't start" 😄

It seems like this is mostly a hodge-podge of different API calls and various prompts.
Still, gives the lie to the theory that it's all just "regurgitating training data", "unable to come up with novelty", etc.
https://www.

[2025-08-21 Thu (UTC), 6 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Ricky's Hand by Ministry
https://song.link/i/1698161420

Ricky's Hand by Ministry
Listen now on your favorite streaming service. Powered by Songlink/Odesli, an on-demand, customizable smart link service to help you share songs, albums, podcasts and more.

Markov matrix perturbations to optimize dynamical and entropy functionals
Manuel Santos Gutierrez, Niccolo Zagli, Giulia Carigi
https://arxiv.org/abs/2507.14040

Markov matrix perturbations to optimize dynamical and entropy functionals
An important problem in applied dynamical systems is to compute the external forcing that provokes the largest response of a desired observable quantity. For this, we investigate the perturbation theory of Markov matrices in connection with linear response theory in statistical physics. We use perturbative expansions to derive linear algorithms to optimize physically relevant quantities such as: entropy, Kullback-Liebler-divergence and entropy production of Markov matrices and their related pro…

Shadow Warrior 3 (Original Soundtrack)
https://album.link/i/1745065037

Shadow Warrior 3 (Original Soundtrack) by Maciej Kulesza
Listen now on your favorite streaming service. Powered by Songlink/Odesli, an on-demand, customizable smart link service to help you share songs, albums, podcasts and more.

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Continuous and algebraic domains in univalent foundations
Tom de Jong, Mart\'in H\"otzel Escard\'o

The proportion of times that LLMs suddenly fail at something they've done well before seems tailor-made to screw up human reasoning about reliability. If it was 1 in 10 we would know, and be reminded often, to babysit them permanently.
If it was 1 in 1000, we'd rely on them with some reasonable safeguards. But because it's 1 in 100, we get totally screwed up.
The mistake always comes just after you've convinced yourself that "this is probably fine" and …

YAMORE (Francis Mercier & Andre Soueid Remix)
https://youtu.be/Hdcv0w8WpWo

Identification and Computation of Slow Manifolds Using the Isostable Coordinate System
Dan Wilson
https://arxiv.org/abs/2507.13997 https://

Identification and Computation of Slow Manifolds Using the Isostable Coordinate System
Koopman analysis can be used to understand the dynamics of a nonlinear dynamical system in terms a linear, but generally infinite dimensional operator. The isostable coordinate system focuses on the slowest decaying principal Koopman eigenmodes. This work leverages the isostable coordinate framework in the identification of slow manifolds for dynamical systems with fixed point attractors, defined as surfaces for which the fastest decaying isostable coordinates are zero. Numerical challenges ass…

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
Aniruddha Joshi, Supratik Chakraborty, S Akshay, Shetal Shah, Hazem Torfah, Sanjit Seshia

I kind of like this game, enough to wave my zombies-suck stance, mainly because it's an SF title and they really did their best with the visuals. The simplified combat system is a plus if you enjoy the occasional B-movie guilty pleasure. The traversal stutters are a fact of life with Unreal Engine 4, sadly.
The Callisto Protocol - FSR 4 - Linux - RX 7800 XT

[2025-08-22 Fri (UTC), no new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Almost reducibility, distortion and local perfection for diffeomorphisms of one-manifolds
H\'el\`ene Eynard-Bontemps (IF, IMJ-PRG), Emmanuel Militon (LJAD, UniCA)
https://arxiv.org/abs/2507.13770

Almost reducibility, distortion and local perfection for diffeomorphisms of one-manifolds
In this article, we characterize the distortion elements of the group of smooth diffeomorphisms of the circle and of the group of compactly supported smooth diffeomorphisms of the real line. More precisely, we prove that, in this context, an element is distorted if and only if it is almost reducible, that is if and only if it has conjugates arbitrarily close to an isometry. For diffeomorphisms with fixed points, we show that this is equivalent to being the time-1 map of a C 1 vector field witho…

Bloomberg DMCA strikes gamersnexus smuggling documentary because it quoted the President - Louis Rossmann
https://www.youtube.com/watch?v=6RJvrTC6oTI

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- From Thin Concurrent Games to Generalized Species of Structures (Extended Version)
Pierre Clairambault, Federico Olimpieri, Hugo Paquet

"... using 'traditional' machine learning techniques, passed down for generations. It's AI your grandpa would be okay with."

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Logical Expressivity and Explanations for Monotonic GNNs with Scoring Functions
Matthew Morris, David J. Tena Cucala, Bernardo Cuenca Grau

Oscillatory Behavior of Linear Nonautonomous Advanced and Delayed Impulsive Differential Equations with Discontinuous Deviating Arguments via Difference Equations
Ricardo Torres Naranjo, Eugenio Trucco Vera
https://arxiv.org/abs/2507.13559

Oscillatory Behavior of Linear Nonautonomous Advanced and Delayed Impulsive Differential Equations with Discontinuous Deviating Arguments via Difference Equations
We establish sufficient conditions to guarantee the oscillatory and non-oscillatory behavior of solutions to nonautonomous advanced and delayed linear differential equations with piecewise constant arguments: \[ x'(t) = a(t)x(t) + b(t)x([t \pm k]), \] where $k \in \mathbb{N}$, $k \geq 1$, in both impulsive and non-impulsive cases (DEPCA and IDEPCA). Due to the hybrid nature of these systems, our approach draws on results from the theory of advanced and delayed linear difference equations. The a…

Trump administration reviews 55 million visa holders for violations | Africanews
https://www.africanews.com/2025/08/22/trump-administration-reviews-55-million-visa-holders-for-violations/

Trump administration reviews 55 million visa holders for violations | Africanews
The Trump administration said Thursday it is reviewing more than 55 million people who have valid U.S. visas for any violations that could lead to deportation, part of a growing crackdown on foreigners who are permitted to be in the United States.

I was having this weird issue with Chrome/Linux on some websites where the 'i'-s were missing 😄 The characters were there, they just didn't show up. With the Internet Archive website I narrowed it down to the Helvetica.otf font. I had installed Helvetica.ttf too, but it works fine with it. Curiously, there was no problem with Firefox.

Correct Black-Box Monitors for Distributed Deadlock Detection: Formalisation and Implementation (Technical Report)
Rados{\l}aw Jan Rowicki, Adrian Francalanza, Alceste Scalas
https://arxiv.org/abs/2508.14851

Correct Black-Box Monitors for Distributed Deadlock Detection: Formalisation and Implementation (Technical Report)
Many software applications rely on concurrent and distributed (micro)services that interact via message-passing and various forms of remote procedure calls (RPC). As these systems organically evolve and grow in scale and complexity, the risk of introducing deadlocks increases and their impact may worsen: even if only a few services deadlock, many other services may block while awaiting responses from the deadlocked ones. As a result, the "core" of the deadlock can be obfuscated by its consequen…

Removing quasiconformal orbits
Jairo Bochi
https://arxiv.org/abs/2507.13519 https://arxiv.org/pdf/2507.13519

Removing quasiconformal orbits
We show that generic continuous linear cocycles over shifts and other zero-dimensional systems admit no quasiconformal orbits, thus providing a partial answer to a question of Nassiri, Rajabzadeh, and Reshadat. The proof relies on a new result about towers for homeomorphisms of zero-dimensional spaces, which may be of independent interest.

What did Ozzy Osbourne mean for the heavy metal genre? | DW News
https://www.youtube.com/watch?v=LKqkr_ptZ1U

Constraint satisfaction problems, compactness and non-measurable sets
Claude Tardif
https://arxiv.org/abs/2508.14838 https://arxiv.org/pdf/2508.14838

Constraint satisfaction problems, compactness and non-measurable sets
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to A. We show that if A has width one, then the compactness of A can be proved in the axiom system of Zermelo and Fraenkel, but otherwise, the compactness of A implies the existence of non-measurable sets in 3-space.

When Dinosaurs Threw Up A Mystery - PBS Eons
https://www.youtube.com/watch?v=eNR5vjxUEdk

Emerson-Lei and Manna-Pnueli Games for LTLf and PPLTL Synthesis
Daniel Hausmann, Shufang Zhu, Gianmarco Parretti, Christoph Weinhuber, Giuseppe De Giacomo, Nir Piterman
https://arxiv.org/abs/2508.14725

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
Recently, the Manna-Pnueli Hierarchy has been used to define the temporal logics LTLfp and PPLTLp, which allow to use finite-trace LTLf/PPLTL techniques in infinite-trace settings while achieving the expressiveness of full LTL. In this paper, we present the first actual solvers for reactive synthesis in these logics. These are based on games on graphs that leverage DFA-based techniques from LTLf/PPLTL to construct the game arena. We start with a symbolic solver based on Emerson-Lei games, which…

[2025-07-21 Mon (UTC), 6 new articles found for math.DS Dynamical Systems]
toXiv_bot_toot

Rusowsky: Tiny Desk Concert
https://www.youtube.com/watch?v=Fo89b8zAIE4

[2025-07-22 Tue (UTC), 9 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

#WhyDoIPreferActivityPub / #Mastodon
Because Threads is not federated for Threads users who live in the EU (guess why), and because Bluesky's connectivity with ActivityPub and its thousands of independent servers is sketchy. And even if that changed eventua…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Abductive forgetting
Paolo Liberatore
https://

Replaced article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/1]:
- Global planar dynamics with star nodes: beyond Hilbert's $16^{th}$ problem
Bego\~na Alarc\'on, Sofia B. S. D. Castro, Isabel S. Labouriau

I found the cause for global warming.

TIL it's a verb (Wiktionary)
Verb
lint (third-person singular simple present lints, present participle linting, simple past and past participle linted)
(transitive, computing) To perform a static check on (source code) to detect stylistic or programmatic errors.
You should lint your JavaScript code before committing it.

Computation of Interpolants for Description Logic Concepts in Hard Cases
Jean Christoph Jung, J\k{e}drzej Ko{\l}odziejski, Frank Wolter
https://arxiv.org/abs/2507.15689

Computation of Interpolants for Description Logic Concepts in Hard Cases
While the computation of Craig interpolants for description logics (DLs) with the Craig Interpolation Property (CIP) is well understood, very little is known about the computation and size of interpolants for DLs without CIP or if one aims at interpolating concepts in a weaker DL than the DL of the input ontology and concepts. In this paper, we provide the first elementary algorithms computing (i) ALC-interpolants between ALC-concepts under ALCH-ontologies and (ii) ALC-interpolants between ALCQ…

Mixed Mode Oscillations and Bifurcation Mechanism in a Nonlinear Beam-Elastic Foundation Under Parametric and External Excitations
Sobhan Mohammadi, Keegan J. Moore
https://arxiv.org/abs/2507.15648

Mixed Mode Oscillations and Bifurcation Mechanism in a Nonlinear Beam-Elastic Foundation Under Parametric and External Excitations
This paper aims to study existence condition of possible bursting oscillations generated by low frequency excitation of a nonlinear vibratory system in the presence of parametric excitation. Slow-fast dissection technique and numerical bifurcation analysis are employed to extract qualitative changes in system response originated from its nonlinear dynamics. Role of all parameters of elastic foundation and excitation model are studies and it is shown that the system exhibits the phenomena of fol…

Through the Looking-Glass, by Lewis Carroll. Illustrated by John Tenniel - Standard Ebooks
https://standardebooks.org/ebooks/lewis-carroll/through-the-looking-glass/john-tenniel

A SHACL-based Data Consistency Solution for Contract Compliance Verification
Robert David, Albin Ahmeti, Geni Bushati, Amar Tauqeer, Anna Fensel
https://arxiv.org/abs/2507.15420

A SHACL-based Data Consistency Solution for Contract Compliance Verification
In recent years, there have been many developments for GDPR-compliant data access and sharing based on consent. For more complex data sharing scenarios, where consent might not be sufficient, many parties rely on contracts. Before a contract is signed, it must undergo the process of contract negotiation within the contract lifecycle, which consists of negotiating the obligations associated with the contract. Contract compliance verification (CCV) provides a means to verify whether a contract is…

I think this tedious reviewer needs to see more "lush landscapes, epic struggles, pointed political allegories and delicious, disgusting monsters" in The Sandman ->
The Sandman season two review – Neil Gaiman’s emo drama is so pretentious it ruins everything | Television | The Guardian

Quantum Programming in Polylogarithmic Time
Florent Ferrari (ENS de Lyon), Emmanuel Hainry (MOCQUA, LORIA), Romain P\'echoux (LORIA, MOCQUA), M\'ario Silva (LORIA, MOCQUA)
https://arxiv.org/abs/2507.15415

Quantum Programming in Polylogarithmic Time
Polylogarithmic time delineates a relevant notion of feasibility on several classical computational models such as Boolean circuits or parallel random access machines. As far as the quantum paradigm is concerned, this notion yields the complexity class FBQPOLYLOG of functions approximable in polylogarithmic time with a quantum random-access Turing machine. We introduce a quantum programming language with first-order recursive procedures, which provides the first programming-language-based chara…

A new construction for Melnikov chaos in piecewise-smooth planar systems
Alessandro Calamai, Matteo Franca, Michal Pospisil
https://arxiv.org/abs/2507.15543

A new construction for Melnikov chaos in piecewise-smooth planar systems
In this paper we consider a piecewise smooth $2$-dimensional system \[ \dot{\vec{x}}=\vec{g} (\vec{x})+\varepsilon\vec{g}(t,\vec{x},\varepsilon) \] where $\varepsilon>0$ is a small parameter and $\vec{f}$ is discontinuous along a curve $Ω^0$. We assume that $\vec{0}$ is a critical point for any $\varepsilon \geq 0$, and that for $\varepsilon=0$ the system admits a trajectory $\vecγ(t)$ homoclinic to $\vec{0}$ and crossing transversely $Ω^0$ in $\vecγ(0)$. In a previous paper we have shown…

STL-GO: Spatio-Temporal Logic with Graph Operators for Distributed Systems with Multiple Network Topologies
Yiqi Zhao, Xinyi Yu, Bardh Hoxha, Georgios Fainekos, Jyotirmoy V. Deshmukh, Lars Lindemann
https://arxiv.org/abs/2507.15147

STL-GO: Spatio-Temporal Logic with Graph Operators for Distributed Systems with Multiple Network Topologies
Multi-agent systems (MASs) consisting of a number of autonomous agents that communicate, coordinate, and jointly sense the environment to achieve complex missions can be found in a variety of applications such as robotics, smart cities, and internet-of-things applications. Modeling and monitoring MAS requirements to guarantee overall mission objectives, safety, and reliability is an important problem. Such requirements implicitly require reasoning about diverse sensing and communication modalit…

A meta-modal logic for bisimulations
Alfredo Burrieza, Fernando Soler-Toscano, Antonio Yuste-Ginel
https://arxiv.org/abs/2507.15117 https://

A meta-modal logic for bisimulations
We propose a modal study of the notion of bisimulation. Our contribution is twofold. First, we extend the basic modal language with a new modality [b], whose intended meaning is universal quantification over all states that are bisimilar to the current one. We show that bisimulations are definable in this object language. Second, we provide a sound and complete axiomatisation of the class of all pairs of Kripke models linked by bisimulations.

Counterexamples to double recurrence for non-commuting deterministic transformations
Zemer Kosloff, Shrey Sanadhya
https://arxiv.org/abs/2507.15528 https:/…

Counterexamples to double recurrence for non-commuting deterministic transformations
We show that if $p_1,p_2$ are injective, integer polynomials that vanish at the origin, such that either both are of degree $1$ or both are of degree $2$ or higher, then double recurrence fails for non-commuting, mixing, zero entropy transformations. This answers a question of Frantzikinakis and Host completely.

PSPACE-completeness of Grammar logics of bounded density
Olivier Gasquet
https://arxiv.org/abs/2507.14956 https://arxiv.org/pdf/2507.…

PSPACE-completeness of Grammar logics of bounded density
We introduce the family of multi-modal logics of bounded density and with a tableau-like approach using finite \emph{windows} which were introduced in \cite{BalGasq25}, we prove that their satisfiability problem is PSPACE-complete. As a side effect, the monomodal logic of density is shown to be in para-PSPACE.

Higher-Dimensional Moving Averages and Submanifold Genericity
Jiajun Cheng, Reynold Fregoli, Beinuo Guo
https://arxiv.org/abs/2507.15498 https://

Higher-Dimensional Moving Averages and Submanifold Genericity
We generalize results of Bellow, Jones, and Rosenblatt on moving ergodic averages to measure-preserving actions of $\mathbb Z^d$ and $\mathbb R^d$ for $d\geq 1$. In particular, we give necessary and sufficient conditions for the pointwise convergence of certain sequences of functions defined by averaging over families of boxes in $\mathbb Z^d$ and $\mathbb R^d$. As an application of our characterization, we show that averages along dilates of "locally flat" submanifolds in $\mathbb R^d$ do not …

PSPACE-completeness of bimodal transitive weak-density logic
Philippe Balbiani, Olivier Gasquet
https://arxiv.org/abs/2507.14949 https://

PSPACE-completeness of bimodal transitive weak-density logic
Windows have been introduce in \cite{BalGasq25} as a tool for designing polynomial algorithms to check satisfiability of a bimodal logic of weak-density. In this paper, after revisiting the ``folklore'' case of bimodal $\K4$ already treated in \cite{Halpern} but which is worth a fresh review, we show that windows allow to polynomially solve the satisfiability problem when adding transitivity to weak-density, by mixing algorithms for bimodal K together with windows-approach. The conclusion is th…

A Proof System with Causal Labels (Part II): checking Counterfactual Fairness
Leonardo Ceragioli, Giuseppe Primiero
https://arxiv.org/abs/2507.14655 https:…

A Proof System with Causal Labels (Part II): checking Counterfactual Fairness
In this article we propose an extension to the typed natural deduction calculus TNDPQ to model verification of counterfactual fairness in probabilistic classifiers. This is obtained formulating specific structural conditions for causal labels and checking that evaluation is robust under their variation.

Spatial Stark-Zeeman Systems and Their Regularizations
Seongchan Kim, Kevin Ruck
https://arxiv.org/abs/2507.15172 https://arxiv.org/p…

Spatial Stark-Zeeman Systems and Their Regularizations
In this article, we study spatial Stark-Zeeman systems which describe the dynamics of a charged particle moving in three-dimensional space under the influence of a Coulomb potential, a magnetic field, and an electric field, possibly time-dependent. Such systems are modeled by Hamiltonian flows on the cotangent bundle of an open subset of $\mathbb{R}^3, $ equipped with a twisted symplectic structure. The presence of the Coulomb singularity leads to the study of collision orbits, and hence unders…

A Proof System with Causal Labels (Part I): checking Individual Fairness and Intersectionality
Leonardo Ceragioli, Giuseppe Primiero
https://arxiv.org/abs/2507.14650

A Proof System with Causal Labels (Part I): checking Individual Fairness and Intersectionality
In this article we propose an extension to the typed natural deduction calculus TNDPQ to model verification of individual fairness and intersectionality in probabilistic classifiers. Their interpretation is obtained by formulating specific conditions for the application of the structural rule of Weakening. Such restrictions are given by causal labels used to check for conditional independence between protected and target variables.

ChemLog: Making MSOL Viable for Ontological Classification and Learning
Simon Fl\"ugel, Martin Glauer, Till Mossakowski, Fabian Neuhaus
https://arxiv.org/abs/2507.13987

ChemLog: Making MSOL Viable for Ontological Classification and Learning
Despite its prevalence, in many domains, OWL is not expressive enough to define ontology classes. In this paper, we present an approach that allows to use monadic second-order formalisations for ontology classification. As a case study, we have applied our approach to 14 peptide-related classes from the chemistry ontology ChEBI. For these classes, a monadic second-order logic formalisation has been developed and applied both to ChEBI as well as to 119 million molecules from the chemistry databa…

System identification of Fokker-Planck equations via transport maps
Saem Han, Krishna Garikipati
https://arxiv.org/abs/2507.15091 https://

System identification of Fokker-Planck equations via transport maps
We develop a framework that simultaneously reconstructs system dynamics and probability density functions from time-evolving data. Leveraging the Knothe-Rosenblatt rearrangements, we model the transport map from a fixed reference distribution to the target distribution, and derive the velocity fields of the dynamics from the trajectory of transport maps. We further introduce an extension to a Bayesian setting using variational inference through the evidence lower bound (ELBO) which enables unce…

Bounded Inquisitive Logics: Sequent Calculi and Schematic Validity
Tadeusz Litak, Katsuhiko Sano
https://arxiv.org/abs/2507.13946 https://

Bounded Inquisitive Logics: Sequent Calculi and Schematic Validity
Propositional inquisitive logic is the limit of its $n$-bounded approximations. In the predicate setting, however, this does not hold anymore, as discovered by Ciardelli and Grilletti, who also found complete axiomatizations of $n$-bounded inquisitive logics $\mathsf{InqBQ}_{n}$, for every fixed $n$. We introduce cut-free labelled sequent calculi for these logics. We illustrate the intricacies of \textit{schematic validity} in such systems by showing that the well-known Casari formula is \texti…

Intermittent--synchronization in non-weakly coupled piecewise linear expanding map lattice: a geometric-combinatorics method
Junke Zhang, Yiqian Wang
https://arxiv.org/abs/2507.14646

Intermittent--synchronization in non-weakly coupled piecewise linear expanding map lattice: a geometric-combinatorics method
The coupled (chaotic) map lattices (CMLs) characterizes the collective dynamics of a spatially distributed system consisting of locally or globally coupled maps. The current research on the dynamic behavior of CMLs is based on the framework of the Perron-Frobenius operator and mainly focuses on weakly-coupled cases. In this paper, a novel geometric-combinatorics method for for non weakly-coupled CMLs is provided on the dynamical behavior of a two-node CMLs with identical piecewise linear expand…

Application Placement with Constraint Relaxation
Damiano Azzolini, Marco Duca, Stefano Forti, Francesco Gallo, Antonio Ielo
https://arxiv.org/abs/2507.13895

Application Placement with Constraint Relaxation
Novel utility computing paradigms rely upon the deployment of multi-service applications to pervasive and highly distributed cloud-edge infrastructure resources. Deciding onto which computational nodes to place services in cloud-edge networks, as per their functional and non-functional constraints, can be formulated as a combinatorial optimisation problem. Most existing solutions in this space are not able to deal with \emph{unsatisfiable} problem instances, nor preferences, i.e. requirements t…

Complexity of Abduction in \L{}ukasiewicz Logic
Katsumi Inoue, Daniil Kozhemiachenko
https://arxiv.org/abs/2507.13847 https://arxiv.o…

Complexity of Abduction in Łukasiewicz Logic
We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise these contexts, we consider infinitely-valued Łukasiewicz fuzzy logic. We define and motivate the notions of abduction problems and explanations in the language of Łukasiewicz logic expanded with `interval literals' of the form $p\geq\mathbf{c}$, $p\leq\mathbf{c}$, and their negations that express the set of values a v…

A Multidimensional Birkhoff Theorem for Recurrent Lagrangian Submanifolds by a Tonelli Hamiltonian
Skander Charfi
https://arxiv.org/abs/2507.14561 https://…

A Multidimensional Birkhoff Theorem for Recurrent Lagrangian Submanifolds by a Tonelli Hamiltonian
Consider a closed manifold $M$ and a time-periodic Tonelli Hamiltonian $H : \mathbb{R}/\mathbb{Z} \times T^*M \to \mathbb{R}$ with flow $ϕ_H$. Let $\mathcal{L} \subset T^*M$ be a Lagrangian submanifold Hamiltonianly isotopic to the zero section. We prove that if $ϕ_H^n(\mathcal{L})$ admits convergent subsequences in both positive and negative times, in the Hausdorff topology and with control on the Liouville primitives, to two Lagrangian submanifolds, then $\mathcal{L}$ is a graph over the ze…

[2025-07-21 Mon (UTC), 4 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Asynchronous Composition of LTL Properties over Infinite and Finite Traces
Alberto Bombardelli, Stefano Tonetta

Learning Stochastic Hamiltonian Systems via Stochastic Generating Function Neural Network
Chen Chen, Lijin Wang, Yanzhao Cao, Xupeng Cheng
https://arxiv.org/abs/2507.14467

Learning Stochastic Hamiltonian Systems via Stochastic Generating Function Neural Network
In this paper we propose a novel neural network model for learning stochastic Hamiltonian systems (SHSs) from observational data, termed the stochastic generating function neural network (SGFNN). SGFNN preserves symplectic structure of the underlying stochastic Hamiltonian system and produces symplectic predictions. Our model utilizes the autoencoder framework to identify the randomness of the latent system by the encoder network, and detects the stochastic generating function of the system thr…

[2025-07-22 Tue (UTC), 9 new articles found for math.DS Dynamical Systems]
toXiv_bot_toot

On the Performance of Linear Adaptive Filters driven by the Ergodic Chaotic Logistic Map
Andreas Mueller
https://arxiv.org/abs/2508.15143 https://arxiv.org…

On the Performance of Linear Adaptive Filters driven by the Ergodic Chaotic Logistic Map
Chaotic dynamical systems are increasingly considered for use in coding and transmission systems. This stems from their parameter sensitivity and spectral characteristics. The latter are relevant for channel estimation methods. In particular the logistic map $f_λ=λx\left( 1-x\right) $ has been employed in chaotic coding and spread spectrum transmission systems. For $λ=4$ the statistical properties of sequences generated by $f_4$ are considered as ideal drive signals for channel estimation sc…

Trump State Visit and Netanyahu Arrives | Spitting Image Presents: The Rest is Bulls*!t Episode 2
https://www.youtube.com/watch?v=_ZWdHhTeQdQ&t=21s

Maria Ressa - Fighting Back Against Trump’s Authoritarian Algorithm With Truth | The Daily Show
https://www.youtube.com/watch?v=Tsb1I7hqaJ4