IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A generic modular data structure for proof attempts alternating on ideas and granularity
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
System description: MULTI a multi-strategy proof planner
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The Seventeen Provers of the World
PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Deep Inference for Automated Proof Tutoring?
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Authoring Verified Documents by Interactive Proof Construction and Verification in Text-Editors
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Crystal: Integrating Structured Queries into a Tactic Language
Journal of Automated Reasoning
Recent developments in mega's proof search programming language
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
In this paper we investigate how to extract proof procedural information contained in declarative representations of mathematical knowledge, such as axioms, definitions, lemmas and theorems (collectively called assertions) and how to effectively include it into automated proof search techniques. In the context of the proof planner Multi and the agent-based reasoning system Ω-Ants, we present techniques to automatically synthesize proof planning methods and Ω-Ants-agents from assertions such that they can be actively used by these systems. This in turn enables a user to effectively use these systems without having to know the peculiarities of coding methods and agents.