English
Related papers

Related papers: The Thins Ordering on Relations

200 papers

In recent years, there has been a surge in effort to formalize notions of fairness in machine learning. We focus on centroid clustering--one of the fundamental tasks in unsupervised machine learning. We propose a new axiom ``proportionally…

Machine Learning · Computer Science 2024-11-05 Haris Aziz , Barton E. Lee , Sean Morota Chu , Jeremy Vollen

The report suggests the concept of risk, outlining two mathematical structures necessary for risk genesis: the set of outcomes and, in a general case, partial order of preference on it. It is shown that this minimum partial order should…

Artificial Intelligence · Computer Science 2020-04-14 Tatiana Urazaeva

In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…

Formal Languages and Automata Theory · Computer Science 2024-07-19 Maciej Koutny , Lukasz Mikulski

Preordering is a generalization of clustering and partial ordering with applications in bioinformatics and social network analysis. Given a finite set $V$ and a value $c_{ab} \in \mathbb{R}$ for every ordered pair $ab$ of elements of $V$,…

Discrete Mathematics · Computer Science 2026-05-14 David Stein , Jannik Irmai , Bjoern Andres

This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…

Logic in Computer Science · Computer Science 2014-09-01 Ernst-Erich Doberkat

This article defines a partial order structure to study the relationship between levels and contents of conscious subjective experience in a single mathematical set-up. We understand phenomenal structure as extrapolated relationships among…

Neurons and Cognition · Quantitative Biology 2025-02-05 J. Díaz-Boils , N. Tsuchiya , CM. Signorelli

The purpose of this paper is to outline a simple set of axioms for basic set theory from which most fundamental facts can be derived. The key to the whole project is a new axiom of set theory which I dubbed "The Law of Extremes". It allows…

Logic · Mathematics 2013-05-16 Jerzy Dydak

We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…

Formal Languages and Automata Theory · Computer Science 2015-10-13 Igor Potapov , Olena Prianychnykova , Sergey Verlan

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

Logic · Mathematics 2022-04-07 Erik Walsberg

We define a countable antichain condition (ccc) property for partial orderings, weaker than precalibre-$\aleph_1$, and show that Martin's axiom restricted to the class of partial orderings that have the property does not imply Martin's…

Logic · Mathematics 2015-02-20 Joan Bagaria , Saharon Shelah

We study a family of distance functions on rankings that allow for asymmetric treatments of alternatives and consider the distinct relevance of the top and bottom positions for ordered lists. We provide a full axiomatic characterization of…

Computer Science and Game Theory · Computer Science 2024-03-28 Andrea Aveni , Ludovico Crippa , Giulio Principi

The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…

Complex Variables · Mathematics 2019-12-03 Bulat N. Khabibullin

This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic.…

Logic · Mathematics 2019-09-18 Sean C. Ebels-Duggan

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

Discrete Mathematics · Computer Science 2013-06-03 Jens Gerlach

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…

Operator Algebras · Mathematics 2009-06-10 Vern Paulsen , Mark Tomforde

We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…

Artificial Intelligence · Computer Science 2011-12-05 Weiwei Cheng , Eyke Hüllermeier

Rankings have become the primary interface in two-sided online markets. Many have noted that the rankings not only affect the satisfaction of the users (e.g., customers, listeners, employers, travelers), but that the position in the ranking…

Information Retrieval · Computer Science 2022-08-31 Yuta Saito , Thorsten Joachims

The ability to generate multiple plans is central to using planning in real-life applications. Top-quality planners generate sets of such top-cost plans, allowing flexibility in determining equivalent ones. In terms of the order between…

Artificial Intelligence · Computer Science 2024-04-03 Michael Katz , Junkyu Lee , Jungkoo Kang , Shirin Sohrabi

The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…

Optimization and Control · Mathematics 2024-01-17 V. V. Gorokhovik
‹ Prev 1 3 4 5 6 7 10 Next ›