Ursula Martin
According to our database^{1},
Ursula Martin
authored at least 41 papers
between 1986 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org

at id.loc.gov

at isni.org

at dl.acm.org
On csauthors.net:
Bibliography
2018
Automating "HumanLike" ExampleUse in Mathematics.
Proceedings of the fourth Workshop on Bridging the Gap between Human and Automated Reasoningcolocated with the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAIECAI 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  CADE25, 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 Asp. Comput., 2013
A Hoare logic for linear systems.
Formal Asp. Comput., 2013
Mathematical Practice, Crowdsourcing, and Social Machines.
Proceedings of the Intelligent Computer Mathematics, 2013
2009
A general framework for sound and complete FloydHoare logics.
ACM Trans. Comput. Log., 2009
2008
Women in Computing.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 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 SingleInput SingleOutput ContinuousTime 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 lookup.
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  CADE13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996
Algebra and Automated Deduction.
Proceedings of the Automated Deduction  CADE13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996
1995
On the Diversity of Orderings on Strings.
Fundam. Inform., 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  CADE12, 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
The order types of termination orderings on monadic terms, strings and multisets
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 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 Inf., 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
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
1986
Unification in Boolean Rings.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986