default search action
Christopher Hampson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Caitlin Bentley, Elena Simperl, Mike Bainbridge, Daisy Ogden, Stefanos Leonardos, Gunel Jahangirova, Joanna Walker, Wenjie Yin, Christopher Hampson:
Experience Report of the AWS+KCL Impact Accelerator for Public Sector Engagement. CSEE&T 2024: 1-6 - 2023
- [j6]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani:
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30(2): 117 (2023) - [j5]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim
, Solon P. Pissis
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978: 114182 (2023) - [c12]Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson
MUL-Tree Pruning for Consistency and Compatibility. CPM 2023: 14:1-14:18 - [c11]Mai Alzamel
Local Maximal Equality-Free Periodicities. AIAI Workshops 2023: 359-368 - 2022
- [c10]Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black:
A Sound and Complete Dialogue System for Handling Misunderstandings. SAFA@COMMA 2022: 19-32 - 2021
- [j4]Christopher Hampson:
On the termination and structural termination problems for counter machines with incrementing errors. J. Comput. Syst. Sci. 120: 149-161 (2021) - [c9]Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black:
Towards a Sound and Complete Dialogue System for Handling Enthymemes. CLAR 2021: 437-456 - 2020
- [j3]Christopher Hampson
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. Ann. Pure Appl. Log. 171(5): 102786 (2020) - [c8]Andreas Xydis, Christopher Hampson
Enthymemes in Dialogues. COMMA 2020: 395-402
2010 – 2019
- 2019
- [c7]Christopher Hampson:
On the Termination Problem for Counter Machines with Incrementing Errors. RP 2019: 137-148 - [i4]Christopher Hampson, Stanislav Kikot, Agi Kurucz, Sérgio Marcelino:
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations. CoRR abs/1905.09536 (2019) - 2018
- [c6]Christopher Hampson:
The Bimodal Logic of Commuting Difference Operators Is Decidable. Advances in Modal Logic 2018: 311-326 - [i3]Christopher Hampson:
Decidable fragments of first-order modal logics with counting quantifiers over varying domains. CoRR abs/1812.06341 (2018) - 2017
- [c5]Elizabeth Black, Amanda Jane Coles, Christopher Hampson:
Planning for Persuasion. AAMAS 2017: 933-942 - 2016
- [b1]Christopher Hampson:
Two-dimensional modal logics with difference relations. King's College London, UK, 2016 - [j2]Christopher Hampson
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines. Stud Logica 104(3): 455-486 (2016) - [c4]Christopher Hampson:
Decidable first-order modal logics with counting quantifiers. Advances in Modal Logic 2016: 382-400 - [c3]Elizabeth Black
Optimal Simple Strategies for Persuasion. ECAI 2016: 1736-1737 - 2015
- [j1]Christopher Hampson
Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting. ACM Trans. Comput. Log. 16(3): 27:1-27:36 (2015) - [i2]Christopher Hampson, Stanislav Kikot, Agi Kurucz:
The decision problem of modal product logics with a diagonal, and faulty counter machines. CoRR abs/1509.02060 (2015) - 2014
- [i1]Christopher Hampson, Agi Kurucz:
Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting. CoRR abs/1407.1386 (2014) - 2013
- [c2]Christopher Hampson, Agi Kurucz:
One-variable first-order linear temporal logics with counting. CSL 2013: 348-362 - 2012
- [c1]Christopher Hampson, Agi Kurucz:
On Modal Products with the Logic of 'Elsewhere'. Advances in Modal Logic 2012: 339-347
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-09-23 00:30 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: