International audienceGentzen designed his natural deduction proof system to ``come as close as possible to actual reasoning.'' Indeed, natural deduction proofs closely resemble the static structure of logical reasoning in mathematical arguments. However, different features of inference are compelling to capture when one wants to support the process of searching for proofs. PSF (Proof Search Framework) attempts to capture these features naturally and directly. The design and metatheory of PSF are presented, and its ability to specify a range of proof systems for classical, intuitionistic, and linear logic is illustrated
This paper outlines an implemented system called PROVERB that explains machine -found natural deduct...
Deep inference is a proof theoretic methodology that generalizes the standardnotion of inference of ...
AbstractAlgorithmic proof-search is an essential enabling technology throughout informatics. Proof-s...
International audienceGentzen designed his natural deduction proof system to ``come as close as poss...
We address the problem of proof-search in the natural deduction calculus for Intuitionistic proposit...
This paper continues a systematic approach to build natural deduction calculi and corresponding proo...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
Abstract. We propose a natural framework, called NF, which supports development of formal proofs on ...
This thesis develops techniques and ideas on proof search. Proof search is used with one of two mean...
Research on automated and interactive theorem proving aims at the mechanization of logical reasoning...
The Logical Framework (LF) is a formal system for the representation of logics and formal systems as...
We address the problem of proof-search in the natural deduction calculus for Classical propositional...
In this paper we present the automated proof search technique in natural deduction paracomplete logi...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
The formalization of the notion of a logically sound argument as a natural deduction proof offers th...
This paper outlines an implemented system called PROVERB that explains machine -found natural deduct...
Deep inference is a proof theoretic methodology that generalizes the standardnotion of inference of ...
AbstractAlgorithmic proof-search is an essential enabling technology throughout informatics. Proof-s...
International audienceGentzen designed his natural deduction proof system to ``come as close as poss...
We address the problem of proof-search in the natural deduction calculus for Intuitionistic proposit...
This paper continues a systematic approach to build natural deduction calculi and corresponding proo...
International audienceLogical frameworks have seen three decades of design, theory, implementation ,...
Abstract. We propose a natural framework, called NF, which supports development of formal proofs on ...
This thesis develops techniques and ideas on proof search. Proof search is used with one of two mean...
Research on automated and interactive theorem proving aims at the mechanization of logical reasoning...
The Logical Framework (LF) is a formal system for the representation of logics and formal systems as...
We address the problem of proof-search in the natural deduction calculus for Classical propositional...
In this paper we present the automated proof search technique in natural deduction paracomplete logi...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
The formalization of the notion of a logically sound argument as a natural deduction proof offers th...
This paper outlines an implemented system called PROVERB that explains machine -found natural deduct...
Deep inference is a proof theoretic methodology that generalizes the standardnotion of inference of ...
AbstractAlgorithmic proof-search is an essential enabling technology throughout informatics. Proof-s...