Alessio Mansutti

Orcid: 0000-0002-1104-7299

Affiliations:
  • IMDEA Software Institute, Spain


According to our database1, Alessio Mansutti authored at least 31 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories.
CoRR, 2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version).
CoRR, 2024

Integer Programming with GCD Constraints.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Integer Linear-Exponential Programming in NP by Quantifier Elimination.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
On Composing Finite Forests with Modal Logics.
ACM Trans. Comput. Log., April, 2023

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Complexity of Presburger Arithmetic with Power or Powers.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
An auxiliary logic on trees: On the tower-hardness of logics featuring reachability and submodel reasoning.
Inf. Comput., 2022

Higher-Order Quantified Boolean Satisfiability.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Geometric decision procedures and the VC dimension of linear arithmetic theories.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

Quantifier elimination for counting extensions of Presburger arithmetic.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic.
ACM Trans. Comput. Log., 2021

Internal proof calculi for modal logics with separating conjunction.
J. Log. Comput., 2021

A Complete Axiomatisation for Quantifier-Free Separation Logic.
Log. Methods Comput. Sci., 2021

Notes on kAExp(pol) problems for deterministic machines.
CoRR, 2021

Presburger arithmetic with threshold counting quantifiers is easy.
CoRR, 2021

On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Logiques de séparation : complexité, expressivité, calculs. (Reasoning with separation logics : complexity, expressive power, proof systems).
PhD thesis, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material).
CoRR, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

A Framework for Reasoning about Dynamic Axioms in Description Logics.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Internal Calculi for Separation Logics.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Axiomatising Logics with Separating Conjunction and Modalities.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018
Deciding Hedged Bisimilarity.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Extending Propositional Separation Logic for Robustness Properties.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

The Effects of Adding Reachability Predicates in Propositional Separation Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Loose Graph Simulations.
Proceedings of the Software Technologies: Applications and Foundations, 2017

2014
Distributed execution of bigraphical reactive systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems.
Proceedings of the Distributed Applications and Interoperable Systems, 2014


  Loading...