Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature. Cutfree Gentzen-type sequent calculi are convenient tools for backward proof-search search of formulas and sequents. In this paper we present a cut-free Gentzen type sequent calculus for PLTL with the operator “until”. We show that the calculus is sound and complete for the considered logic
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses eff...
Many extensions of Propositional Linear Temporal Logic (PLTL) are pro-posed with the goal of verifyi...
Abstract. A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally corre...
We consider propositional discrete linear time temporal logic with future and past operators of time...
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear te...
A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its ...
We consider combinations of nine propositional multi-modal logics with propositional discrete linear...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear te...
AbstractIt is known that linear-time temporal logic (LTL), which is an extension of classical logic,...
AbstractThe better known methods of semantic tableaux for deciding satisfiability in propositional l...
We consider GTL, a variant of linear temporal logic based on Gödel-Dummett propositional logic. In r...
A labelled sequent calculus is proposed for Priorean linear time logic, the rules of which reflect a...
Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are consider...
AbstractOn one hand, traditional tableau systems for temporal logic (TL) generate an auxiliary graph...
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses eff...
Many extensions of Propositional Linear Temporal Logic (PLTL) are pro-posed with the goal of verifyi...
Abstract. A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally corre...
We consider propositional discrete linear time temporal logic with future and past operators of time...
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear te...
A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its ...
We consider combinations of nine propositional multi-modal logics with propositional discrete linear...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear te...
AbstractIt is known that linear-time temporal logic (LTL), which is an extension of classical logic,...
AbstractThe better known methods of semantic tableaux for deciding satisfiability in propositional l...
We consider GTL, a variant of linear temporal logic based on Gödel-Dummett propositional logic. In r...
A labelled sequent calculus is proposed for Priorean linear time logic, the rules of which reflect a...
Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are consider...
AbstractOn one hand, traditional tableau systems for temporal logic (TL) generate an auxiliary graph...
In this paper, we present sequent calculus for linear temporal logic. This sequent calculus uses eff...
Many extensions of Propositional Linear Temporal Logic (PLTL) are pro-posed with the goal of verifyi...
Abstract. A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally corre...
DOI
Add to ORKG