Horn representation of a concept lattice

DOI10.1080/03081070902857878zbMATH Open1183.68603OpenAlexW2006790757MaRDI QIDQ3631392FDOQ3631392

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

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

zbMATH Keywords

concept latticeprime implicatesattribute implicationsHorn conjunctive normal form formula

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

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

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)