We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
The symbolic representation of the physical structure of living organisms needs an ontologically well-founded and logically sound approach so that formal reasoning can adequately ...
The aim of the paper is to present basic notions related to granular computing, namely the information granule syntax and semantics as well as the inclusion and closeness (similari...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...