Publications related to Field of sets

Orthologic with Axioms

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polyno ...

Association for Computing Machinery2024

An Ink–and–Paper Automaton: The Conceptual Mechanization of Cognition and the Practical Automation of Reasoning in Leibniz’s De Affectibus (1679)

Simon François Dumas Primbault

On ten loose handwritten folios dating back from April 1679, Leibniz gradually devised, in the course of three days, a full-blown theory of thought that nonetheless remained unpublished and still has received little attention from scholars. Conceiving of a ...

2020

Forbidden induced subposets of given height

Istvan Tomon

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Design of Load-Bearing Systems for Open-Ended Downstream Reuse

Corentin Jean Dominique Fivet

This paper discusses the design of load-bearing systems for buildings with regard to their current lack of open-ended reusability. The reason for dismantling load-bearing systems today tends to be less related to material degradation than to a loss of func ...

2019

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Andres Jacinto Ruiz Vargas

We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...

ELSEVIER SCIENCE BV2019

Counting Intersecting and Pairs of Cross-Intersecting Families

Andrei Kupavskii

A family of subsets of {1, ... , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdos, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1, ... , n}. In this ...

Cambridge Univ Press2018

An improvement on the number of simplices in F-q(d)

Van Thang Pham

Let epsilon be a set of points in F-q(d). Bennett et al. (2016) proved that if \epsilon\ >> [GRAHICS] then epsilon determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when epsilon is the Car ...

Elsevier Science Bv2017

A Novel Basis for Logic Rewriting

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Winston Jason Haaswijk

Given a set of logic primitives and a Boolean function, exact synthesis finds the optimum representation (e.g., depth or size) of the function in terms of the primitives. Due to its high computational complexity, the use of exact synthesis is limite ...

Ieee2017

Unsplittable Coverings in the Plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Springer-Verlag Berlin2016

Unsplittable coverings in the plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Academic Press Inc Elsevier Science2016

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Maria Walczak

Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...

Cambridge Univ Press2016

Comment on "Room Temperature Electrically Injected Polariton Laser"

Benoît Marie Joseph Deveaud

In this Comment I challenge the main conclusions of Ref. [1]. The main reason for this Comment is the large number of questions on the details of the experiment that led me to request the raw data. I have obtained two sets of raw data. After a long discuss ...

American Physical Society2016

Limit states of modern unreinforced clay brick masonry walls subjected to in-plane loading

Katrin Beyer, Sarah Petry

Recent research showed that the in-plane horizontal displacement capacity of unreinforced masonry (URM) walls depends on numerous factors that are not yet captured by current empirical drift capacity models; e.g., axial stress, shear span, geometry of the ...

Springer Verlag2015

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Effects of hardware heterogeneity on the performance of SVM Alzheimer's disease classifier

Bénédicte Marie Maréchal, Ahmed Abdulkadir, Gunnar Krüger

Fully automated machine learning methods based on structural magnetic resonance imaging data can assist radiologists in the diagnosis of Alzheimer's disease (AD). These algorithms require large data sets to learn the separation of subjects with and without ...

Elsevier2011

Collections, Cardinalities, and Relations

Viktor Kuncak, Ruzica Piskac

Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to co ...

2010

Tangencies between families of disjoint regions in the plane

János Pach

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...

2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

METHOD FOR SEGMENTATION OF AN MRI IMAGE OF A TISSUE IN PRESENCE OF PARTIAL VOLUME EFFECTS AND COMPUTER PROGRAM IMPLEMENTING THE METHOD

Bénédicte Marie Maréchal

A method and computer program for segmentation of an MRI image of tissue in presence of partial volume effects, include storing the MRI image in K-space representation as raw dataset, reconstructing N images, each represented by N sets of voxels and N sets ...

2008

Un nouveau cadre constitutif couplé pour la modélisation avancée des sols non saturés

Mathieu Nuth

Most natural and engineered soils usually exhibit a state of partial saturation in water. Indeed, fast and heavy water flowing into the soil is known to cause collapse or soil plasticization which may be at the origin of harmful settlements. The mechanical ...

2008