Pietro Maugeri

According to our database, Pietro Maugeri authored at least 12 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages.

Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo

Theor. Comput. Sci., 2023

Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator.

Domenico Cantone, Pietro Maugeri

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence.

Domenico Cantone, Alfio Giarlotta, Pietro Maugeri, Stephen Watson

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2021

Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case.

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

Fundam. Informaticae, 2021

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

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

CoRR, 2021

On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework.

Domenico Cantone, Andrea De Domenico, Pietro Maugeri

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages.

Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020

Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership.

Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo

Theor. Comput. Sci., 2020

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF.

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

Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019

A Potential-Based Variant of the Bellman-Ford Algorithm.

Domenico Cantone, Pietro Maugeri, Stefano Scafiti

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for 'Small' Membership Theories.

Domenico Cantone, Pietro Maugeri

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory.

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

Proceedings of the 34th Italian Conference on Computational Logic, 2019