Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....