Ursula Martin

Publication Activity (10 Years)

Years Active: 1986-2021
Publications (10 Years): 9

Top Topics

Argumentation Theory

Top Venues

Formal Aspects Comput.

MKM/Calculemus/DML

ACM SIGLOG News

Publications

Benedikt Löwe, Ursula Martin, Alison Pease
Enabling mathematical cultures: introduction. Synth. 198 (26) (2021)
Mihaela Rozman, Valeria de Paiva, Amy P. Felty, Ursula Martin
Women in Logic 2018 workshop report. ACM SIGLOG News 6 (1) (2019)
Joseph Corneli, Ursula Martin, Dave Murray-Rust, Gabriela Rino Nesin, Alison Pease
Argumentation theory for mathematical argument. CoRR (2018)
Alison Pease, Ursula Martin
Automating "Human-Like" Example-Use in Mathematics. Bridging@IJCAI/ECAI (2018)
Joseph Corneli, Ursula Martin, Dave Murray-Rust, Alison Pease, Raymond Puzio, Gabriela Rino Nesin
Modelling the way mathematics is actually done. FARM@ICFP (2017)
Joseph Corneli, Ursula Martin, Dave Murray-Rust, Alison Pease
Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues. CICM (2017)
Ursula Martin
Computational logic and the social. J. Log. Comput. 26 (2) (2016)
Søren Riis, Ursula Martin, Nick Woodhouse
Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium (2015)
Ursula Martin
Stumbling Around in the Dark: Lessons from Everyday Mathematics. CADE (2015)
Ursula Martin, Alison Pease
Mathematical Practice, Crowdsourcing, and Social Machines. MKM/Calculemus/DML (2013)
Ursula Martin, Alison Pease
Mathematical practice, crowdsourcing, and social machines CoRR (2013)
Ursula Martin, Alison Pease
What does mathoverflow tell us about the production of mathematics? CoRR (2013)
Hanne Gottliebsen, Ruth Hardy, Olga Lightfoot, Ursula Martin
Applications of real number theorem proving in PVS. Formal Aspects Comput. 25 (6) (2013)
Rob Arthan, Ursula Martin, Paulo Oliva
A Hoare logic for linear systems. Formal Aspects Comput. 25 (3) (2013)
Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
A general framework for sound and complete Floyd-Hoare logics. ACM Trans. Comput. Log. 11 (1) (2009)
Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
A General Framework for Sound and Complete Floyd-Hoare Logics CoRR (2008)
Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
Hoare Logic in the Abstract. CSL (2006)
Hanne Gottliebsen, Tom Kelsey, Ursula Martin
Hidden verification for computational mathematics. J. Symb. Comput. 39 (5) (2005)
Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom Kelsey, Ursula Martin
Design Verification for Control Engineering. IFM (2004)
Richard J. Boulton, Ruth Hardy, Ursula Martin
A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. HSCC (2003)
Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. TPHOLs (2001)
Nick Cropper, Ursula Martin
The Classification of Polynomial Orderings on Monadic Terms. Appl. Algebra Eng. Commun. Comput. 12 (3) (2001)
Simon Colton, Volker Sorge, Ursula Martin
Workshop: The Role of Automated Deduction in Mathematics. CADE (2000)
Ursula Martin, Duncan Shand
Invariants, Patterns and Weights for Ordering Terms. J. Symb. Comput. 29 (6) (2000)
Martin Dunstan, Tom Kelsey, Ursula Martin, Steve Linton
Formal Methods for Extensions to CAS. World Congress on Formal Methods (1999)
A. 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)
A. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
VSDITLU: a verifiable symbolic definite integral table look-up. CADE (1999)
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula Martin
Lightweight Formal Methods for Computer Algebra Systems. ISSAC (1998)
Ursula Martin, Elizabeth Scott
The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. J. Symb. Log. 62 (2) (1997)
Ursula Martin
Theorem Proving with Group Presentations: Examples and Questions. CADE (1996)
Steve Linton, Ursula Martin, Péter Pröhle, Duncan Shand
Algebra and Automated Deduction. CADE (1996)
Ursula Martin
On the Diversity of Orderings on Strings. Fundam. Informaticae 24 (1/2) (1995)
Ursula Martin, M. Thomas
Verification Techniques for LOTOS. FME (1994)
Ursula Martin
Termination, Geometry and Invariants. CADE (1994)
Ursula Martin
Linear Interpretations by Counting Patterns. RTA (1993)
Ursula Martin, Elizabeth Scott
The order types of termination orderings on monadic terms, strings and multisets LICS (1993)
Ursula Martin, Michael Lai
Some Experiments with a Completion Theorem Prover. J. Symb. Comput. 13 (1) (1992)
Ursula Martin, Tobias Nipkow
Ordered Rewriting and Confluence. CADE (1990)
Ursula Martin
A Note on Division Orderings on Strings. Inf. Process. Lett. 36 (5) (1990)
Jeremy Dick, John Kalmus, Ursula Martin
Automating the Knuth Bendix Ordering. Acta Informatica 28 (2) (1990)
Ursula Martin, Tobias Nipkow
Automating Squiggol. Programming Concepts and Methods (1990)
Ursula Martin, Tobias Nipkow
Boolean Unification - The Story So Far. J. Symb. Comput. 7 (3/4) (1989)
Ursula Martin
A Geometrical Approach to Multiset Orderings. Theor. Comput. Sci. 67 (1) (1989)
Ursula Martin, Tobias Nipkow
Unification in Boolean Rings. J. Autom. Reason. 4 (4) (1988)
Ursula Martin
How to Choose Weights in the Knuth Bendix Ordering. RTA (1987)
Ursula Martin
Extension Functions for Multiset Orderings. Inf. Process. Lett. 26 (4) (1987)
Ursula Martin, Tobias Nipkow
Unification in Boolean Rings. CADE (1986)