English
Related papers

Related papers: Pitts and Intuitionistic Multi-Succedent: Uniform …

200 papers

Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…

Quantum Physics · Physics 2013-01-24 E. D. Vol

In this article we present a modified S-iteration process that we combine with inertial extrapolation to find a common solution to the split monotone inclusion problem and the fixed point problem in real Hilbert space.Our goal is to…

Numerical Analysis · Mathematics 2021-10-11 Shamshad Husain , Uqba Rafat

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

Logic · Mathematics 2013-07-16 Lev Beklemishev

Software model checking is a challenging problem, and generating relevant invariants is a key factor in proving the safety properties of a program. Program invariants can be obtained by various approaches, including lightweight procedures…

Software Engineering · Computer Science 2024-10-28 Dirk Beyer , Po-Chun Chien , Nian-Ze Lee

SMT-based model checkers, especially IC3-style ones, are currently the most effective techniques for verification of infinite state systems. They infer global inductive invariants via local reasoning about a single step of the transition…

Logic in Computer Science · Computer Science 2020-05-28 Hari Govind V K , YuTing Chen , Sharon Shoham , Arie Gurfinkel

This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to moving jumps (attachments) of par units…

Logic · Mathematics 2007-05-23 Dominic Hughes

In recent years important progress has been achieved towards proving the validity of the replica predictions for the (asymptotic) mutual information (or "free energy") in Bayesian inference problems. The proof techniques that have emerged…

Information Theory · Computer Science 2018-10-30 Jean Barbier , Nicolas Macris

This paper builds and extends on the authors' previous work related to the algorithmic tool, Cylindrical Algebraic Decomposition (CAD), and one of its core applications, Real Quantifier Elimination (QE). These topics are at the heart of…

Symbolic Computation · Computer Science 2025-11-20 James H. Davenport , Matthew England , Scott McCallum , Ali K. Uncu

We describe a simple analytical method for effective summation of series, including divergent series. The method is based on self-similar approximation theory resulting in self-similar root approximants. The method is shown to be general…

Mathematical Physics · Physics 2015-06-23 S. Gluzman , V. I. Yukalov

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance, accelerate the convergence of fixpoint computations for infinite-state systems. They also help improve the…

Logic in Computer Science · Computer Science 2008-11-24 Angelo Brillout , Daniel Kroening , Thomas Wahl

In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs)…

Numerical Analysis · Mathematics 2018-11-15 R. Cavoretto , S. De Marchi , A. De Rossi , E. Perracchione , G. Santin

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

Logic · Mathematics 2020-02-20 Eugenio Orlandelli

In this contribution we give a pedagogic introduction to the newly introduced adaptive interpolation method to prove in a simple and unified way replica formulas for Bayesian optimal inference problems. Many aspects of this method can…

Disordered Systems and Neural Networks · Physics 2020-03-10 Jean Barbier , Nicolas Macris

Large Multimodal Models (LMMs) exhibit remarkable multi-tasking ability by learning mixed instruction datasets. However, novel tasks would be encountered sequentially in dynamic world, which urges for equipping LMMs with multimodal…

Computer Vision and Pattern Recognition · Computer Science 2025-08-26 Fanhu Zeng , Fei Zhu , Haiyang Guo , Xu-Yao Zhang , Cheng-Lin Liu

In-context learning (ICL) allows large language models (LLMs) to solve novel tasks without weight updates. Despite its empirical success, the mechanism behind ICL remains poorly understood, limiting our ability to interpret, improve, and…

Machine Learning · Computer Science 2025-06-16 Chengye Li , Haiyun Liu , Yuanxi Li

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

This is the second installment in a sequence of articles devoted to "explicit Chabauty-Kim theory" for the thrice punctured line. Its ultimate goal is to construct an algorithmic solution to the unit equation whose halting will be…

Algebraic Geometry · Mathematics 2015-02-10 Ishai Dan-Cohen , Stefan Wewers

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2024-08-14 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingólfsdóttir