Abstract. Managing knowledge is a difficult and slippery enterprise. A wide variety of technologies have to be invoked in providing support for knowledge requirements, ranging fro...
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
By a nearlattice is meant a join-semilattice having the property that every principal filter is a lattice with respect to the semilattice order. We introduce the concept of (relat...