AbstractThe expressive power of temporal branching time logics that use the modalities EX and EF is described. Forbidden pattern characterizations are given for tree languages definable in three logics: EX, EF and EX+EF. The characterizations give algorithms for the definability problem in the respective logics that are polynomial in the size of a deterministic tree automaton representing the language
We consider a temporal logic EF+F^-1 for unranked, unordered finite trees.The logic has two operator...
In this paper the full branching time logic (CTL*) is studied. It has basic modalities consisting of...
We consider the satisfiability problem for the two-variable fragment of the first-order logic extend...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF...
AbstractThe expressive power of temporal branching time logics that use the modalities EX and EF is ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
AbstractWe associate a modal operator with each language belonging to a given class of regular tree ...
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] t...
AbstractWe show that ECTL+, the classical extension of CTL with fairness properties, is expressively...
In this note, we give a new proof for Bojańczyk&Walukiewicz’s effective characterization of TL[...
AbstractA theory satisfies the k-variable property if every first-order formula is equivalent to a f...
Abstract—We use the recently developed theory of forest algebras to find algebraic characterizations...
We study branching-time temporal description logics (TDLs) based on the DLs ALC and EL and the tempo...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted ove...
We consider a temporal logic EF+F^-1 for unranked, unordered finite trees.The logic has two operator...
In this paper the full branching time logic (CTL*) is studied. It has basic modalities consisting of...
We consider the satisfiability problem for the two-variable fragment of the first-order logic extend...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF...
AbstractThe expressive power of temporal branching time logics that use the modalities EX and EF is ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
AbstractWe associate a modal operator with each language belonging to a given class of regular tree ...
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] t...
AbstractWe show that ECTL+, the classical extension of CTL with fairness properties, is expressively...
In this note, we give a new proof for Bojańczyk&Walukiewicz’s effective characterization of TL[...
AbstractA theory satisfies the k-variable property if every first-order formula is equivalent to a f...
Abstract—We use the recently developed theory of forest algebras to find algebraic characterizations...
We study branching-time temporal description logics (TDLs) based on the DLs ALC and EL and the tempo...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted ove...
We consider a temporal logic EF+F^-1 for unranked, unordered finite trees.The logic has two operator...
In this paper the full branching time logic (CTL*) is studied. It has basic modalities consisting of...
We consider the satisfiability problem for the two-variable fragment of the first-order logic extend...
DOI
Add to ORKG