Psyche: A Proof-Search Engine Based on Sequent Calculus with an LCF-Style Architecture
نویسنده
چکیده
ion and modularity D. Rouhling, A. Mahboubi & SGL axiomatised • the algebraic structure of constraints (some variant of meet-semilattice) • the specs of decision procedures called at leaves for the system to work (and to be equivalent to system w/o meta-variables) J-M Notin & SGL preparing PSYCHE 2.0 according to the above Backtrack mechanisms get tricky We also hope that this architecture can capture triggers-based instantiation mechanisms of SMT
منابع مشابه
Ingredients of a Deep Inference Theorem Prover
Deep inference deductive systems for classical logic provide exponentially shorter proofs than the sequent calculus systems, however with the cost of higher nondeterminism and larger search space in proof search. We report on our ongoing work on proof search with deep inference deductive systems. We present systems for classical logic where nondeterminism in proof search is reduced by constrain...
متن کاملOn the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call “shallow calculi”, where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima’s calculus for...
متن کاملOn the Specification of Sequent Systems
Recently, linear Logic has been used to specify sequent calculus proof systems in such a way that the proof search in linear logic can yield proof search in the specified logic. Furthermore, the meta-theory of linear logic can be used to draw conclusions about the specified sequent calculus. For example, derivability of one proof system from another can be decided by a simple procedure that is ...
متن کاملXISystem of Automated Deduction ( SAD ) : Linguistic andDeductive
In this paper a state of the art of a system of automated deduction called SAD is described ?. An architecture of SAD corresponds well to a modern vision of the Evidence Algorithm programme, initiated by Academician V.Glushkov. The system is intended for accumulating mathematical knowledge and using it in a regular and eecient manner for processing a self-contained mathematical text in order to...
متن کاملChallenges Implementing an LCF-Style Proof System with Haskell
The predominant, root design among current proof assistants, the LCF style, is traditionally realized through impure, functional languages. Thus, languages that eschew side-effects in the name of purity collectively represent a largely untapped platform for exploring alternate implementations of LCF-style provers. The work in this paper details the challenges we have encountered in the developm...
متن کامل