Christopher Hampson

According to our database, Christopher Hampson authored at least 20 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Maximal degenerate palindromes with gaps and mismatches.

Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts

Theor. Comput. Sci., November, 2023

Preface: MatBio 2021 Special Section.

Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani

J. Comput. Biol., February, 2023

Local Maximal Equality-Free Periodicities.

Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth

Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops, 2023

MUL-Tree Pruning for Consistency and Compatibility.

Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

A Sound and Complete Dialogue System for Handling Misunderstandings.

Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black

Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA 2022), 2022

2021

On the termination and structural termination problems for counter machines with incrementing errors.

Christopher Hampson

J. Comput. Syst. Sci., 2021

Towards a Sound and Complete Dialogue System for Handling Enthymemes.

Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black

Proceedings of the Logic and Argumentation - 4th International Conference, 2021

2020

Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations.

Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino

Ann. Pure Appl. Log., 2020

Enthymemes in Dialogues.

Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black

Proceedings of the Computational Models of Argument, 2020

2019

On the Termination Problem for Counter Machines with Incrementing Errors.

Christopher Hampson

Proceedings of the Reachability Problems - 13th International Conference, 2019

2018

Decidable fragments of first-order modal logics with counting quantifiers over varying domains.

Christopher Hampson

CoRR, 2018

The Bimodal Logic of Commuting Difference Operators Is Decidable.

Christopher Hampson

Proceedings of the Advances in Modal Logic 12, 2018

2017

Planning for Persuasion.

Elizabeth Black, Amanda Jane Coles, Christopher Hampson

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Two-dimensional modal logics with difference relations.

Christopher Hampson

PhD thesis, 2016

The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines.

Christopher Hampson, Stanislav Kikot, Ágnes Kurucz

Stud Logica, 2016

Optimal Simple Strategies for Persuasion.

Elizabeth Black, Amanda Jane Coles, Christopher Hampson

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Decidable first-order modal logics with counting quantifiers.

Christopher Hampson

Proceedings of the Advances in Modal Logic 11, 2016

2015

Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting.

Christopher Hampson, Agi Kurucz

ACM Trans. Comput. Log., 2015

2013

One-variable first-order linear temporal logics with counting.

Christopher Hampson, Agi Kurucz

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

On Modal Products with the Logic of 'Elsewhere'.

Christopher Hampson, Agi Kurucz

Proceedings of the Advances in Modal Logic 9, 2012