Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
Evolution of Knowledge Bases expressed in Description Logics (DLs) proved its importance. Most studies on evolution in DLs have focused on modelbased approaches to evolution semant...