Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Limited resource strategy in resolution theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Fast Term Indexing with Coded Context Trees
Journal of Automated Reasoning
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
The design and implementation of VAMPIRE
AI Communications - CASC
User Interaction with the Matita Proof Assistant
Journal of Automated Reasoning
Translating Higher-Order Clauses to First-Order Clauses
Journal of Automated Reasoning
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Some considerations on the usability of interactive provers
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
The Matita interactive theorem prover
CADE'11 Proceedings of the 23rd international conference on Automated deduction
| Hi-index | 0.00 |
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 superpositionbased 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.