default search action
Cláudia Nalon
Person information
- affiliation: University of Brasília, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Cláudia Nalon:
Efficient Theorem-Proving for Modal Logics. AiML 2024: 13-16 - [c23]Ullrich Hustadt
, Fabio Papacchini
Model Construction for Modal Clauses. IJCAR (2) 2024: 3-23 - [c22]Dirk Pattinson
Non-iterative Modal Resolution Calculi. IJCAR (2) 2024: 97-113 - [e3]Christopher W. Brown, Daniela Kaufmann, Cláudia Nalon, Alexander Steen, Martin Suda:
Joint Proceedings of the 9th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 9th Satisfiability Checking and Symbolic Computation Workshop (SC-Square), 2024 co-located with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), Nancy, France, July 2, 2024. CEUR Workshop Proceedings 3717, CEUR-WS.org 2024 [contents] - 2023
- [c21]Cláudia Nalon
Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic. CADE 2023: 382-400 - [c20]Dirk Pattinson
Resolution Calculi for Non-normal Modal Logics. TABLEAUX 2023: 322-341 - [i3]Maria Paola Bonacina, Pascal Fontaine, Cláudia Nalon, Claudia Schon, Martin Desharnais:
The Next Generation of Deduction Systems: From Composition to Compositionality (Dagstuhl Seminar 23471). Dagstuhl Reports 13(11): 130-150 (2023) - 2022
- [j9]Fabio Papacchini
Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 639-666 (2022) - [j8]Fabio Papacchini
Correction to: Local is Best: Efficient Reductions to Modal Logic K. J. Autom. Reason. 66(4): 1099 (2022) - [c19]Cláudia Nalon
Local Reductions for the Modal Cube. IJCAR 2022: 486-505 - [c18]Bernardo Alkmim, Edward Hermann Haeusler, Cláudia Nalon:
A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals. Description Logics 2022 - 2021
- [j7]Bruno Lopes
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic. ACM Trans. Comput. Log. 22(2): 9:1-9:22 (2021) - [c17]Fabio Papacchini
Efficient Local Reductions to Basic Modal Logic. CADE 2021: 76-92 - 2020
- [j6]Cláudia Nalon
sf Kn : Architecture, Refinements, Strategies and Experiments. J. Autom. Reason. 64(3): 461-484 (2020) - [c16]Cláudia Nalon, Giselle Reis:
Preface. LSFA 2020: 1-2 - [e2]Cláudia Nalon, Giselle Reis:
Proceedings of the 15th International Workshop on Logical and Semantic Frameworks with Applications, LSFA 2020, Online, September 15, 2020. Electronic Notes in Theoretical Computer Science 351, Elsevier 2020 [contents] - [i2]Olaf Beyersdorff, Uwe Egly, Meena Mahajan, Cláudia Nalon:
SAT and Interactions (Dagstuhl Seminar 20061). Dagstuhl Reports 10(2): 1-18 (2020)
2010 – 2019
- 2019
- [j5]Cláudia Nalon
Modal Resolution: Proofs, Layers, and Refinements. ACM Trans. Comput. Log. 20(4): 23:1-23:38 (2019) - 2018
- [j4]Cláudia Nalon, Daniele Nantes Sobrinho, Elaine Pimentel
Brasilia Spring on Automated Reasoning. ACM SIGLOG News 5(1): 21-22 (2018) - [c15]Ullrich Hustadt, Cláudia Nalon, Clare Dixon:
Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics. PAAR@FLoC 2018: 34-48 - [c14]Cláudia Nalon
A Resolution-Based Calculus for Preferential Logics. IJCAR 2018: 498-515 - 2017
- [c13]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
KSP: A Resolution-based Prover for Multimodal K, Abridged Report. IJCAI 2017: 4919-4923 - [e1]Renate A. Schmidt, Cláudia Nalon:
Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25-28, 2017, Proceedings. Lecture Notes in Computer Science 10501, Springer 2017, ISBN 978-3-319-66901-4 [contents] - 2016
- [c12]Cláudia Nalon, Ullrich Hustadt
: A Resolution-Based Prover for Multimodal K. IJCAR 2016: 406-415 - 2015
- [c11]Ullrich Hustadt
Ordered Resolution for Coalition Logic. TABLEAUX 2015: 169-184 - [c10]Cláudia Nalon, Ullrich Hustadt
A Modal-Layered Resolution Calculus for K. TABLEAUX 2015: 185-200 - 2014
- [j3]Cláudia Nalon, Lan Zhang, Clare Dixon
A resolution-based calculus for Coalition Logic. J. Log. Comput. 24(4): 883-917 (2014) - [c9]Cláudia Nalon, João Marcos
Clausal Resolution for Modal Logics of Confluence. IJCAR 2014: 322-336 - [c8]Cláudia Nalon, Lan Zhang, Clare Dixon
A Resolution Prover for Coalition Logic. SR 2014: 65-73 - [c7]Cláudia Nalon, Bruno Lopes
A Calculus for Automatic Verification of Petri Nets Based on Resolution and Dynamic Logics. LSFA 2014: 125-141 - [i1]Cláudia Nalon, João Marcos, Clare Dixon:
Clausal Resolution for Modal Logics of Confluence. CoRR abs/1405.0293 (2014) - 2013
- [c6]Cláudia Nalon, Oliver Kutz
Towards Resolution-based Reasoning for Connected Logics. LSFA 2013: 85-102
2000 – 2009
- 2007
- [j2]Cláudia Nalon, Clare Dixon
Clausal resolution for normal modal logics. J. Algorithms 62(3-4): 117-134 (2007) - 2006
- [c5]Cláudia Nalon, Clare Dixon:
Anti-prenexing and Prenexing for Modal Logics. JELIA 2006: 333-345 - 2004
- [b1]Cláudia Nalon:
Resolution for synchrony and no learning. University of Liverpool, UK, 2004 - [j1]Clare Dixon
Tableaux for Logics of Time and Knowledge with Interactions Relating to Synchrony. J. Appl. Non Class. Logics 14(4): 397-445 (2004) - [c4]Cláudia Nalon, Clare Dixon, Michael Fisher:
Resolution for Synchrony and No Learning. Advances in Modal Logic 2004: 231-248 - 2003
- [c3]Clare Dixon
Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect Recall or No Learning. TIME 2003: 62-71 - 2000
- [c2]Cláudia Nalon:
Theorem Proving for Temporal Logics of Knowledge or Belief. ARW 2000
1990 – 1999
- 1998
- [c1]Cláudia Nalon, Jacques Wainer:
Strong Conditional Logic. SBIA 1998: 209-218
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-22 21:15 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: