Results 261 to 270 of about 6,972,561 (305)
Some of the next articles are maybe not open access.
Expressive capacity of subregular expressions
RAIRO - Theoretical Informatics and Applications, 2018Different types of subregular expressions are studied. Each type is obtained by either omitting one of the regular operations or replacing it by complementation or intersection. For uniformity and in order to allow non-trivial languages to be expressed, the set of literals is a finite set of words instead of letters.
Martin Kutrib, Matthias Wendlandt
openaire +2 more sources
Expression Templates for Dot Product Expressions
Reliable Computing, 1999We use expression templates to obtain an easy to use, efficient C++ component for the computation of dot product expressions. Since loop fusion is done at compile time, we only need one dotprecision variable for arbitrary dot product expressions. The algorithms can easily be adapted to exploit parallelism in a distributed environment.
Michael Lerch +1 more
openaire +1 more source
EXPRESSIBLE SEMANTICS FOR EXPRESSIBLE COUNTERFACTUALS
The Review of Symbolic Logic, 2010Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources).
openaire +1 more source
2009 16th International Symposium on Temporal Representation and Reasoning, 2009
RoCTL* was proposed to model robustness in concurrent systems. RoCTL* extended CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure respectively. Whether RoCTL* is more expressive than CTL* has remained an open problem since the RoCTL* logic was proposed.
John Christopher McCabe-Dansted +3 more
openaire +2 more sources
RoCTL* was proposed to model robustness in concurrent systems. RoCTL* extended CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure respectively. Whether RoCTL* is more expressive than CTL* has remained an open problem since the RoCTL* logic was proposed.
John Christopher McCabe-Dansted +3 more
openaire +2 more sources