Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
A computational logic handbook
A computational logic handbook
Inference rules using local contexts
Journal of Automated Reasoning
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A theory of binding structures and applications to rewriting
Theoretical Computer Science
IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Software architecture: perspectives on an emerging discipline
Software architecture: perspectives on an emerging discipline
Towards provably correct system synthesis and extension
Future Generation Computer Systems - Special double issue: reflection and meta-level AI architectures
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linking Other Theorem Provers to HOL Using PM: Proof Manager
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Proceedings of the Workshop on Formal Methods in Databases and Software Engineering
The HOL-Voss System: Model-Checking inside a General-Purpose Theorem-Prover
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Automating Most Parts of Hardware Proofs in HOL
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
An Integration of Model Checking with Automated Proof Checking
Proceedings of the 7th International Conference on Computer Aided Verification
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
From Integrated Reasoning Specialists to ``Plug-and-Play'' Reasoning Components
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Specification and Integration of Theorem Provers and Computer Algebra Systems
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Planware ¾ Domain-Specific Synthesis of High-Performance Schedulers
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
Our long-term goal is the development of a general framework for specifying, structuring, and interoperating provers. Our main focus is on the formalization of the architectural and implementational choices that underlie the construction of such systems. This paper has two main goals. The first is to introduce the main intuitions underlying the proposed framework. We concentrate on its use in the integration of provers. The second is the development of the notion of ireasoning theory, meant as the formalization of the notion of “implementation of the logic” of a prover. As an example we sketch an analysis, at the reasoning theory level, of the integration of linear arithmetic into the NQTHM simplification process.