A general approach to asymptotic elimination of aggregation functions and generalized quantifiers

04/16/2023
by   Vera Koponen, et al.
0

We consider a logic with truth values in the unit interval and which uses aggregation functions instead of quantifiers, and we describe a general approach to asymptotic elimination of aggregation functions and, indirectly, of asymptotic elimination of Mostowski style generalized quantifiers, since such can be expressed by using aggregation functions. The notion of “local continuity” of an aggregation function, which we make precise in two (related) ways, plays a central role in this approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2021

Asymptotic elimination of partially continuous aggregation functions in directed graphical models

In Statistical Relational Artificial Intelligence, a branch of AI and ma...
research
09/04/2019

Efficient elimination of Skolem functions in first-order logic without equality

We prove that elimination of a single Skolem function in pure logic incr...
research
04/20/2022

On the relative asymptotic expressivity of inference frameworks

Let σ be a first-order signature and let 𝐖_n be the set of all σ-structu...
research
07/22/2019

Aggregating Probabilistic Judgments

In this paper we explore the application of methods for classical judgme...
research
01/28/2019

Neural eliminators and classifiers

Classification may not be reliable for several reasons: noise in the dat...
research
04/18/2013

Feature Elimination in Kernel Machines in moderately high dimensions

We develop an approach for feature elimination in statistical learning w...
research
10/09/2018

Description of sup- and inf-preserving aggregation functions via families of clusters in data tables

Connection between the theory of aggregation functions and formal concep...

Please sign up or login with your details

Forgot password? Click here to reset