Logics for sizes with union or intersection

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper presents the most basic logics for reasoning about the sizes of sets that admit either the union of terms or the intersection of terms. That is, our logics handle assertions All x y and AtLeast x y, where x and y are built up from basic terms by either unions or intersections. We present a sound, complete, and polynomial-time decidable proof system for these logics. An immediate consequence of our work is the completeness of the logic additionally permitting More x y. The logics considered here may be viewed as efficient fragments of two logics which appear in the literature: Boolean Algebra with Presburger Arithmetic and the Logic of Comparative Cardinality.

Cite

CITATION STYLE

APA

Kisby, C., Blanco, S. A., Kruckman, A., & Moss, L. S. (2020). Logics for sizes with union or intersection. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 2870–2876). AAAI press. https://doi.org/10.1609/aaai.v34i03.5677

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free