Horn representation of a concept lattice
From MaRDI portal
Publication:3631392
DOI10.1080/03081070902857878zbMath1183.68603MaRDI QIDQ3631392
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
68T30: Knowledge representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for Horn description
- Horn functions and their DNFs
- Horn approximations of empirical data
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Complexity of generalized satisfiability counting problems
- Generalized domination in closure systems
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Knowledge compilation and theory approximation
- On sentences which are true of direct unions of algebras
- The decision problem for some classes of sentences without quantifiers
- On computing the size of a lattice and related decision problems