Investigating Preferential Reasoning in Formal Concept Analysis

From International Center for Computational Logic

Investigating Preferential Reasoning in Formal Concept Analysis

Talk by Lucas Carr
Formal Concept Analysis (FCA) provides a framework for studying Boolean data through concepts and their corresponding structures. The implication logic underlying FCA is relatively simple - analogous to propositional Horn, and is additionally monotonic. As a result, FCA is largely unable to reason through exceptions that may exist in data. This talk will explore how the KLM framework, and more generally preferential semantics, may be introduced to FCA, and what becomes of the (defeasible) implication logic, as well as notions of preferred or typical concepts.


BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join