AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicational Propositional Logic (M→) aimed to be used for provability and counter-model generation in this logic. The system tracks the attempts to construct a proof in such a way that, if the original formula is a M→ tautology, the tree structure produced by the proving process is a proof, otherwise, it is used to construct a counter-model using Kripke semantics
Abstract. Subintuitionistic logics are a class of logics dened by using Kripke models with more gene...
International audienceWhile model checking has often been considered as a practical alternative to b...
AbstractUnlike sets of definite Horn clauses, logic programs with disjunctions of atoms in clause he...
AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicationa...
The paper studies the automation of minimal model inference, i.e., determining whether a formula is ...
In this paper we present LSJ, a contraction-free sequent calculus for Intuitionistic propositional l...
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find ...
We present a novel formulation of the modal logic CPL, a constructive logic of provability that is c...
Reasoning from the minimal models of a theory, as fostered by circumscription, is in the area of Art...
AbstractThis paper presents an algorithm of proof search for positive formulas in minimal predicate ...
AbstractReasoning from the minimal models of a theory, as fostered by circumscription, is in the are...
10.1 We will be using a particular form of natural deduction, known as the method of subordinate pro...
AbstractThe work in Bunder (Theoret. Comput. Sci. 169 (1996) 3–21) shows that for each one of many i...
Minimal logic, i.e., intuitionistic logic without the ex falso principle, is investigated in its ori...
We present constructive provability logic, an intuitionstic modal logic that validates the L¨ob rule...
Abstract. Subintuitionistic logics are a class of logics dened by using Kripke models with more gene...
International audienceWhile model checking has often been considered as a practical alternative to b...
AbstractUnlike sets of definite Horn clauses, logic programs with disjunctions of atoms in clause he...
AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicationa...
The paper studies the automation of minimal model inference, i.e., determining whether a formula is ...
In this paper we present LSJ, a contraction-free sequent calculus for Intuitionistic propositional l...
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find ...
We present a novel formulation of the modal logic CPL, a constructive logic of provability that is c...
Reasoning from the minimal models of a theory, as fostered by circumscription, is in the area of Art...
AbstractThis paper presents an algorithm of proof search for positive formulas in minimal predicate ...
AbstractReasoning from the minimal models of a theory, as fostered by circumscription, is in the are...
10.1 We will be using a particular form of natural deduction, known as the method of subordinate pro...
AbstractThe work in Bunder (Theoret. Comput. Sci. 169 (1996) 3–21) shows that for each one of many i...
Minimal logic, i.e., intuitionistic logic without the ex falso principle, is investigated in its ori...
We present constructive provability logic, an intuitionstic modal logic that validates the L¨ob rule...
Abstract. Subintuitionistic logics are a class of logics dened by using Kripke models with more gene...
International audienceWhile model checking has often been considered as a practical alternative to b...
AbstractUnlike sets of definite Horn clauses, logic programs with disjunctions of atoms in clause he...