default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Faella
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Marco Faella, Luigi Sauro:
On preferences and reward policies over rankings. Auton. Agents Multi Agent Syst. 38(2): 29 (2024)- [j16]Marco Faella, Giulio Garbi, Salvatore La Torre, Gennaro Parlato
:
CHC-Based Verification of Programs Through Graph Decompositions. SN Comput. Sci. 5(8): 1062 (2024) - [c50]Marco Faella, Gennaro Parlato:
A Unified Automata-Theoretic Approach to LTLf Modulo Theories. ECAI 2024: 1254-1261 - [c49]Massimo Benerecetti, Marco Faella, Fabio Mogavero:
Model Checking Linear Temporal Properties on Polyhedral Systems. TIME 2024: 19:1-19:23 - [i9]Marco Faella, Gennaro Parlato:
A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version). CoRR abs/2408.08817 (2024) - [i8]Marco Faella, Gennaro Parlato:
Automated Verification of Tree-Manipulating Programs Using Constrained Horn Clauses. CoRR abs/2410.09668 (2024) - 2023
- [c48]Marco Faella, Gennaro Parlato:
Reachability Games Modulo Theories with a Bounded Safety Player. AAAI 2023: 6330-6337 - 2022
- [c47]Marco Faella, Gennaro Parlato:
Reasoning About Data Trees Using CHCs. CAV (2) 2022: 249-271 - [c46]Marco Faella, Luigi Sauro:
Universal Thompson Sampling. ICMLA 2022: 1109-1114 - 2021
- [j15]Marco Faella, Luigi Sauro:
Irrelevant matches in round-robin tournaments. Auton. Agents Multi Agent Syst. 35(1): 5 (2021) - [c45]Marco Faella, Alberto Finzi, Luigi Sauro:
A practical query selection framework for real-time Bayesian preference elicitation. ICTAI 2021: 248-255 - 2020
- [c44]Marco Faella, Luigi Sauro:
Preferences over Rankings and How to Control Them Using Rewards. ECAI 2020: 59-66 - [c43]Marco Faella, Alberto Finzi, Luigi Sauro:
Rapidly Finding the Best Arm Using Variance. ECAI 2020: 2585-2591 - [i7]Massimo Benerecetti, Daniele Dell'Erba, Marco Faella, Fabio Mogavero:
From Quasi-Dominions to Progress Measures. CoRR abs/2008.04232 (2020)
2010 – 2019
- 2019
- [c42]Marco Faella, Luigi Sauro:
Preference Theories on Weak Orders. OVERLAY@AI*IA 2019: 53-58 - 2018
- [c41]Marco Faella, Luigi Sauro:
Do all Tournaments Admit Irrelevant Matches? AAMAS 2018: 982-989 - 2017
- [j14]Massimo Benerecetti, Marco Faella:
Tracking smooth trajectories in linear hybrid systems. Inf. Comput. 257: 114-138 (2017) - [j13]Massimo Benerecetti, Marco Faella:
Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control. ACM Trans. Embed. Comput. Syst. 16(4): 104:1-104:27 (2017) - [c40]Piero A. Bonatti, Marco Faella, Iliana M. Petrova, Luigi Sauro:
A New Semantics for Overriding in Description Logics (Extended Abstract). IJCAI 2017: 4975-4979 - 2016
- [c39]Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro:
Generalized Agent-mediated Procurement Auctions. AAMAS 2016: 77-85 - [c38]Marco Faella:
Average Controllability Measures for Solitaire Games. AAMAS 2016: 223-231 - [c37]Rajeev Alur, Marco Faella, Sampath Kannan, Nimit Singhania:
Hedging Bets in Markov Decision Processes. CSL 2016: 29:1-29:20 - [i6]Luca de Alfaro, Marco Faella:
TrueReview: A Platform for Post-Publication Peer Review. CoRR abs/1608.07878 (2016) - [i5]Luca de Alfaro, Marco Faella, Vassilis Polychronopoulos, Michael Shavlovsky:
Incentives for Truthful Evaluations. CoRR abs/1608.07886 (2016) - 2015
- [j12]Piero A. Bonatti, Marco Faella, Iliana M. Petrova, Luigi Sauro:
A new semantics for overriding in description logics. Artif. Intell. 222: 1-48 (2015) - [c36]Piero A. Bonatti, Marco Faella, Carsten Lutz, Luigi Sauro, Frank Wolter:
Decidability of Circumscribed Description Logics Revisited. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 112-124 - 2014
- [j11]Marco Faella, Salvatore La Torre, Aniello Murano:
Automata-theoretic decision of timed games. Theor. Comput. Sci. 515: 46-63 (2014) - [j10]Marco Faella, Aniello Murano:
Preface to the special issue on GandALF 2012. Theor. Comput. Sci. 560: 217-218 (2014) - [c35]Marco Anisetti, Claudio A. Ardagna, Piero A. Bonatti, Ernesto Damiani, Marco Faella, Clemente Galdi, Luigi Sauro:
E-Auctions for Multi-Cloud Service Provisioning. IEEE SCC 2014: 35-42 - [c34]Piero A. Bonatti, Marco Faella, Luigi Sauro:
Partial Preferences for Mediated Bargaining. SR 2014: 105-111 - [i4]Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs. CoRR abs/1401.3901 (2014) - 2013
- [j9]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar, Vishwanath Raman:
Code aware resource management. Formal Methods Syst. Des. 42(2): 146-174 (2013) - [j8]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Automatic synthesis of switching controllers for linear hybrid systems: Safety control. Theor. Comput. Sci. 493: 116-138 (2013) - [c33]Massimo Benerecetti, Marco Faella:
Tracking differentiable trajectories across polyhedra boundaries. HSCC 2013: 193-202 - [c32]Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro:
Auctions for Partial Heterogeneous Preferences. MFCS 2013: 183-194 - [c31]Piero A. Bonatti, Luigi Sauro, Marco Faella, Clemente Galdi:
An Integrated Formal Approach to Usage Control. IEEE Symposium on Security and Privacy Workshops 2013: 8-12 - 2012
- [j7]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Quantitatively fair scheduling. Theor. Comput. Sci. 413(1): 160-175 (2012) - [c30]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Reachability games for linear hybrid systems. HSCC 2012: 65-74 - [e1]Marco Faella, Aniello Murano:
Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2012, Napoli, Italy, September 6-8, 2012. EPTCS 96, 2012 [contents] - 2011
- [j6]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Exploring the boundary of half-positionality. Ann. Math. Artif. Intell. 62(1-2): 55-77 (2011) - [j5]Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs. J. Artif. Intell. Res. 42: 719-764 (2011) - [c29]Piero A. Bonatti, Marco Faella, Luigi Sauro:
Adding Default Attributes to EL++. AAAI 2011: 171-176 - [c28]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Revisiting synthesis of switching controllers for Linear Hybrid systems. CDC/ECC 2011: 4753-4758 - [c27]Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro:
Towards a Mechanism for Incentivating Privacy. ESORICS 2011: 472-488 - [c26]Piero A. Bonatti, Marco Faella, Luigi Sauro:
On the Complexity of EL with Defeasible Inclusions. IJCAI 2011: 762-767 - [c25]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Towards Efficient Exact Synthesis for Linear Hybrid Systems. GandALF 2011: 263-277 - [i3]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Automatic Synthesis of Switching Controllers for Linear Hybrid Automata. CoRR abs/1103.4584 (2011) - 2010
- [j4]Marco Faella, Margherita Napoli, Mimmo Parente:
Graded Alternating-Time Temporal Logic. Fundam. Informaticae 105(1-2): 189-210 (2010) - [c24]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Exploring the Boundary of Half Positionality. CLIMA 2010: 171-185 - [c23]Marco Faella, Margherita Napoli, Mimmo Parente:
Graded Alternating-Time Temporal Logic. LPAR (Dakar) 2010: 192-211 - [c22]Piero A. Bonatti, Marco Faella, Luigi Sauro:
EL\mathcal{EL} with Default Attributes and Overriding. ISWC (1) 2010: 64-79 - [c21]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Quantitative Fairness Games. QAPL 2010: 48-63
2000 – 2009
- 2009
- [j3]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay:
Qualitative Logics and Equivalences for Probabilistic Systems. Log. Methods Comput. Sci. 5(2) (2009) - [j2]Luca de Alfaro, Marco Faella, Mariëlle Stoelinga:
Linear and Branching System Metrics. IEEE Trans. Software Eng. 35(2): 258-273 (2009) - [c20]Piero A. Bonatti, Marco Faella, Luigi Sauro:
Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes. IJCAI 2009: 696-701 - [c19]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Balanced Paths in Colored Graphs. MFCS 2009: 149-161 - [c18]Marco Faella:
Admissible Strategies in Infinite Games over Graphs. MFCS 2009: 307-318 - [i2]Axel Legay, Marco Faella:
Some Models and Tools for Open Systems. CoRR abs/0911.3299 (2009) - 2008
- [c17]B. Thomas Adler, Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Ian Pye, Vishwanath Raman:
Assigning trust to Wikipedia content. Int. Sym. Wikis 2008 - [c16]Marco Faella, Axel Legay, Mariëlle Stoelinga:
Model Checking Quantitative Linear Time Logic. QAPL 2008: 61-77 - [i1]Marco Faella:
Best-Effort Strategies for Losing States. CoRR abs/0811.1664 (2008) - 2007
- [c15]Luca de Alfaro, Marco Faella:
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games. CAV 2007: 108-120 - [c14]Sabrina Baselice, Piero A. Bonatti, Marco Faella:
On Interoperable Trust Negotiation Strategies. POLICY 2007: 39-50 - [c13]Luca de Alfaro, Krishnendu Chatterjee, Marco Faella, Axel Legay:
Qualitative Logics and Equivalences for Probabilistic Systems. QEST 2007: 237-248 - 2006
- [c12]B. Thomas Adler, Luca de Alfaro, Leandro Dias da Silva, Marco Faella, Axel Legay, Vishwanath Raman, Pritam Roy:
Ticc: A Tool for Interface Compatibility and Composition. CAV 2006: 59-62 - [c11]Axel Legay, Luca de Alfaro, Marco Faella:
An Introduction to the Tool Ticc. Trustworthy Software 2006 - [c10]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga:
Compositional Quantitative Reasoning. QEST 2006: 179-188 - 2005
- [j1]Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga:
Model checking discounted temporal properties. Theor. Comput. Sci. 345(1): 139-170 (2005) - [c9]Luca de Alfaro, Vishwanath Raman, Marco Faella, Rupak Majumdar:
Code aware resource management. EMSOFT 2005: 191-202 - [c8]B. Thomas Adler, Luca de Alfaro, Marco Faella:
Average Reward Timed Games. FORMATS 2005: 65-80 - [c7]Luca de Alfaro, Leandro Dias da Silva, Marco Faella, Axel Legay, Pritam Roy, Maria Sorea:
Sociable Interfaces. FroCoS 2005: 81-105 - 2004
- [c6]Luca de Alfaro, Marco Faella, Mariëlle Stoelinga:
Linear and Branching Metrics for Quantitative Transition Systems. ICALP 2004: 97-109 - [c5]Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga:
Model Checking Discounted Temporal Properties. TACAS 2004: 77-92 - 2003
- [c4]Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga:
The Element of Surprise in Timed Games. CONCUR 2003: 142-156 - [c3]Luca de Alfaro, Marco Faella:
Information Flow in Concurrent Games. ICALP 2003: 1038-1053 - 2002
- [c2]Marco Faella, Salvatore La Torre, Aniello Murano:
Dense Real-Time Games. LICS 2002: 167-176 - [c1]Marco Faella, Salvatore La Torre, Aniello Murano:
Automata-Theoretic Decision of Timed Games. VMCAI 2002: 94-108
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 2025-02-04 22:02 CET 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:
