Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’languages involving membership D Cantone, P Maugeri, EG Omodeo Theoretical Computer Science 848, 28-46, 2020 | 10 | 2020 |
Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case D Cantone, A De Domenico, P Maugeri, EG Omodeo Fundamenta Informaticae 181 (1), 37-69, 2021 | 9 | 2021 |
Polynomial-time satisfiability tests for boolean fragments of set theory D Cantone, A De Domenico, P Maugeri, E Omodeo CEUR WORKSHOP PROCEEDINGS 2396, 123-137, 2019 | 6 | 2019 |
A quadratic reduction of constraints over nested sets to purely Boolean formulae in CNF D Cantone, A De Domenico, P Maugeri, E Omodeo CEUR WORKSHOP PROCEEDINGS 2710, 214-230, 2020 | 4 | 2020 |
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. D Cantone, P Maugeri, E Omodeo CEUR WORKSHOP PROCEEDINGS 3072, 164-178, 2021 | 2 | 2021 |
Extending rational choice behavior: The decision problem for Boolean set theory with a choice correspondence D Cantone, A Giarlotta, P Maugeri, S Watson arXiv preprint arXiv:1708.06121, 2017 | 2 | 2017 |
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages D Cantone, P Maugeri, EG Omodeo Theoretical Computer Science 954, 113786, 2023 | 1 | 2023 |
On the convexity of a fragment of pure set theory with applications within a nelson-oppen framework D Cantone, A De Domenico, P Maugeri arXiv preprint arXiv:2109.08309, 2021 | 1 | 2021 |
Polynomial-Time Satisfiability Tests for'Small'Membership Theories. D Cantone, P Maugeri ICTCS, 261-273, 2019 | 1 | 2019 |
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence D Cantone, A Giarlotta, P Maugeri, S Watson | | 2023 |
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator D Cantone, P Maugeri | | 2023 |
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae D Cantone, A De Domenico, P Maugeri, EG Omodeo arXiv preprint arXiv:2112.04797, 2021 | | 2021 |
A Potential-Based Variant of the Bellman-Ford Algorithm. D Cantone, P Maugeri, S Scafiti ICTCS, 122-135, 2019 | | 2019 |
A complete complexity taxonomy of ‘small’fragments of theory Multi-Level Syllogistic P Maugeri, D Cantone, AI Tomescu | | |