output
19952026
most citedFirst measurement of neutrino oscillation parameters using neutrinos and antineutrinos by NOvA

319 citations

247 papers

cs.LO2026

Paraclassical Logics with Two Negations

Pawel Pawlowski, Pietro Vigiani

We study three paraclassical propositional logics with two negations, CLoaN, CLouN, and CLauN, obtained by pairwise combining the one-negation systems CLuN, CLaN, and CLoN. CLuN's…

cs.LO2026

Formalization of Fragments of the Theory of Hereditarily Finite Sets

Zuzana Haniková, Štěpán Holub

The axiomatization of the theory of hereditarily finite sets in first-order classical logic is systematically explored and formalized in Isabelle/HOL. The formalization uses a hier…

cs.NE2026

Artificial Neural Networks as Surrogate Models in Black Box Optimization

Md Khadimul Islam Zim, Martin Holeňa

Black-Box Optimization (BBO) is often applied in several engineering fields and can utilize an advancement of numerical measure- ments and simulation technologies. It deals with th…

cs.AI2026

Explainability Assistant: A Conversational XAI Interface for Interpreting Energy Consumption Models

Rodion Krjutškov, Eduard Barbu, Nikos Sakkas +1

Energy consumption forecasting relies on increasingly complex machine learning (ML) models, such as Genetic Programming-based symbolic regressors, whose predictions can be difficul…

cs.LO2026

Non-classical Topological Evidence Logic

Igor Sedlár

Topological Evidence Logic (TEL) is a recent approach to epistemic logic that uses topological tools to model coherent epistemic justification. Specifically, a hypothesis is cohere…

cs.LO2026

Pointed Modal Abelian Logic, Algebraically

Filip Jankovec, Wolfgang Poiger

In this article, we investigate the pointed modal logic of reals. We first establish its relational (Kripke) semantics with bounded valuations in the Abelian l-group of real number…

cs.LO2026

Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus

Han Gao, Nicola Olivetti

Intuitionistic modal logics (IMLs) comprise many systems: from constructive modal logics such as CK and Wijesekera's CCDL to Fischer Servi/Simpson's IK, as well as some recently in…

stat.ME2026

Sequential generalized kernel equating: Providing comparable scores across multiple test forms with nonequivalent groups and differently measured covariates

Michaela Vařejková, Patrícia Martinková, Eva Potužníková

Test equating using covariates may be applied to provide comparable scores from multiple test forms when no anchor items are available. However, its performance may be compromised…

cs.LO2026

Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic

Daniil Kozhemiachenko, Igor Sedlár

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expres…

cs.CV2025

SiLVi: Simple Interface for Labeling Video Interactions

Ozan Kanbertay, Richard Vogg, Elif Karakoc +3

Computer vision methods are increasingly used for the automated analysis of large volumes of video data collected through camera traps, drones, or direct observations of animals in…

hep-ex2025★ 23 cited

Joint neutrino oscillation analysis from the T2K and NOvA experiments

NOvA, T2K Collaborations, : +597

The landmark discovery that neutrinos have mass and can change type (or "flavor") as they propagate -- a process called neutrino oscillation -- has opened up a rich array of theore…

math.LO2025

Tableaux for epistemic Gödel logic

Marta Bílková, Thomas Ferguson, Daniil Kozhemiachenko

We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with interpreted as "entirely plausible f…

cond-mat.dis-nn2025★ 1 cited

Double descent: When do neural quantum states generalize?

M. Schuyler Moss, Alev Orfi, Christopher Roth +5

Neural quantum states (NQS) provide flexible and compact wavefunction parameterizations for numerical studies of quantum many-body physics. In particular, NQS aim to circumvent the…

cs.CL2025

Exploratory Study into Relations between Cognitive Distortions and Emotional Appraisals

Navneet Agarwal, Kairit Sirts

In recent years, there has been growing interest in studying cognitive distortions and emotional appraisals from both computational and psychological perspectives. Despite consider…

cs.LG2025

Utilizing Novelty-based Evolution Strategies to Train Transformers in Reinforcement Learning

Matyáš Lorenc, Roman Neruda

In this paper, we experiment with novelty-based variants of OpenAI-ES, the NS-ES and NSR-ES algorithms, and evaluate their effectiveness in training complex, transformer-based arch…

math.CO2024

On cospectral graphons

Jan Hladký, Daniel Iľkovič, Jared León +1

In this short note, we introduce cospectral graphons, paralleling the notion of cospectral graphs. As in the graph case, we give three equivalent definitions: by equality of spectr…

math.CO2024

A tower lower bound for the degree relaxation of the Regularity Lemma

Frederik Garbe, Jan Hladký

It is well-known that if is an -regular pair (in the sense of Szemerédi) then there exist sets and with $|A'|\leq \vare…

cs.FL2024

Large Language Models and the Extended Church-Turing Thesis

Jiří Wiedermann, Jan van Leeuwen

The Extended Church-Turing Thesis (ECTT) posits that all effective information processing, including unbounded and non-uniform interactive computations, can be described in terms o…

math.LO2024

Superabelian logics

Petr Cintula, Filip Jankovec, Carles Noguera

This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and r…

stat.ML2024★ 5 cited

Higher order definition of causality by optimally conditioned transfer entropy

Jakub Kořenek, Pavel Sanda, Jaroslav Hlinka

The description of the dynamics of complex systems, in particular the capture of the interaction structure and causal relationships between elements of the system, is one of the ce…

math.LO2024

Indiscernibles in monadically NIP theories

Samuel Braunfeld, Michael C. Laskowski

We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previou…

cs.LO2024

Scalable Knowledge Refactoring using Constrained Optimisation

Minghao Liu, David M. Cerna, Filipe Gouveia +1

Knowledge refactoring compresses a logic program by introducing new rules. Current approaches struggle to scale to large programs. To overcome this limitation, we introduce a const…

cs.LO2024★ 1 cited

Completeness of Finitely Weighted Kleene Algebra With Tests

Igor Sedlár

Building on Ésik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebr…

cs.CR2024★ 1 cited

Identification of Device Dependencies Using Link Prediction

Lukáš Sadlek, Martin Husák, Pavel Čeleda

Devices in computer networks cannot work without essential network services provided by a limited count of devices. Identification of device dependencies determines whether a pair…