Остановите войну!
for scientists:
default search action
Clare Dixon
- > Home > Persons > Clare Dixon
Publications
- 2023
- [c66]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
- [j38]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) - [j37]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) - [c63]Cláudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon:
Local Reductions for the Modal Cube. IJCAR 2022: 486-505 - 2021
- [c61]Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Efficient Local Reductions to Basic Modal Logic. CADE 2021: 76-92 - 2020
- [j32]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Multi-scale verification of distributed synchronisation. Formal Methods Syst. Des. 55(3): 171-221 (2020) - [j30]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
sf Kn : Architecture, Refinements, Strategies and Experiments. J. Autom. Reason. 64(3): 461-484 (2020) - [j29]Ullrich Hustadt, Ana Ozaki, Clare Dixon:
Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations. J. Autom. Reason. 64(8): 1553-1610 (2020) - 2019
- [j26]Cláudia Nalon, Clare Dixon, Ullrich Hustadt:
Modal Resolution: Proofs, Layers, and Refinements. ACM Trans. Comput. Log. 20(4): 23:1-23:38 (2019) - 2018
- [c52]Ullrich Hustadt, Cláudia Nalon, Clare Dixon:
Evaluating Pre-Processing Techniques for the Separated Normal Form for Temporal Logics. PAAR@FLoC 2018: 34-48 - [c51]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. ICFEM 2018: 160-176 - [i6]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Multi-Scale Verification of Distributed Synchronisation. CoRR abs/1809.10655 (2018) - 2017
- [c50]Ullrich Hustadt, Ana Ozaki, Clare Dixon:
Theorem Proving for Metric Temporal Logic over the Naturals. CADE 2017: 326-343 - [c49]Paul Gainer, Clare Dixon, Kerstin Dautenhahn, Michael Fisher, Ullrich Hustadt, Joe Saunders, Matt Webster:
CRutoN: Automatic Verification of a Robotic Assistant's Behaviours. FMICS-AVoCS 2017: 119-133 - [c48]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
KSP: A Resolution-based Prover for Multimodal K, Abridged Report. IJCAI 2017: 4919-4923 - [c47]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
Investigating Parametric Influence on Discrete Synchronisation Protocols Using Quantitative Model Checking. QEST 2017: 224-239 - [i5]Paul Gainer, Sven Linker, Clare Dixon, Ullrich Hustadt, Michael Fisher:
The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. CoRR abs/1709.04385 (2017) - 2016
- [c45]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
: A Resolution-Based Prover for Multimodal K. IJCAR 2016: 406-415 - [c44]Paul Gainer, Clare Dixon, Ullrich Hustadt:
Probabilistic Model Checking of Ant-Based Positionless Swarming. TAROS 2016: 127-138 - 2015
- [c43]Ullrich Hustadt, Paul Gainer, Clare Dixon, Cláudia Nalon, Lan Zhang:
Ordered Resolution for Coalition Logic. TABLEAUX 2015: 169-184 - [c42]Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
A Modal-Layered Resolution Calculus for K. TABLEAUX 2015: 185-200 - 2014
- [j22]Cláudia Nalon, Lan Zhang, Clare Dixon, Ullrich Hustadt:
A resolution-based calculus for Coalition Logic. J. Log. Comput. 24(4): 883-917 (2014) - [j21]Lan Zhang, Ullrich Hustadt, Clare Dixon:
A resolution calculus for the branching-time temporal logic CTL. ACM Trans. Comput. Log. 15(1): 10:1-10:38 (2014) - [c38]Cláudia Nalon, Lan Zhang, Clare Dixon, Ullrich Hustadt:
A Resolution Prover for Coalition Logic. SR 2014: 65-73 - 2010
- [j17]Lan Zhang, Ullrich Hustadt, Clare Dixon:
CTL-RP: A computation tree logic resolution prover. AI Commun. 23(2-3): 111-136 (2010) - 2009
- [c27]Lan Zhang, Ullrich Hustadt, Clare Dixon:
A Refined Resolution Calculus for CTL. CADE 2009: 245-260 - 2005
- [j12]Boris Konev, Anatoli Degtyarev, Clare Dixon, Michael Fisher, Ullrich Hustadt:
Mechanising first-order temporal resolution. Inf. Comput. 199(1-2): 55-86 (2005) - [j11]M. Carmen Fernández Gago, Ullrich Hustadt, Clare Dixon, Michael Fisher, Boris Konev:
First-Order Temporal Verification in Practice. J. Autom. Reason. 34(3): 295-321 (2005) - 2003
- [c15]Boris Konev, Anatoli Degtyarev, Clare Dixon, Michael Fisher, Ullrich Hustadt:
Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. TIME 2003: 72-82 - 2002
- [j7]Brandon Bennett, Clare Dixon, Michael Fisher, Ullrich Hustadt, Enrico Franconi, Ian Horrocks, Maarten de Rijke:
Combinations of Modal Logics. Artif. Intell. Rev. 17(1): 1-20 (2002) - 2001
- [c13]Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher, John-Jules Ch. Meyer, Wiebe van der Hoek:
Reasoning about agents in the KARO framework. TIME 2001: 206-213 - 2000
- [c12]Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher, John-Jules Ch. Meyer, Wiebe van der Hoek:
Verification within the KARO Agent Theory. FAABS 2000: 33-47 - [c11]Ullrich Hustadt, Clare Dixon, Renate A. Schmidt, Michael Fisher:
Normal Forms and Proofs in Combined Modal and Temporal Logics. FroCoS 2000: 73-87
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-04-21 18:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint