The foundation of a generic theorem prover
Journal of Automated Reasoning
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Journal of Automated Reasoning
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
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
Handling Polymorphism in Automated Deduction
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Combining Isabelle and QEPCAD-B in the Prover's Palette
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automating Algebraic Specifications of Non-freely Generated Data Types
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
An Interactive Driver for Goal-directed Proof Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
The VSE Refinement Method in Hets
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Source-level proof reconstruction for interactive theorem proving
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Improving Coq propositional reasoning using a lazy CNF conversion scheme
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Automated Flaw Detection in Algebraic Specifications
Journal of Automated Reasoning
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
Composable discovery engines for interactive theorem proving
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Verifying a hotel key card system
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Integrating automated and interactive protocol verification
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Combining interactive and automatic reasoning in first order theories of functional programs
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Integrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Prover's Palette
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting Computation and Proof
A framework for automated and certified refinement steps
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results ...