Add to ORKGWe present an ongoing work on a proof-search procedure for Propositional Linear Temporal Logic (PLTL) based on a one-pass tableau calculus with a multiple-conclusion rule. The procedure exploits logical optimization rules to reduce the proof-search space. We also discuss the performances of a Prolog prototype of our procedure
AbstractLight linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-t...
In this thesis, we present new decision procedures for linear arithmetic in the context of SMT solve...
In this paper, I consider a family of three-valued regular logics: the well-known strong a...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
The article introduces propositional linear time temporal logic as a formal system. Axioms and rules...
International audienceWe give a procedure for counting the number of different proofs of a formula i...
AbstractWe present aPCTL, a version of PCTL with an action-based semantics which coincides with the ...
AbstractThis paper considers a typed λ-calculus for classical linear logic. I shall give an explanat...
The author is the winner of the Mizar Prize for Young Researchers in 2012 for this article.I would l...
AbstractStarting from Girard’s seminal paper on light linear logic (LLL), a number of works investig...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
The proof of Cut-elimination is unfortunately bugged. It is repaired in "Sequent Calculi with proced...
I would like to thank Prof. Andrzej Trybulec, Dr. Artur Korniłowicz, Dr. Adam Naumowicz and Karol Pa...
AbstractLet ϕ be a formula of Łukasiewicz infinite-valued propositional logic having a total of l ma...
AbstractLight linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-t...
In this thesis, we present new decision procedures for linear arithmetic in the context of SMT solve...
In this paper, I consider a family of three-valued regular logics: the well-known strong a...
AbstractProof search in linear logic is known to be difficult: the provability of propositional line...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
The article introduces propositional linear time temporal logic as a formal system. Axioms and rules...
International audienceWe give a procedure for counting the number of different proofs of a formula i...
AbstractWe present aPCTL, a version of PCTL with an action-based semantics which coincides with the ...
AbstractThis paper considers a typed λ-calculus for classical linear logic. I shall give an explanat...
The author is the winner of the Mizar Prize for Young Researchers in 2012 for this article.I would l...
AbstractStarting from Girard’s seminal paper on light linear logic (LLL), a number of works investig...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
The proof of Cut-elimination is unfortunately bugged. It is repaired in "Sequent Calculi with proced...
I would like to thank Prof. Andrzej Trybulec, Dr. Artur Korniłowicz, Dr. Adam Naumowicz and Karol Pa...
AbstractLet ϕ be a formula of Łukasiewicz infinite-valued propositional logic having a total of l ma...
AbstractLight linear logic [1] is a refinement of the propositions-as-types paradigm to polynomial-t...
In this thesis, we present new decision procedures for linear arithmetic in the context of SMT solve...
In this paper, I consider a family of three-valued regular logics: the well-known strong a...