A connection method for a defeasible extension of ALC
Fernandes R., Freitas F., Varzinczak I.
Description logic Defeasible reasoning Connection method
In this paper, we propose a connection method `a la Bibel for an exception-tolerant extension of ALC. As for the language, we assume ALC extended with a typicality operator on concepts, which is a variant of defeasible DLs studied in the literature over the past decade and in which most of these can be embedded. We revisit the definition of matrix representation of a knowledge base and establish the conditions for a given axiom to be provable from it. In particular, we show how term substitution is dealt with and define a suitable condition of blocking in the presence of typicality operators. We show that the calculus terminates and that it is sound and complete w.r.t. a DL version of the preferential semantics widely adopted in non-monotonic reasoning.
Source: DL 2021 - 34th International Workshop on Description Logics, Bratislava, Slovakia, 19-22/09/2021
Publisher: M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen., Aachen, Germania
Back to previous page
@inproceedings{oai:it.cnr:prodotti:468671,
title = {A connection method for a defeasible extension of ALC},
author = {Fernandes R. and Freitas F. and Varzinczak I.},
publisher = {M. Jeusfeld c/o Redaktion Sun SITE, Informatik V, RWTH Aachen., Aachen, Germania},
booktitle = {DL 2021 - 34th International Workshop on Description Logics, Bratislava, Slovakia, 19-22/09/2021},
year = {2021}
}
0000-0002-0025-9632