Tootfinder

Bericht: VW Grand California jahrelang mit erhöhten Schadstoffwerten
Ausdünstungen von unter anderem Styrol und Formaldehyd über den Grenzwerten hatte VW selbst gefunden – aber die Kunden offenbar nicht informiert.
…

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
Rolf Drechsler
https://arxiv.org/abs/2505.23311 https://

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
Verification is one of the central tasks in circuit and system design. While simulation and emulation are widely used, complete correctness can only be ensured based on formal proof techniques. But these approaches often have very high run time and memory requirements. Recently, Polynomial Formal Verification (PFV) has been introduced showing that for many instances of practical relevance upper bounds on needed resources can be given. But proofs have to be provided that are human-readable. He…

Hierarchical formula classes with respect to semi-classical prenex normalization
Makoto Fujiwara, Taishi Kurahashi
https://arxiv.org/abs/2506.22348 https:/…

Hierarchical formula classes with respect to semi-classical prenex normalization
In [10], the authors formalized the standard transformation procedure for prenex normalization of first-order formulas and showed that the classes $\mathrm{E}_k$ and $\mathrm{U}_k$ introduced in Akama et al. [1] are exactly the classes induced by $Σ_k$ and $Π_k$ respectively via the transformation procedure. In that sense, the classes $\mathrm{E}_k$ and $\mathrm{U}_k$ correspond to $Σ_k$ and $Π_k$ based on classical logic respectively. On the other hand, some transformations of the prenex n…

Revisiting Coincident GR in Internal STEGR Formulation
Kyosuke Tomonari, Taishi Katsuragawa, Shin'ichi Nojiri
https://arxiv.org/abs/2506.22158 https://…

Revisiting Coincident GR in Internal STEGR Formulation
We revisit Coincident General Relativity (CGR) in the gauge approach to gravity based on Symmetric Teleparallel Equivalent to General Relativity (STEGR) in the {\it internal-space formulation}, which one of the authors recently proposed in Ref.~[J. Math. Phys. 66 (2025) 5, 052505]. First, we review the standard formulation of STEGR theories in the Palatini approach to gravity, in which formulation we impose the teleparallel and torsion-free conditions by using Lagrange multipliers. Second, we i…

Ein zentrales Versprechen demokratisch-kapitalistischer Systeme ist die (formale) Möglichkeit für einzelne Personen, ihrer Stimme Gehör zu verschaffen und bei der Gestaltung der Gesellschaft mitzusprechen. Dabei stellt sich von vornherein die Frage, inwieweit dieses Versprechen überhaupt einlösbar ist, faktisch wird es auf jeden Fall nicht realisiert.
"Individuen sind in spätmodernen Gesellschaften in diesem Sinne einem Dilemma ausgesetzt, das sich nur schwer eigenhändig auflösen …

Kapitalismus verspricht Selbstwirksamkeit, begrenzt sie aber - Weltenkreuzer
Ein zentrales Versprechen demokratisch-kapitalistischer Systeme ist die (formale) Möglichkeit für einzelne Personen, ihrer Stimme Gehör zu verschaffen und bei der Gestaltung der Gesellschaft mitzusprechen. Dabei stellt sich von vornherein die Frage, inwieweit dieses Versprechen überhaupt einlösbar ist, faktisch wird es auf jeden Fall nicht realisiert. Individuen sind in spätmodernen Gesellschaften in diesem Sinne einem Dilemma ausgesetzt, das sich nur schwer eigenhändig auflösen lä…

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…

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
Nevena Mari\'c
https://arxiv.org/abs/2506.21787 https://

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
The cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors in the complete graph $K_n$, is a central object in combinatorial optimization, with applications ranging from max-cut problems to correlation analysis. Building on a probabilistic interpretation via agreement probabilities among symmetric Bernoulli random variables, we derive an explicit closed-form formula for enumerating the vertices of the related polytope $1$-$\operatorname{CUT}(n)$. Our approach is based o…

Fans kontern prompt - Schach-Weltmeister zieht Formel 1 ins Lächerliche #News #Nachrichten

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. …

Fans kontern prompt - Schach-Weltmeister zieht Formel 1 ins Lächerliche #News #Nachrichten