Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
Abstract. In this paper, we propose a new method for revising terminologies in description logic-based ontologies. Our revision method is a reformulation of the kernel revision ope...
Guilin Qi, Peter Haase, Zhisheng Huang, Jeff Z. Pa...
Abstract. We propose an approach for extending a tableau-based satisfiability algorithm by an arithmetic component. The result is a hybrid satisfiability algorithm for the Descript...
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Abstract. Agents interacting in open environments such as Internet are often in charge of personal information. In order to protect the privacy of human users, such agents have to ...