Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
The paper brings a discussion about the source of the inaccuracy in observations of objects and demonstrates that the essential reason of the lack of precision is changeability, a...
As natural language understanding research advances towards deeper knowledge modeling, the tasks become more and more complex: we are interested in more nuanced word characteristi...
Radu Florian, Hongyan Jing, Nanda Kambhatla, Imed ...