Pietro Maugeri

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 13

Top Topics

Davis Putnam Logemann Loveland

Boolean Formula

Cartesian Product

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Domenico Cantone, Andrea De Domenico, Pietro Maugeri
The Decision Problem for Undirected Graphs with Reachability and Acyclicity. CiE (2024)
Domenico Cantone, Alfio Giarlotta, Pietro Maugeri, Stephen Watson
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence. ICTCS (2023)
Domenico Cantone, Pietro Maugeri
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator. ICTCS (2023)
Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. Theor. Comput. Sci. 954 (2023)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework. GandALF (2021)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case. Fundam. Informaticae 181 (1) (2021)
Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. ICTCS (2021)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo
Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae. CoRR (2021)
Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership. Theor. Comput. Sci. 848 (2020)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF. CILC (2020)
Domenico Cantone, Pietro Maugeri
Polynomial-Time Satisfiability Tests for 'Small' Membership Theories. ICTCS (2019)
Domenico Cantone, Pietro Maugeri, Stefano Scafiti
A Potential-Based Variant of the Bellman-Ford Algorithm. ICTCS (2019)
Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. CILC (2019)