Christopher Hampson

ORCID

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 17

Top Venues

CoRR

Advances in Modal Logic

J. Comput. Syst. Sci.

J. Comput. Biol.

King's College London, UK (PHD)

Education History

King's College London, UK

PHD

Publications

Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978 (2023)
Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth
Local Maximal Equality-Free Periodicities. AIAI Workshops (2023)
Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30 (2) (2023)
Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung
MUL-Tree Pruning for Consistency and Compatibility. CPM (2023)
Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black
A Sound and Complete Dialogue System for Handling Misunderstandings. SAFA@COMMA (2022)
Christopher Hampson
On the termination and structural termination problems for counter machines with incrementing errors. J. Comput. Syst. Sci. 120 (2021)
Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black
Towards a Sound and Complete Dialogue System for Handling Enthymemes. CLAR (2021)
Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. Ann. Pure Appl. Log. 171 (5) (2020)
Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black
Enthymemes in Dialogues. COMMA (2020)
Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. CoRR (2019)
Christopher Hampson
On the Termination Problem for Counter Machines with Incrementing Errors. RP (2019)
Christopher Hampson
Decidable fragments of first-order modal logics with counting quantifiers over varying domains. CoRR (2018)
Christopher Hampson
The Bimodal Logic of Commuting Difference Operators Is Decidable. Advances in Modal Logic (2018)
Elizabeth Black, Amanda Jane Coles, Christopher Hampson
Planning for Persuasion. AAMAS (2017)
Elizabeth Black, Amanda Jane Coles, Christopher Hampson
Optimal Simple Strategies for Persuasion. ECAI (2016)
Christopher Hampson, Stanislav Kikot, Ágnes Kurucz
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines. Stud Logica 104 (3) (2016)
Christopher Hampson
Decidable first-order modal logics with counting quantifiers. Advances in Modal Logic (2016)
Christopher Hampson, Stanislav Kikot, Agi Kurucz
The decision problem of modal product logics with a diagonal, and faulty counter machines. CoRR (2015)
Christopher Hampson, Agi Kurucz
Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting. ACM Trans. Comput. Log. 16 (3) (2015)
Christopher Hampson, Agi Kurucz
Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting. CoRR (2014)
Christopher Hampson, Agi Kurucz
One-variable first-order linear temporal logics with counting. CSL (2013)
Christopher Hampson, Agi Kurucz
On Modal Products with the Logic of 'Elsewhere'. Advances in Modal Logic (2012)

Christopher Hampson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christopher Hampson