Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae

Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo

Type: Preprint

Publication Date: 2021-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2112.04797

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae	2021	Domenico Cantone Andrea De Domenico Pietro Maugeri Eugenio G. Omodeo
+	Conjunctive Query Answering via a Fragment of Set Theory (Extended Version).	2016	Domenico Cantone Marianna Nicolosi Asmundo Daniele Francesco Santamaria
+	Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate	2014	Domenico Cantone Pietro Ursino
+	Web ontology representation and reasoning via fragments of set theory	2015	Domenico Cantone Cristiano Longo Marianna Nicolosi Asmundo Daniele Francesco Santamaria
+	Web ontology representation and reasoning via fragments of set theory	2015	Domenico Cantone Cristiano Longo Marianna Nicolosi Asmundo Daniele Francesco Santamaria
+	Conjunctive Query Answering via a Fragment of Set Theory (Extended Version)	2016	Domenico Cantone Marianna Nicolosi Asmundo Daniele Francesco Santamaria
+	Quantitative reasoning, complexity, and additive structures	1993	Patrick W Thompson
+	Automated Reasoning with Restricted Intensional Sets.	2019	Maximiliano Cristiá Gianfranco Rossi
+ PDF Chat	ASP(AC): Answer Set Programming with Algebraic Constraints	2020	Thomas Eiter Rafael Kiesel
+	ASP(AC): Answer Set Programming with Algebraic Constraints	2020	Thomas Eiter Rafael Kiesel
+	Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints	2018	Chong Gao Taolue Chen Zhilin Wu
+	Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator	2021	Domenico Cantone Pietro Ursino
+ PDF Chat	On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework	2021	Domenico Cantone Andrea De Domenico Pietro Maugeri
+ PDF Chat	ASP (): Answer Set Programming with Algebraic Constraints	2020	Thomas Eiter Rafael Kiesel
+	Fuzzification of set inclusion: Theory and applications	1993	Divyendu Sinha Edward R. Dougherty
+	A tetrachotomy of ontology-mediated queries with a covering axiom	2022	Olga Gerasimova Stanislav Kikot Agi Kurucz Vladimir V. Podolskii Michael Zakharyaschev
+ PDF Chat	The satisfiability problem for a quantitative fragment of PCTL	2023	Miroslav Chodil Antonı́n Kučera
+ PDF Chat	The Satisfiability Problem for a Quantitative Fragment of PCTL	2021	Miroslav Chodil Antonı́n Kučera
+ PDF Chat	Beyond NP: Quantifying over Answer Sets	2019	Giovanni Amendola Francesco Ricca Mirosław Truszczyński
+ PDF Chat	Tractable Set Constraints	2012	Manuel Bodirsky Martin Hils

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors