English
Related papers

Related papers: A Note on the Expressiveness of BIP

200 papers

Simplicity is held by many to be the key to general intelligence. Simpler models tend to "generalise", identifying the cause or generator of data with greater sample efficiency. The implications of the correlation between simplicity and…

Artificial Intelligence · Computer Science 2024-07-19 Michael Timothy Bennett

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…

Artificial Intelligence · Computer Science 2018-02-06 Mikkel Birkegaard Andersen , Thomas Bolander , Hans van Ditmarsch , Martin Holm Jensen

Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework,…

Artificial Intelligence · Computer Science 2009-05-26 Carmel Domshlak , Francesca Rossi , Kristen Brent Venable , Toby Walsh

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

Logic · Mathematics 2026-01-21 Ivo Düntsch , Rafał Gruszczyński , Paula Menchón

In this paper, we explore the limiting weak-type behaviors of some integral operators including maximal operators, singular and fractional integral operators and maximal truncated singular integrals et al. Some optimal limiting weak-type…

Classical Analysis and ODEs · Mathematics 2017-10-31 Weichao Guo , Jianxun He , Huoxiong Wu

CLIP (Contrastive Language-Image Pretraining) has become a popular choice for various downstream tasks. However, recent studies have questioned its ability to represent compositional concepts effectively. These works suggest that CLIP often…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Darina Koishigarina , Arnas Uselis , Seong Joon Oh

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…

Formal Languages and Automata Theory · Computer Science 2022-05-03 Joel D. Day , Vijay Ganesh , Nathan Grewal , Florin Manea

L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…

Combinatorics · Mathematics 2023-07-13 Attila Joó

To resolve conflicts among norms, various nonmonotonic formalisms can be used to perform prioritized normative reasoning. Meanwhile, formal argumentation provides a way to represent nonmonotonic logics. In this paper, we propose a…

Artificial Intelligence · Computer Science 2018-03-06 Beishui Liao , Nir Oren , Leendert van der Torre , Serena Villata

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Jan Broekaert , Liane Gabora , Sandro Sozzo

We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to enforce them. Unlike other more commonly accepted…

Databases · Computer Science 2010-09-14 L. Caroprese , M. Truszczynski

All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to…

Logic in Computer Science · Computer Science 2015-07-01 Harald Zankl , Martin Korp

We formulate general rules for a coarse-graining of the dynamics, which we term `symbolic dynamics', of feedback networks with monotone interactions, such as most biological modules. Networks which are more complex than simple cyclic…

Quantitative Methods · Quantitative Biology 2009-03-04 Simone Pigolotti , Sandeep Krishna , Mogens H. Jensen

Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…

Group Theory · Mathematics 2021-03-31 Dan Segal

I propose here a new concept of information based on two relevant aspects of its expression. The first related to the undeniable fact that the expression of information modifies the physical state of its receiver. The second to the…

Populations and Evolution · Quantitative Biology 2007-05-23 Antonio Leon

The Information Bottleneck (IB) framework is a general characterization of optimal representations obtained using a principled approach for balancing accuracy and complexity. Here we present a new framework, the Dual Information Bottleneck…

Information Theory · Computer Science 2020-06-09 Zoe Piran , Ravid Shwartz-Ziv , Naftali Tishby

Post hoc explanation methods, such as LIME and SHAP, provide interpretable insights into black-box classifiers and are increasingly used to assess model biases and generalizability. However, these methods are vulnerable to adversarial…

Machine Learning · Computer Science 2025-08-18 Sam Chauhan , Estelle Duguet , Karthik Ramakrishnan , Hugh Van Deventer , Jack Kruger , Ranjan Subbaraman

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

Logic in Computer Science · Computer Science 2017-03-08 Katsuhiko Sano , John G. Stell

Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of…

Combinatorics · Mathematics 2007-05-23 Jobst Heitzig

We define variational properties for dynamical systems with subexponential complexity, and study these properties in certain specific examples. By computing the value of slow entropy directly, we show that some subshifts are not…

Dynamical Systems · Mathematics 2024-10-22 Minhua Cheng , Carlos Ospina , Kurt Vinhage , Yibo Zhai