Ursula Martin

Orcid: 0000-0002-1908-5927

Affiliations:
  • Queen Mary University of London, UK


According to our database1, Ursula Martin authored at least 44 papers between 1987 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Enabling mathematical cultures: introduction.
Synth., 2021

2019
Women in Logic 2018 workshop report.
ACM SIGLOG News, 2019

2018
Argumentation theory for mathematical argument.
CoRR, 2018

Automating "Human-Like" Example-Use in Mathematics.
Proceedings of the fourth Workshop on Bridging the Gap between Human and Automated Reasoningco-located with the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), 2018

2017
Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues.
Proceedings of the Intelligent Computer Mathematics - 10th International Conference, 2017

Modelling the way mathematics is actually done.
Proceedings of the 5th ACM SIGPLAN International Workshop on Functional Art, 2017

2016
Computational logic and the social.
J. Log. Comput., 2016

2015
Stumbling Around in the Dark: Lessons from Everyday Mathematics.
Proceedings of the Automated Deduction - CADE-25, 2015

Ada Lovelace, a scientist in the archives.
Proceedings of the Ada Lovelace Symposium 2015, 2015

2013
Applications of real number theorem proving in PVS.
Formal Aspects Comput., 2013

A Hoare logic for linear systems.
Formal Aspects Comput., 2013

What does mathoverflow tell us about the production of mathematics?
CoRR, 2013

Mathematical Practice, Crowdsourcing, and Social Machines.
Proceedings of the Intelligent Computer Mathematics, 2013

2009
A general framework for sound and complete Floyd-Hoare logics.
ACM Trans. Comput. Log., 2009

2008

2006
Hoare Logic in the Abstract.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Hidden verification for computational mathematics.
J. Symb. Comput., 2005

2004
Design Verification for Control Engineering.
Proceedings of the Integrated Formal Methods, 4th International Conference, 2004

2003
A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems.
Proceedings of the Hybrid Systems: Computation and Control, 2003

2001
The Classification of Polynomial Orderings on Monadic Terms.
Appl. Algebra Eng. Commun. Comput., 2001

Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

2000
Invariants, Patterns and Weights for Ordering Terms.
J. Symb. Comput., 2000

Workshop: The Role of Automated Deduction in Mathematics.
Proceedings of the Automated Deduction, 2000

1999
Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Formal Methods for Extensions to CAS.
Proceedings of the FM'99 - Formal Methods, 1999

VSDITLU: a verifiable symbolic definite integral table look-up.
Proceedings of the Automated Deduction, 1999

1998
Lightweight Formal Methods for Computer Algebra Systems.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets.
J. Symb. Log., 1997

1996
Theorem Proving with Group Presentations: Examples and Questions.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

Algebra and Automated Deduction.
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995
On the Diversity of Orderings on Strings.
Fundam. Informaticae, 1995

1994
Verification Techniques for LOTOS.
Proceedings of the FME '94: Industrial Benefit of Formal Methods, 1994

Termination, Geometry and Invariants.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
Linear Interpretations by Counting Patterns.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992
Some Experiments with a Completion Theorem Prover.
J. Symb. Comput., 1992

1990
A Note on Division Orderings on Strings.
Inf. Process. Lett., 1990

Automating the Knuth Bendix Ordering.
Acta Informatica, 1990

Automating Squiggol.
Proceedings of the Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 1990

Ordered Rewriting and Confluence.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1989
A Geometrical Approach to Multiset Orderings.
Theor. Comput. Sci., 1989

Boolean Unification - The Story So Far.
J. Symb. Comput., 1989

1988
Unification in Boolean Rings.
J. Autom. Reason., 1988

1987
Extension Functions for Multiset Orderings.
Inf. Process. Lett., 1987

How to Choose Weights in the Knuth Bendix Ordering.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987


  Loading...