Defaults in Description Logics: So Simple, So Difficult

In this paper we introduce the notion of “generalized monotonicity” and Σοφια algorithm that allow generating best patterns in polynomial time for some nonmonotonic

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

The full language is in fact very ex- pressive, capturing a variety of different formalisms, among them two based on MKNF logics [27] that had been considered of different

In comparison with our approach, these other works can be seen more as a form of belief re- vision, based on argumentation, for classically inconsistent theories rather than

We need at worst n∗m classical decision procedures to associate to each individual a default concept, then another one to check the overall consistency of the new knowledge base,

This approach, based on the notion of conditional guaranteed possibility measures, some- what parallels the nonmonotonic handling of default knowledge under incomplete in-

Intentions and context must be taken into account at each reasoning level, to direct choices during the planning process, control the execution of operators and select the

Quant à so, de la même manière qu’avec do auxiliaire, il est possible de considérer qu’il reprend la relation prédicative dans sa délimitation qualitative,