default search action
Ursula Martin
Person information
- affiliation: Queen Mary University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j18]Benedikt Löwe, Ursula Martin
, Alison Pease
Enabling mathematical cultures: introduction. Synth. 198(26): 6225-6231 (2021)
2010 – 2019
- 2019
- [j17]Mihaela Rozman
Women in Logic 2018 workshop report. ACM SIGLOG News 6(1): 41-42 (2019) - 2018
- [c25]Alison Pease, Ursula Martin:
Automating "Human-Like" Example-Use in Mathematics. Bridging@IJCAI/ECAI 2018: 6-12 - [i4]Joseph Corneli, Ursula Martin, Dave Murray-Rust, Gabriela Rino Nesin, Alison Pease:
Argumentation theory for mathematical argument. CoRR abs/1803.06500 (2018) - 2017
- [c24]Joseph Corneli, Ursula Martin
Modelling the way mathematics is actually done. FARM@ICFP 2017: 10-19 - [c23]Joseph Corneli, Ursula Martin
Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues. CICM 2017: 132-146 - 2016
- [j16]Ursula Martin
Computational logic and the social. J. Log. Comput. 26(2): 467-477 (2016) - 2015
- [c22]Søren Riis
Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium 2015: 14 - [c21]Ursula Martin
Stumbling Around in the Dark: Lessons from Everyday Mathematics. CADE 2015: 29-51 - 2013
- [j15]Rob Arthan, Ursula Martin
A Hoare logic for linear systems. Formal Aspects Comput. 25(3): 345-363 (2013) - [j14]Hanne Gottliebsen, Ruth Hardy, Olga Lightfoot, Ursula Martin
Applications of real number theorem proving in PVS. Formal Aspects Comput. 25(6): 993-1016 (2013) - [c20]Ursula Martin
Mathematical Practice, Crowdsourcing, and Social Machines. MKM/Calculemus/DML 2013: 98-119 - [i3]Ursula Martin, Alison Pease:
Mathematical practice, crowdsourcing, and social machines. CoRR abs/1305.0900 (2013) - [i2]Ursula Martin, Alison Pease:
What does mathoverflow tell us about the production of mathematics? CoRR abs/1305.0904 (2013)
2000 – 2009
- 2009
- [j13]Rob Arthan, Ursula Martin
A general framework for sound and complete Floyd-Hoare logics. ACM Trans. Comput. Log. 11(1): 7:1-7:31 (2009) - 2008
- [p1]Denise W. Gürer, Jennifer Light, Christina Björkman, Rhian Davies, Mark S. Hancock, Anne Condon, Annemieke Craig, Vashti Galpin, Ursula Martin
Women in Computing. Wiley Encyclopedia of Computer Science and Engineering 2008 - [i1]Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva:
A General Framework for Sound and Complete Floyd-Hoare Logics. CoRR abs/0807.1016 (2008) - 2006
- [c19]Ursula Martin
Hoare Logic in the Abstract. CSL 2006: 501-515 - 2005
- [j12]Hanne Gottliebsen, Tom W. Kelsey
Hidden verification for computational mathematics. J. Symb. Comput. 39(5): 539-567 (2005) - 2004
- [c18]Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom W. Kelsey
Design Verification for Control Engineering. IFM 2004: 21-35 - 2003
- [c17]Richard J. Boulton, Ruth Hardy, Ursula Martin
A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. HSCC 2003: 113-125 - 2001
- [j11]Nick Cropper, Ursula Martin
The Classification of Polynomial Orderings on Monadic Terms. Appl. Algebra Eng. Commun. Comput. 12(3): 197-226 (2001) - [c16]Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom W. Kelsey
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. TPHOLs 2001: 27-42 - 2000
- [j10]Ursula Martin
Invariants, Patterns and Weights for Ordering Terms. J. Symb. Comput. 29(6): 921-957 (2000) - [c15]Simon Colton, Volker Sorge, Ursula Martin:
Workshop: The Role of Automated Deduction in Mathematics. CADE 2000: 517
1990 – 1999
- 1999
- [c14]Andrew A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
VSDITLU: a verifiable symbolic definite integral table look-up. CADE 1999: 112-126 - [c13]Martin Dunstan, Tom W. Kelsey
Formal Methods for Extensions to CAS. World Congress on Formal Methods 1999: 1758-1777 - [c12]Andrew A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study. ISSAC 1999: 253-260 - 1998
- [c11]Martin Dunstan, Tom W. Kelsey
Lightweight Formal Methods for Computer Algebra Systems. ISSAC 1998: 80-87 - 1997
- [j9]Ursula Martin
The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. J. Symb. Log. 62(2): 624-635 (1997) - 1996
- [c10]Ursula Martin
Theorem Proving with Group Presentations: Examples and Questions. CADE 1996: 358-372 - [c9]Steve Linton, Ursula Martin
Algebra and Automated Deduction. CADE 1996: 448-462 - 1995
- [j8]Ursula Martin
On the Diversity of Orderings on Strings. Fundam. Informaticae 24(1/2): 25-46 (1995) - 1994
- [c8]Ursula Martin
Termination, Geometry and Invariants. CADE 1994: 432-434 - [c7]Ursula Martin
Verification Techniques for LOTOS. FME 1994: 83-92 - 1993
- [c6]Ursula Martin
The order types of termination orderings on monadic terms, strings and multisets. LICS 1993: 356-363 - [c5]Ursula Martin
Linear Interpretations by Counting Patterns. RTA 1993: 421-433 - [e1]Ursula Martin, Jeannette M. Wing:
First International Workshop on Larch, Proceedings of the first First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992. Workshops in Computing, Springer 1993, ISBN 3-540-19804-0 [contents] - 1992
- [j7]Ursula Martin
Some Experiments with a Completion Theorem Prover. J. Symb. Comput. 13(1): 81-100 (1992) - 1990
- [j6]Jeremy Dick, John Kalmus, Ursula Martin
Automating the Knuth Bendix Ordering. Acta Informatica 28(2): 95-119 (1990) - [j5]Ursula Martin
A Note on Division Orderings on Strings. Inf. Process. Lett. 36(5): 237-240 (1990) - [c4]Ursula Martin
Ordered Rewriting and Confluence. CADE 1990: 366-380 - [c3]Ursula Martin, Tobias Nipkow:
Automating Squiggol. Programming Concepts and Methods 1990: 233-246
1980 – 1989
- 1989
- [j4]Ursula Martin
Boolean Unification - The Story So Far. J. Symb. Comput. 7(3/4): 275-293 (1989) - [j3]Ursula Martin
A Geometrical Approach to Multiset Orderings. Theor. Comput. Sci. 67(1): 17-54 (1989) - 1988
- [j2]Ursula Martin
Unification in Boolean Rings. J. Autom. Reason. 4(4): 381-396 (1988) - 1987
- [j1]Ursula Martin
Extension Functions for Multiset Orderings. Inf. Process. Lett. 26(4): 181-186 (1987) - [c2]Ursula Martin
How to Choose Weights in the Knuth Bendix Ordering. RTA 1987: 42-53 - 1986
- [c1]Ursula Martin
Unification in Boolean Rings. CADE 1986: 506-513
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-10-15 21:38 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: