Alessandro Facchini

Orcid: 0000-0001-7507-116X

According to our database1, Alessandro Facchini authored at least 41 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Addressing Social Misattributions of Large Language Models: An HCXAI-based Approach.
CoRR, 2024

2023
Imprecise Probabilistic Model Checking for Stochastic Multi-agent Systems.
SN Comput. Sci., September, 2023

Machine Learning Explanations by Surrogate Causal Models (MaLESCaMo).
Proceedings of the Joint Proceedings of the xAI-2023 Late-breaking Work, 2023

Closure operators, classifiers and desirability.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2023

2022
Quantum indistinguishability through exchangeability.
Int. J. Approx. Reason., 2022

Belief Revision in Sentential Decision Diagrams.
CoRR, 2022

Model theory of monadic predicate logic with the infinity quantifier.
Arch. Math. Log., 2022

Dalal's Revision in Sentential Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021
Structural Learning of Probabilistic Sentential Decision Diagrams under Partial Closed-World Assumption.
CoRR, 2021

Robust Model Checking with Imprecise Markov Reward Models.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2021

Quantum Indistinguishability through Exchangeable Desirable Gambles.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2021

Logic and Model Checking by Imprecise Probabilistic Interpreted Systems.
Proceedings of the Multi-Agent Systems - 18th European Conference, 2021

2020
The Power of the Weak.
ACM Trans. Comput. Log., 2020

Tractable inference in credal sentential decision diagrams.
Int. J. Approx. Reason., 2020

Building Causal Interaction Models by Recursive Unfolding.
Proceedings of the International Conference on Probabilistic Graphical Models, 2020

2019
Sum-of-squares for bounded rationality.
Int. J. Approx. Reason., 2019

Computational Complexity and the Nature of Quantum Mechanics.
CoRR, 2019

Computational Complexity and the Nature of Quantum Mechanics (Extended version).
CoRR, 2019

Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

Credal Sentential Decision Diagrams.
Proceedings of the International Symposium on Imprecise Probabilities: Theories and Applications, 2019

2018
A Credal Extension of Independent Choice Logic.
Proceedings of the Scalable Uncertainty Management - 12th International Conference, 2018

Set-Valued Probabilistic Sentential Decision Diagrams.
Proceedings of the 5th International Workshop on Probabilistic Logic Programming, 2018

2017
A Polarity Theory for Sets of Desirable Gambles.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

SOS for Bounded Rationality.
Proceedings of the Tenth International Symposium on Imprecise Probability: Theories and Applications, 2017

2016
Index Problems for Game Automata.
ACM Trans. Comput. Log., 2016

Emergence of Shared Behaviour in Distributed Scheduling Systems for Domestic Appliances.
SIGMETRICS Perform. Evaluation Rev., 2016

Quantum Rational Preferences and Desirability.
Proceedings of the NIPS 2016 Workshop on Imperfect Decision Makers: Admitting Real-World Rationality, 2016

2015
Containment for Conditional Tree Patterns.
Log. Methods Comput. Sci., 2015

On the Weak Index Problem for Game Automata.
Proceedings of the Logic, Language, Information, and Computation, 2015

2014
Weak MSO: automata and expressiveness modulo bisimilarity.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Deciding the Borel Complexity of Regular Tree Languages.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2011
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Definable Operations On Weakly Recognizable Sets of Trees.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2009
On Modal <i>µ</i> -Calculus and Gödel-Löb Logic.
Stud Logica, 2009

The modal µ-calculus hierarchy over restricted classes of transition systems.
J. Symb. Log., 2009

The Wadge Hierarchy of Max-Regular Languages.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I).
Proceedings of the Logic and Theory of Algorithms, 2008

2007
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007


  Loading...