English
Related papers

Related papers: Interestingness a Unifying Paradigm Bipolar Functi…

200 papers

Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those…

Logic in Computer Science · Computer Science 2008-11-07 Andreas Blass , Yuri Gurevich

This is the English translation of my old paper 'Definici\'on y estudio de una funci\'on indefinidamente diferenciable de soporte compacto', Rev. Real Acad. Ciencias 76 (1982) 21-38. In it a function (essentially Fabius function) is defined…

Classical Analysis and ODEs · Mathematics 2017-02-20 Juan Arias de Reyna

A new family of $n$-dimensional solutions of the Jacobi identities is characterized. Such a family is very general, thus unifying in a common framework many different well-known Poisson systems seemingly unrelated. This unification is not…

Mathematical Physics · Physics 2019-10-24 Benito Hernández-Bermejo , V. Fairén

Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose…

Logic in Computer Science · Computer Science 2020-01-31 Óscar Martín , Alberto Verdejo , Narciso Martí-Oliet

Calibration is a classical notion from the forecasting literature which aims to address the question: how should predicted probabilities be interpreted? In a world where we only get to observe (discrete) outcomes, how should we evaluate a…

Machine Learning · Computer Science 2025-09-03 Parikshit Gopalan , Lunjia Hu

A major challenge of interdisciplinary description of complex system behaviour is whether real systems of higher complexity levels can be understood with at least the same degree of objective, "scientific" rigour and universality as…

General Physics · Physics 2014-05-27 Andrei P. Kirilyuk

In this paper we consider the axiomatic characterization of information and certainty measures in a unified way. We present the general axiomatic system which captures the common properties of a large number of the measures previously…

Information Theory · Computer Science 2015-06-17 Velimir M. Ilic , Miomir S. Stankovic

The reasoning with qualitative uncertainty measures involves comparative statements about events in terms of their likeliness without necessarily assigning an exact numerical value to these events. The paper is divided into two parts. In…

Logic · Mathematics 2024-03-18 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko , Ondrej Majer

Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…

Logic · Mathematics 2026-04-21 Øystein Linnebo

Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance being classified as positive are the prime-implicants of the…

Artificial Intelligence · Computer Science 2021-05-14 Niku Gorji , Sasha Rubin

Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…

Logic in Computer Science · Computer Science 2010-12-20 Dov Gabbay , David Pearce , Agustí n Valverde

Positivity, the assumption that every unique combination of confounding variables that occurs in a population has a non-zero probability of an action, can be further delineated as deterministic positivity and stochastic positivity. Here, we…

Methodology · Statistics 2022-07-12 Paul N Zivich , Stephen R Cole , Daniel Westreich

Compositional generalization is the ability of a model to generalize to complex, previously unseen types of combinations of entities from just having seen the primitives. This type of generalization is particularly relevant to the semantic…

Computation and Language · Computer Science 2024-04-23 Amogh Mannekote

An extension to classical unification, called {\em graded unification} is presented. It is capable of combining contradictory information. An interactive processing paradigm and parser based on this new operator are also presented.

cmp-lg · Computer Science 2008-02-03 Albert Kim

The notion of programming paradigms, with associated programming languages and methodologies, is a well established tenet of Computer Science pedagogy, enshrined in international curricula. However, this notion sits ill with Kuhn's classic…

Programming Languages · Computer Science 2020-02-17 Greg Michaelson

Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems. Although modern models are trained on massive datasets, they still cover only a tiny fraction of the…

Computer Vision and Pattern Recognition · Computer Science 2026-03-02 Arnas Uselis , Andrea Dittadi , Seong Joon Oh

The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way. We propose an automaton-based paradigm for…

Logic in Computer Science · Computer Science 2023-02-03 Tobias Kappé , Farhad Arbab , Carolyn Talcott

Common knowledge and only knowing capture two intuitive and natural notions that have proven to be useful in a variety of settings, for example to reason about coordination or agreement between agents, or to analyse the knowledge of…

Logic in Computer Science · Computer Science 2023-06-07 Marcos Cramer , Samuele Pollaci , Bart Bogaerts

The unique and beautiful character of certain mathematical results and proofs is often considered one of the most gratifying aspects of engaging with mathematics. We study whether this perception of mathematical arguments having an…

History and Overview · Mathematics 2017-11-23 Samuel G. B. Johnson , Stefan Steinerberger

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

Logic in Computer Science · Computer Science 2018-09-11 Jakub Michaliszyn