A computational logic handbook
A computational logic handbook
Knowledge-based proof planning
Artificial Intelligence
Adaptation of declaratively represented methods in proof planning
Annals of Mathematics and Artificial Intelligence
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
On the Implementation of an Extensible Declarative Proof Language
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Stratego: A Language for Program Transformation Based on Rewriting Strategies
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Automatic Generation of Epsilon-Delta Proofs of Continuity
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
P.rex: An Interactive Proof Explainer
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
System for Automated Deduction (SAD): A Tool for Proof Verification
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
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
Computer assisted reasoning with MIZAR
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Declarative Representation of Proof Terms
Journal of Automated Reasoning
Crystal: Integrating Structured Queries into a Tactic Language
Journal of Automated Reasoning
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Comparison of Proof Planning Systems: , Ωmega and IsaPlanner
Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative language for the coq proof assistant
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Verifying and invalidating textbook proofs using scunak
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Textbook proofs meet formal logic: the problem of underspecification and granularity
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Recent developments in mega's proof search programming language
ACM Communications in Computer Algebra
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
Influenced by the success of the Mizar system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier to modify and to maintain than their procedural counterparts. However, despite their advantages, many users still prefer the procedural style of proof, because procedural proofs are faster to write. In this paper we show how to define a declarative tactic language on top of a declarative proof language. The language comes along with a rich facility to declaratively specify conditions on proof states in the form of sequent patterns, as well as ellipses (dot notation) to provide a limited form of iteration. As declarative tactics are specified using the declarative proof language, they offer the same advantages as declarative proof languages. At the same time, they also produce declarative justifications in the form of a declarative proof script and can thus be seen as an attempt to reduce the gap between procedural and declarative proofs.