Browse by People

Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 20.


Zhang, Lan Clausal reasoning for branching-time logics. Doctor of Philosophy thesis, University of Liverpool.


Papacchini, Fabio ORCID: 0000-0002-0310-7378, Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2021) Efficient Local Reductions to Basic Modal Logic. In: Automated Deduction – CADE 28. Lecture Notes in Computer Science, 12699 . Springer International Publishing, pp. 76-92. ISBN 978-3-030-79875-8


Gainer, Paul (2020) Formal Analysis of Artificial Collectives using Parametric Markov Models. PhD thesis, University of Liverpool.


Gainer, Paul, Linker, Sven ORCID: 0000-0003-2913-7943, Dixon, Clare ORCID: 0000-0002-4610-9533, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Fisher, Michael (2017) Investigating Parametric Influence on Discrete Synchronisation Protocols Using Quantitative Model Checking. In: 14th International Conference on Quantitative Evaluation of SysTems (QEST), 2017-9-5 - 2017-9-7, Berlin, Germany.


Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2016) K<sub>S</sub>P: A Resolution-Based Prover for Multimodal K. In: International Joint Conference on Automated Reasoning, 2016-6-27 - 2016-7-2, Coimbra, Portugal.


Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare (2017) K<sub>S</sub>P: A Resolution-based Prover for Multimodal K Abridged Report. In: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017).


Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267, Papacchini, Fabio ORCID: 0000-0002-0310-7378 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2022) Local Reductions for the Modal Cube. In: Automated Reasoning. Lecture Notes in Computer Science, 13385 . Springer International Publishing, pp. 486-505. ISBN 978-3-031-10768-9


Papacchini, Fabio ORCID: 0000-0002-0310-7378, Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2022) Local is Best: Efficient Reductions to Modal Logic K. JOURNAL OF AUTOMATED REASONING, 66 (4). pp. 639-666.


Papacchini, Fabio ORCID: 0000-0002-0310-7378, Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2022) Local is Best: Efficient Reductions to Modal Logic K (Sep, 2022, 10.1007/s10817-022-09630-6). JOURNAL OF AUTOMATED REASONING, 66 (4). p. 1099.


Nalon, Cláudia, Dixon, Clare and Hustadt, Ullrich ORCID: 0000-0002-0455-0267 (2019) Modal Resolution: Proofs, Layers, and Refinements. ACM Trans. Comput. Log., 20. 23:1-23:1.


Gainer, Paul, Linker, Sven ORCID: 0000-0003-2913-7943, Dixon, Clare ORCID: 0000-0002-4610-9533, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Fisher, Michael (2020) Multi-Scale Verification of Distributed Synchronisation. Formal Methods in System Design, 55 (3). pp. 171-221.


Gainer, Paul, Linker, Sven ORCID: 0000-0003-2913-7943, Dixon, Clare ORCID: 0000-0002-4610-9533, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Fisher, Michael ORCID: 0000-0002-0875-3862 (2020) Multi-scale verification of distributed synchronisation. FORMAL METHODS IN SYSTEM DESIGN.


Gainer, Paul, Linker, Sven ORCID: 0000-0003-2913-7943, Dixon, Clare ORCID: 0000-0002-4610-9533, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Fisher, Michael (2018) The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. Quantitative Evaluation of Systems, 11232. pp. 160-176.


Gainer, Paul, Linker, Sven ORCID: 0000-0003-2913-7943, Dixon, Clare, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Fisher, Michael (2018) The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators. In: 20th International Conference on Formal Engineering Methods, 2018-11-12 - 2018-11-16, Griffith University, Gold Coast, Australia.


Zhang, Lan, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare ORCID: 0000-0002-4610-9533 (2014) A Resolution Calculus for the Branching-Time Temporal Logic CTL. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 15 (1). pp. 1-38.


Nalon, Cláudia, Zhang, Lan, Dixon, Clare ORCID: 0000-0002-4610-9533 and Hustadt, Ullrich ORCID: 0000-0002-0455-0267 (2014) A Resolution Prover for Coalition Logic. In: 2nd International Workshop on Strategic Reasoning, Satellite workshop of ETAPS 2014.


Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, CL ORCID: 0000-0002-4610-9533 (2020) A Resolution-Based Theorem Prover for Kn: Architecture, Refinements, Strategies and Experiments. Journal of Automated Reasoning, 64 (3). pp. 461-484.


Hustadt, Ullrich ORCID: 0000-0002-0455-0267, Ozaki, Ana and Dixon, Clare ORCID: 0000-0002-4610-9533 (2020) Theorem Proving for Pointwise Metric Temporal Logic Overthe Naturals via Translations. Journal of Automated Reasoning, 64 (8). pp. 1553-1610.


Nalon, Cláudia, Zhang, Lan, Dixon, Clare ORCID: 0000-0002-4610-9533 and Hustadt, Ullrich ORCID: 0000-0002-0455-0267 (2014) A resolution-based calculus for Coalition Logic. Journal of Logic and Computation, 24 (4). pp. 883-917.


Nalon, Cláudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, Clare (2020) sf Kn : Architecture, Refinements, Strategies and Experiments. J. Autom. Reason., 64. pp. 461-484.

This list was generated on Sat Feb 3 06:38:54 2024 GMT.