default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Papacchini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Ullrich Hustadt
, Fabio Papacchini, Cláudia Nalon, Clare Dixon:
Model Construction for Modal Clauses. IJCAR (2) 2024: 3-23- 2023
- [c17]Cláudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon:
Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic. CADE 2023: 382-400 - 2022
- [j5]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 639-666 (2022) - [j4]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Correction to: Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 1099 (2022) - [c16]Cláudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon:
Local Reductions for the Modal Cube. IJCAR 2022: 486-505 - [e1]Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini, Mehrnoosh Askarpour, Louise A. Dennis:
Proceedings of the Second Workshop on Agents and Robots for reliable Engineered Autonomy, AREA@IJCAI-ECAI 2022, Vienna, Austria, 24th July 2022. EPTCS 362, 2022 [contents] - 2021
- [j3]Angelo Ferrando, Rafael C. Cardoso, Marie Farrell, Matt Luckcuck, Fabio Papacchini, Michael Fisher, Viviana Mascardi:
Bridging the gap between single- and multi-model predictive runtime verification. Formal Methods Syst. Des. 59(1): 44-76 (2021) - [j2]Michael Fisher, Rafael C. Cardoso, Emily C. Collins, Christopher Dadswell, Louise A. Dennis, Clare Dixon, Marie Farrell, Angelo Ferrando, Xiaowei Huang, Mike Jump, Georgios Kourtis, Alexei Lisitsa, Matt Luckcuck, Shan Luo, Vincent Pagé, Fabio Papacchini, Matt Webster:
An Overview of Verification and Validation Challenges for Inspection Robots. Robotics 10(2): 67 (2021) - [c15]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Efficient Local Reductions to Basic Modal Logic. CADE 2021: 76-92 - [c14]Angelo Ferrando, Fabio Papacchini:
StreamB: A Declarative Language for Automatically Processing Data Streams in Abstract Environments for Agent Platforms. EMAS@AAMAS 2021: 114-136 - [c13]Sven Linker, Fabio Papacchini, Michele Sevegnani:
Finite Models for a Spatial Logic with Discrete and Topological Path Operators. MFCS 2021: 72:1-72:16 - [c12]Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini:
Automated Planning and BDI Agents: A Case Study. PAAMS 2021: 52-63 - [i6]Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini, Matt Luckcuck, Sven Linker, Terry R. Payne:
MLFC: From 10 to 50 Planners in the Multi-Agent Programming Contest. CoRR abs/2110.08172 (2021) - 2020
- [j1]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. ACM Trans. Comput. Log. 21(3): 20:1-20:47 (2020) - [c11]Sven Linker, Fabio Papacchini, Michele Sevegnani:
Analysing Spatial Properties on Neighbourhood Spaces. MFCS 2020: 66:1-66:14 - [i5]Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini:
LFC: Combining Autonomous Agents and Automated Planning in the Multi-Agent Programming Contest. CoRR abs/2006.02736 (2020) - [i4]Sven Linker, Fabio Papacchini, Michele Sevegnani:
Analysing Spatial Properties on Neighbourhood Spaces. CoRR abs/2007.01266 (2020)
2010 – 2019
- 2019
- [c10]Jean Christoph Jung, Fabio Papacchini, Frank Wolter, Michael Zakharyaschev:
Model Comparison Games for Horn Description Logics: A Summary. Description Logics 2019 - [c9]Jean Christoph Jung, Fabio Papacchini, Frank Wolter, Michael Zakharyaschev:
Model Comparison Games for Horn Description Logics. LICS 2019: 1-14 - [c8]Xingyu Zhao, Matthew Osborne, Jenny Lantair, Valentin Robu, David Flynn, Xiaowei Huang, Michael Fisher, Fabio Papacchini, Angelo Ferrando:
Towards Integrating Formal Verification of Autonomous Robots with Battery Prognostics and Health Management. SEFM 2019: 105-124 - [p1]Rafael C. Cardoso, Angelo Ferrando, Fabio Papacchini:
LFC: Combining Autonomous Agents and Automated Planning in the Multi-Agent Programming Contest. The Multi-Agent Programming Contest 2019: 31-58 - [i3]Jean Christoph Jung, Fabio Papacchini, Frank Wolter, Michael Zakharyaschev:
Model Comparison Games for Horn Description Logics. CoRR abs/1904.06919 (2019) - [i2]Xingyu Zhao, Matthew Osborne, Jenny Lantair, Valentin Robu, David Flynn, Xiaowei Huang, Michael Fisher, Fabio Papacchini, Angelo Ferrando:
Towards Integrating Formal Verification of Autonomous Robots with Battery Prognostics and Health Management. CoRR abs/1909.03019 (2019) - 2018
- [c7]Fabio Papacchini, Frank Wolter:
A Van Benthem Theorem for Horn Description and Modal Logic. Description Logics 2018 - [c6]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying. IJCAI 2018: 1861-1867 - [i1]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. CoRR abs/1804.06894 (2018) - 2017
- [c5]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Horn Rewritability vs PTime Query Answering for Description Logic TBoxes. Description Logics 2017 - [c4]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. PODS 2017: 185-199 - 2015
- [b1]Fabio Papacchini:
Minimal model reasoning for modal logic. University of Manchester, UK, 2015 - 2014
- [c3]Fabio Papacchini, Renate A. Schmidt:
Terminating Minimal Model Generation Procedures for Propositional Modal Logics. IJCAR 2014: 381-395 - 2013
- [c2]Fabio Papacchini, Renate A. Schmidt:
Computing Minimal Models Modulo Subset-Simulation for Modal Logics. FroCos 2013: 279-294 - 2011
- [c1]Fabio Papacchini, Renate A. Schmidt:
A Tableau Calculus for Minimal Modal Model Generation. M4M/LAMAS 2011: 159-172
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-07 21:26 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:
