default search action
Alessandro Facchini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Andrea Ferrario
, Alessandro Facchini
Experts or Authorities? The Strange Case of the Presumed Epistemic Superiority of Artificial Intelligence Systems. Minds Mach. 34(3): 30 (2024) - [c26]Elisa Rubegni, Omran Ayoub, Stefania Maria Rita Rizzo, Marco Barbero, Guenda Bernegger, Francesca D. Faraci, Francesca Mangili, Emiliano Soldini, Pierpaolo Trimboli, Alessandro Facchini:
Designing for Complementarity: A Conceptual Framework to Go Beyond the Current Paradigm of Using XAI in Healthcare. HCI (51) 2024: 277-296 - [i15]Andrea Ferrario, Alberto Termine, Alessandro Facchini:
Addressing Social Misattributions of Large Language Models: An HCXAI-based Approach. CoRR abs/2403.17873 (2024) - [i14]Elisa Rubegni, Omran Ayoub, Stefania Maria Rita Rizzo, Marco Barbero, Guenda Bernegger, Francesca D. Faraci, Francesca Mangili, Emiliano Soldini, Pierpaolo Trimboli, Alessandro Facchini:
Designing for Complementarity: A Conceptual Framework to Go Beyond the Current Paradigm of Using XAI in Healthcare. CoRR abs/2404.04638 (2024) - [i13]Alberto Termine, Emanuele Ratti, Alessandro Facchini:
Machine Learning and Theory Ladenness - A Phenomenological Account. CoRR abs/2409.11277 (2024) - 2023
- [j11]Alberto Termine
Imprecise Probabilistic Model Checking for Stochastic Multi-agent Systems. SN Comput. Sci. 4(5): 443 (2023) - [c25]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Closure operators, classifiers and desirability. ISIPTA 2023: 25-36 - [c24]Alberto Termine, Alessandro Antonucci, Alessandro Facchini:
Machine Learning Explanations by Surrogate Causal Models (MaLESCaMo). xAI (Late-breaking Work, Demos, Doctoral Consortium) 2023: 59-64 - 2022
- [j10]Facundo Carreiro, Alessandro Facchini
Model theory of monadic predicate logic with the infinity quantifier. Arch. Math. Log. 61(3-4): 465-502 (2022) - [j9]Alessio Benavoli, Alessandro Facchini
Quantum indistinguishability through exchangeability. Int. J. Approx. Reason. 151: 389-412 (2022) - [c23]Lilith Mattei, Alessandro Antonucci, Alessandro Facchini:
Dalal's Revision in Sentential Decision Diagrams. ISAIM 2022 - [i12]Lilith Mattei, Alessandro Facchini, Alessandro Antonucci:
Belief Revision in Sentential Decision Diagrams. CoRR abs/2201.08112 (2022) - 2021
- [c22]Alberto Termine, Alessandro Antonucci, Giuseppe Primiero, Alessandro Facchini:
Logic and Model Checking by Imprecise Probabilistic Interpreted Systems. EUMAS 2021: 211-227 - [c21]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Indistinguishability through Exchangeable Desirable Gambles. ISIPTA 2021: 22-31 - [c20]Alberto Termine, Alessandro Antonucci, Alessandro Facchini, Giuseppe Primiero:
Robust Model Checking with Imprecise Markov Reward Models. ISIPTA 2021: 299-309 - [i11]Alberto Termine, Alessandro Antonucci, Alessandro Facchini, Giuseppe Primiero:
Robust Model Checking with Imprecise Markov Reward Models. CoRR abs/2103.04841 (2021) - [i10]Alessandro Antonucci, Alessandro Facchini, Lilith Mattei:
Structural Learning of Probabilistic Sentential Decision Diagrams under Partial Closed-World Assumption. CoRR abs/2107.12130 (2021) - 2020
- [j8]Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá
Tractable inference in credal sentential decision diagrams. Int. J. Approx. Reason. 125: 26-48 (2020) - [j7]Facundo Carreiro, Alessandro Facchini
The Power of the Weak. ACM Trans. Comput. Log. 21(2): 15:1-15:47 (2020) - [c19]Linda C. van der Gaag, Silja Renooij, Alessandro Facchini:
Building Causal Interaction Models by Recursive Unfolding. PGM 2020: 509-520 - [i9]Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá, Alessandro Facchini, Julissa Villanueva Llerena:
Tractable Inference in Credal Sentential Decision Diagrams. CoRR abs/2008.08524 (2020)
2010 – 2019
- 2019
- [j6]Alessio Benavoli
Sum-of-squares for bounded rationality. Int. J. Approx. Reason. 105: 130-152 (2019) - [c18]Alessandro Antonucci, Alessandro Facchini, Lilith Mattei:
Credal Sentential Decision Diagrams. ISIPTA 2019: 14-22 - [c17]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Bernstein's Socks, Polynomial-Time Provable Coherence and Entanglement. ISIPTA 2019: 23-31 - [i8]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics (Extended version). CoRR abs/1902.03513 (2019) - [i7]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Computational Complexity and the Nature of Quantum Mechanics. CoRR abs/1902.04569 (2019) - 2018
- [c16]Alessandro Antonucci, Alessandro Facchini:
Set-Valued Probabilistic Sentential Decision Diagrams. PLP@ILP 2018: 3-8 - [c15]Alessandro Antonucci, Alessandro Facchini
A Credal Extension of Independent Choice Logic. SUM 2018: 35-49 - [i6]Alessandro Antonucci, Alessandro Facchini:
A Credal Extension of Independent Choice Logic. CoRR abs/1806.08298 (2018) - [i5]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Model Theory of Monadic Predicate Logic with the Infinity Quantifier. CoRR abs/1809.03262 (2018) - [i4]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
The Power of the Weak. CoRR abs/1809.03896 (2018) - 2017
- [c14]Alessio Benavoli, Alessandro Facchini, Dario Piga, Marco Zaffalon:
SOS for Bounded Rationality. ISIPTA 2017: 25-36 - [c13]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon, José Vicente-Pérez:
A Polarity Theory for Sets of Desirable Gambles. ISIPTA 2017: 37-48 - 2016
- [j5]Alessandro Facchini
Emergence of Shared Behaviour in Distributed Scheduling Systems for Domestic Appliances. SIGMETRICS Perform. Evaluation Rev. 44(2): 70-75 (2016) - [j4]Alessandro Facchini
Index Problems for Game Automata. ACM Trans. Comput. Log. 17(4): 24 (2016) - [c12]Alessio Benavoli, Alessandro Facchini, Marco Zaffalon:
Quantum Rational Preferences and Desirability. IDM@NIPS 2016: 87-96 - 2015
- [j3]Alessandro Facchini
Containment for Conditional Tree Patterns. Log. Methods Comput. Sci. 11(2) (2015) - [c11]Alessandro Facchini
On the Weak Index Problem for Game Automata. WoLLIC 2015: 93-108 - [i3]Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
Index problems for game automata. CoRR abs/1506.02153 (2015) - 2014
- [c10]Alessandro Facchini
Deciding the Borel Complexity of Regular Tree Languages. CiE 2014: 163-172 - [c9]Facundo Carreiro, Alessandro Facchini
Weak MSO: automata and expressiveness modulo bisimilarity. CSL-LICS 2014: 27:1-27:27 - [i2]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Weak MSO: Automata and Expressiveness Modulo Bisimilarity. CoRR abs/1401.4374 (2014) - [i1]Alessandro Facchini, Henryk Michalewski:
Deciding the Borel complexity of regular tree languages. CoRR abs/1403.3502 (2014) - 2013
- [c8]Alessandro Facchini
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus. LICS 2013: 478-487 - [c7]Alessandro Facchini
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. LICS 2013: 499-508 - 2011
- [c6]Jacques Duparc, Alessandro Facchini
Definable Operations On Weakly Recognizable Sets of Trees. FSTTCS 2011: 363-374 - [c5]Balder ten Cate, Alessandro Facchini
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. MFCS 2011: 290-302
2000 – 2009
- 2009
- [j2]Luca Alberucci, Alessandro Facchini
The modal µ-calculus hierarchy over restricted classes of transition systems. J. Symb. Log. 74(4): 1367-1400 (2009) - [j1]Luca Alberucci, Alessandro Facchini
On Modal µ -Calculus and Gödel-Löb Logic. Stud Logica 91(2): 145-169 (2009) - [c4]Jacques Duparc, Alessandro Facchini
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. CSL 2009: 225-239 - [c3]Jérémie Cabessa
The Wadge Hierarchy of Max-Regular Languages. FSTTCS 2009: 121-132 - 2008
- [c2]Jacques Duparc, Alessandro Facchini
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I). CiE 2008: 186-195 - 2007
- [c1]Jacques Duparc, Alessandro Facchini
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. ILC 2007: 46-55
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: