Strong Conditional Logic. - Cláudia Nalon; Jacques Wainer (SBIA, 1998)

Theorem Proving for Temporal Logics of Knowledge or Belief. - Cláudia Nalon (ARW, 2000)

Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect Recall or No Learning. - Clare Dixon; Cláudia Nalon; Michael Fisher 001 (TIME, 2003)

Resolution for Synchrony and No Learning. - Cláudia Nalon; Clare Dixon; Michael Fisher 001 (Advances in Modal Logic, 2004)

Tableaux for Logics of Time and Knowledge with Interactions Relating to Synchrony. - Clare Dixon; Cláudia Nalon; Michael Fisher 001 (J. Appl. Non Class. Logics, 2004)

Resolution for synchrony and no learning. - Cláudia Nalon (2004)

Anti-prenexing and Prenexing for Modal Logics. - Cláudia Nalon; Clare Dixon (JELIA, 2006)

Clausal resolution for normal modal logics. - Cláudia Nalon; Clare Dixon (J. Algorithms, 2007)

Towards Resolution-based Reasoning for Connected Logics. - Cláudia Nalon; Oliver Kutz (LSFA, 2013)

Clausal Resolution for Modal Logics of Confluence. - Cláudia Nalon; João Marcos 001; Clare Dixon (IJCAR, 2014)

A Resolution Prover for Coalition Logic. - Cláudia Nalon; Lan Zhang 001; Clare Dixon; Ullrich Hustadt (SR, 2014)

A Calculus for Automatic Verification of Petri Nets Based on Resolution and Dynamic Logics. - Cláudia Nalon; Bruno Lopes 001; Gilles Dowek; Edward Hermann Haeusler (LSFA, 2014)

A resolution-based calculus for Coalition Logic. - Cláudia Nalon; Lan Zhang 001; Clare Dixon; Ullrich Hustadt (J. Log. Comput., 2014)

Ordered Resolution for Coalition Logic. - Ullrich Hustadt; Paul Gainer; Clare Dixon; Cláudia Nalon; Lan Zhang 001 (TABLEAUX, 2015)

A Modal-Layered Resolution Calculus for K. - Cláudia Nalon; Ullrich Hustadt; Clare Dixon (TABLEAUX, 2015)

: A Resolution-Based Prover for Multimodal K. - Cláudia Nalon; Ullrich Hustadt; Clare Dixon (IJCAR, 2016)

KSP: A Resolution-based Prover for Multimodal K, Abridged Report. - Cláudia Nalon; Ullrich Hustadt; Clare Dixon (IJCAI, 2017)

Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics. - Ullrich Hustadt; Cláudia Nalon; Clare Dixon (PAAR@FLoC, 2018)

A Resolution-Based Calculus for Preferential Logics. - Cláudia Nalon; Dirk Pattinson (IJCAR, 2018)

Brasilia Spring on Automated Reasoning. - Cláudia Nalon; Daniele Nantes Sobrinho; Elaine Pimentel; João Marcos 001 (ACM SIGLOG News, 2018)

Modal Resolution: Proofs, Layers, and Refinements. - Cláudia Nalon; Clare Dixon; Ullrich Hustadt (ACM Trans. Comput. Log., 2019)

Preface. - Cláudia Nalon; Giselle Reis (LSFA, 2020)

SAT and Interactions (Dagstuhl Seminar 20061). - Olaf Beyersdorff; Uwe Egly; Meena Mahajan; Cláudia Nalon (Dagstuhl Reports, 2020)

sf Kn : Architecture, Refinements, Strategies and Experiments. - Cláudia Nalon; Ullrich Hustadt; Clare Dixon (J. Autom. Reason., 2020)

Efficient Local Reductions to Basic Modal Logic. - Fabio Papacchini; Cláudia Nalon; Ullrich Hustadt; Clare Dixon (CADE, 2021)

Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic. - Bruno Lopes 001; Cláudia Nalon; Edward Hermann Haeusler (ACM Trans. Comput. Log., 2021)

Local Reductions for the Modal Cube. - Cláudia Nalon; Ullrich Hustadt; Fabio Papacchini; Clare Dixon (IJCAR, 2022)

A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals. - Bernardo Alkmim; Edward Hermann Haeusler; Cláudia Nalon (Description Logics, 2022)

Local is Best: Efficient Reductions to Modal Logic K. - Fabio Papacchini; Cláudia Nalon; Ullrich Hustadt; Clare Dixon (J. Autom. Reason., 2022)

Correction to: Local is Best: Efficient Reductions to Modal Logic K. - Fabio Papacchini; Cláudia Nalon; Ullrich Hustadt; Clare Dixon (J. Autom. Reason., 2022)

Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic. - Cláudia Nalon; Ullrich Hustadt; Fabio Papacchini; Clare Dixon (CADE, 2023)

Resolution Calculi for Non-normal Modal Logics. - Dirk Pattinson; Nicola Olivetti; Cláudia Nalon (TABLEAUX, 2023)

The Next Generation of Deduction Systems: From Composition to Compositionality (Dagstuhl Seminar 23471). - Maria Paola Bonacina; Pascal Fontaine; Cláudia Nalon; Claudia Schon; Martin Desharnais (Dagstuhl Reports, 2023)

Efficient Theorem-Proving for Modal Logics. - Cláudia Nalon (AiML, 2024)

Model Construction for Modal Clauses. - Ullrich Hustadt; Fabio Papacchini; Cláudia Nalon; Clare Dixon (IJCAR (2), 2024)

Non-iterative Modal Resolution Calculi. - Dirk Pattinson; Cláudia Nalon (IJCAR (2), 2024)

From Modal Sequent Calculi to Modal Resolution. - Dirk Pattinson; Cláudia Nalon; Sourabh Peruri (CADE, 2025)