: The goal of this paper is to provide computable account for some definite descriptions. To this end, we define in terms of inclusion the notion of distinguishing description and ...
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
We obtain an equiconsistency for a weak form of universal indestructibility for strongness. The equiconsistency is relative to a cardinal weaker in consistency strength than a Woo...
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...