Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
In the current paper we study the reasoning problem for fuzzy SI (f-SI) under arbitrary continuous fuzzy operators. Our work can be seen as an extension of previous works that stud...
We propose an alternative to probability density classifiers based on normal distributions LDA and QDA. Instead of estimating covariance matrices using the standard maximum likeli...
David M. J. Tax, Piotr Juszczak, Robert P. W. Duin...