default search action
John Christopher McCabe-Dansted
Person information
- affiliation: University of Western Australia, Perth, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j6]John Christopher McCabe-Dansted, Mark Reynolds
:
To be fair, use bundles. Ann. Math. Artif. Intell. 80(3-4): 317-364 (2017) - [j5]John Christopher McCabe-Dansted, Mark Reynolds
Rewrite rules for CTL. J. Appl. Log. 21: 24-56 (2017) - [c19]John Christopher McCabe-Dansted, Mark Reynolds
A Parallel Linear Temporal Logic Tableau. GandALF 2017: 166-179 - 2016
- [j4]Tim French
A complete axiomatization of a temporal logic with obligation and robustness. J. Log. Comput. 26(5): 1439-1467 (2016) - [c18]John Christopher McCabe-Dansted, Mark Reynolds
Modelling Systems over General Linear Time. TIME 2016: 130-139 - 2015
- [j3]John Christopher McCabe-Dansted, Tim French
Expressiveness and succinctness of a logic of robustness. J. Appl. Non Class. Logics 25(3): 193-228 (2015) - [j2]Tim French
Synthesis for continuous time. Theor. Comput. Sci. 594: 201-222 (2015) - [c17]John Christopher McCabe-Dansted, Mark Reynolds
A Tableau for Bundled Strategies. TABLEAUX 2015: 22-37 - 2014
- [c16]John Christopher McCabe-Dansted, Mark Reynolds
Verification of Rewrite Rules for Computation Tree Logics. TIME 2014: 142-151 - [c15]John Christopher McCabe-Dansted, Mark Reynolds
Fairness with EXPTIME Bundled CTL Tableau. TIME 2014: 164-173 - 2013
- [c14]Tim French, John Christopher McCabe-Dansted, Mark Reynolds:
Indiscrete Models: Model Building and Model Checking over Linear Time. ICLA 2013: 50-68 - [c13]Tim French
Verifying Temporal Properties in Real Models. LPAR 2013: 309-323 - [c12]Tim French
Model Checking General Linear Temporal Logic. TABLEAUX 2013: 119-133 - [c11]Tim French
An Algebraic System of Temporal Structures. TIME 2013: 81-88 - [c10]Tim French
Complexity of Model Checking over General Linear Time. TIME 2013: 107-114 - [i3]Dodge Cahan, John Christopher McCabe-Dansted, Arkadii M. Slinko:
Nonconvergent Electoral Equilibria under Scoring Rules: Beyond Plurality. CoRR abs/1301.0152 (2013) - [i2]John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat:
Specifying Robustness. CoRR abs/1309.4416 (2013) - 2012
- [c9]Tim French, John Christopher McCabe-Dansted, Mark Reynolds:
Synthesis for Temporal Logic over the Reals. Advances in Modal Logic 2012: 217-238 - [c8]John Christopher McCabe-Dansted:
A Tableau for the Combination of CTL and BCTL*. TIME 2012: 29-36 - 2011
- [c7]John Christopher McCabe-Dansted:
On the Succinctness of RoCTL*. CATS 2011: 85-94 - [c6]John Christopher McCabe-Dansted:
A Rooted Tableau for BCTL*. M4M/LAMAS 2011: 145-158 - 2010
- [c5]Tim French
Axioms for Obligation and Robustness with Temporal Logic. DEON 2010: 66-83 - [c4]John Christopher McCabe-Dansted, Clare Dixon
CTL-Like Fragments of a Temporal Logic of Robustness. TIME 2010: 11-18 - [i1]John Christopher McCabe-Dansted:
Dodgson's Rule Approximations and Absurdity. CoRR abs/1008.1501 (2010)
2000 – 2009
- 2009
- [c3]John Christopher McCabe-Dansted, Tim French
On the Expressivity of RoCTL*. TIME 2009: 37-44 - 2008
- [j1]John Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko
Approximability of Dodgson's rule. Soc. Choice Welf. 31(2): 311-330 (2008) - [c2]John Christopher McCabe-Dansted:
A Tableau for RoBCTL*. JELIA 2008: 298-310 - 2007
- [c1]Tim French, John Christopher McCabe-Dansted, Mark Reynolds
A Temporal Logic of Robustness. FroCoS 2007: 193-205
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-04-25 05:40 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: