This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Abstract. The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are t...
David Billington, Grigoris Antoniou, Guido Governa...
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
At present, the search for specific information on the World Wide Web is faced with several problems, which arise on the one hand from the vast number of information sources avail...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...