The usage of formal logic to solve problems in artificial intelligence has a long history in the
field. Information is represented in a formal language, which facilitates algorithmic reasoning …

Abstract Description logics have been extended in a number of ways to support defeasible
reasoning in the KLM tradition. Such features include preferential or rational defeasible …

Abstract Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by
enriching classical propositional logic with a typicality operator capturing the most typical …

Explanation facilities are an essential part of tools for knowledge representation and
reasoning systems. Knowledge representation and reasoning systems allow users to …

In recent work, we addressed an important limitation in previous extensions of description
logics to represent defeasible knowledge, namely the restriction in the semantics of …

Conditionals are defeasible rules of the form If A then usually B, and they play a central role
in many approaches to nonmonotonic reasoning. Normal forms of conditional knowledge …

Abstract Formal Concept Analysis (FCA) is an approach to creating a conceptual hierarchy
in which a concept lattice is generated from a formal context. That is, a triple consisting of a …

A successful application of ontologies relies on representing as much accurate and relevant
domain knowledge as possible, while maintaining logical consistency. As the successful …

Research in description logics (DLs) and formal ontologies has dedicated quite an effort to
the investigation of the notion of explanation for DL reasoning, for example relying on the …

Higher education institutions are becoming increasingly complex and self-developing
systems. Monitoring the activities of such systems requires a special approach and includes …