Horn representation of a concept lattice

DOI10.1080/03081070902857878MaRDI QIDQ3631392zbMATH OpenOpenAlexFDO

Authors Kamel Ben-Khalifa, Susanne Motameny

Publication date 9 June 2009

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL http://www.informaworld.com/smpp/./content~db=all~content=a910016371

zbMATH Keywords

attribute implicationsconcept latticeHorn conjunctive normal form formulaprime implicates

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Concept lattices and conceptual knowledge systems
• scientific article; zbMATH DE number 754421
• scientific article; zbMATH DE number 4202326
• scientific article; zbMATH DE number 90538
• Representing a concept lattice by a graph

Cites work

• An efficient algorithm for Horn description
• Complexity of generalized satisfiability counting problems
• Generalized domination in closure systems
• Horn approximations of empirical data
• Horn functions and their DNFs
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• Knowledge compilation and theory approximation
• On computing the size of a lattice and related decision problems
• On sentences which are true of direct unions of algebras
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The decision problem for some classes of sentences without quantifiers
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey

Cited in

(1)

• Three views on dependency covers from an FCA perspective

This page was built for publication: Horn representation of a concept lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631392)