Abstract
One of the most annoying aspects in the formalization of mathematics is the need of transforming notions to match a given, existing result. This kind of transformations, often based on a conspicuous background knowledge in the given scientific domain (mostly expressed in the form of equalities or isomorphisms), are usually implicit in the mathematical discourse, and it would be highly desirable to obtain a similar behaviour in interactive provers. The paper describes the superposition-based implementation of this feature inside the Matita interactive theorem prover, focusing in particular on the so called smart application tactic, supporting smart matching between a goal and a given result. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Asperti, A., & Tassi, E. (2010). Smart matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6167 LNAI, pp. 263–277). Springer Verlag. https://doi.org/10.1007/978-3-642-14128-7_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
