On Rewriting Rules in Mizar

Authors:
Artur Korniłowicz
Affiliations:
Institute of Informatics, University of Białystok, Białystok, Poland 15-887
Venue:
Journal of Automated Reasoning
Year:
2013

Citing 8
Cited 1

Obvious inferences

Journal of Automated Reasoning
Term rewriting and all that

Term rewriting and all that
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
An algorithm for reasoning about equality

Communications of the ACM
A Brief Overview of Mizar

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Obvious logical inferences

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Proof-producing congruence closure

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

A qualitative comparison of the suitability of four theorem provers for basic auction theory

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents some tentative experiments in using a special case of rewriting rules in Mizar (Mizar homepage: http://www.mizar.org/ ): rewriting a term as its subterm. A similar technique, but based on another Mizar mechanism called functor identification (Korniłowicz 2009) was used by Caminati, in his paper on basic first-order model theory in Mizar (Caminati, J Form Reason 3(1):49---77, 2010, Form Math 19(3):157---169, 2011). However for this purpose he was obligated to introduce some artificial functors. The mechanism presented in the present paper looks promising and fits the Mizar paradigm.