Abstract

Formal Concept Analysis (FCA) is a prominent field of applied mathematics using object-attribute relationships to define formal concepts — groups of objects with common attributes — which can be ordered into conceptual hierarchies, so-called concept lattices. We consider the problem of satisfiability of membership constraints, i.e., to determine if a formal concept exists whose object and attribute set include certain elements and exclude others. We analyze the computational complexity of this problem in general and for restricted forms of membership constraints. We perform the same analysis for generalizations of FCA to incidence structures of arity three (objects, attributes and conditions) and higher. We present a generic answer set programming (ASP) encoding of the membership constraint satisfaction problem, which allows for deploying available highly optimized ASP tools for its solution. Finally, we discuss the importance of membership constraints in the context of navigational approaches to data analysis.

Membership Constraints in Formal Concept Analysis / 3186 Sebastian Rudolph, Christian Sacarea, Diana Troanca PDF