Tootfinder

How do we get meaning into a knowledge graph? For this, we need explicit formal semantics based on ontologies. Otherwise, we could only make use of structural or statistical properties of the graph. In lecture 06, we started with the #knowledgegraphs chapter of #ise2024, which will cover the e…

How do we get meaning into a knowledge graph? For this, we need explicit formal semantics based on ontologies. Otherwise, we could only make use of structural or statistical properties of the graph. In lecture 06, we started with the #knowledgegraphs chapter of #ise2024, which will cover the e…

"California Forever" billionaires are only going to build a new suburb if Caltrans builds a new highway to it
Converting farmland to housing only makes financial sense when the massive expense of highways is subsidized by the state
https://www.sfchroni…

‘Ultimatums don’t work with Ukraine’ — Zelenskyy’s chief of staff responds to Putin’s peace proposal – POLITICO
https://www.politico.eu/article/andriy-yermak-ukraine-war-russia-ultimatum-volodymyr-zelensky/

‘Ultimatums don’t work with Ukraine’ — Zelenskyy’s chief of staff responds to Putin’s peace proposal
Kyiv plans to work on a joint proposal with allies on how to bring Zelenskyy’s peace formula to life.

Formally Certified Approximate Model Counting
Yong Kiam Tan, Jiong Yang, Mate Soos, Magnus O. Myreen, Kuldeep S. Meel
https://arxiv.org/abs/2406.11414 http…

Formally Certified Approximate Model Counting
Approximate model counting is the task of approximating the number of solutions to an input Boolean formula. The state-of-the-art approximate model counter for formulas in conjunctive normal form (CNF), ApproxMC, provides a scalable means of obtaining model counts with probably approximately correct (PAC)-style guarantees. Nevertheless, the validity of ApproxMC's approximation relies on a careful theoretical analysis of its randomized algorithm and the correctness of its highly optimized implem…

"Nichts auf der Welt ist so mächtig wie eine Idee, deren Zeit gekommen ist." (Victor Hugo, 1802–1885, frz. Schriftsteller)
[via https://ub.hsu-hh.de/go/moinmoin]

All-electron $BSE@GW$ method with Numeric Atom-Centered Orbitals for Extended Systems
Ruiyi Zhou, Yi Yao, Volker Blum, Xinguo Ren, Yosuke Kanai
https://arxiv.org/abs/2406.11122 https://arxiv.org/pdf/2406.11122
arXiv:2406.11122v1 Announce Type: new
Abstract: Green's function theory has emerged as a powerful many-body approach not only in condensed matter physics but also in quantum chemistry in recent years. We have developed a new all-electron implementation of the BSE@GW formalism using numeric atom-centered orbital basis sets (Liu et al., J. Chem. Phys. 152, 044105 (2020)). We present our recent developments in implementing this formalism for extended systems with periodic boundary conditions. We discuss its numerical implementation and various convergence tests pertaining to numerical atom-centered orbitals, auxiliary basis sets for the resolution-of-identity formalism, and Brillouin zone sampling. Proof-of-principle examples are presented to compare with other formalisms, illustrating the new all-electron BSE@GW method for extended systems.

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

Effective formulas for the geometry of normal homogeneous spaces. Application to flag manifolds
Consider a smooth manifold and an action on it of a compact connected Lie group with a bi-invariant metric. Then, any orbit is an embedded submanifold that is isometric to a normal homogeneous space for the group. In this paper, we establish new explicit and intrinsic formulas for the geometry of any such orbit. We derive our formula of the Levi-Civita connection from an existing generic formula for normal homogeneous spaces, i.e. which determines, a priori only theoretically, the connection. W…

"Verteidige dein Recht zu denken. Denken und sich zu irren ist besser, als nicht zu denken." (Hypatia, auch Hypatia von Alexandria, 355–416, spätantike Mathematikerin, Astronomin und Philosophin)
[via https://ub.hsu-hh.de/go/moinmoin]

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

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family of cosafety languages (Ln)_{n>=1} such that Ln can be expressed with a pure future formula of size O(n), but it requires formulae of size 2^Ω(n) to be captured with past formulae. As a by-product, such a succinctness result shows the optimality of the pastification algorithm prop…