An efficient algorithm for Horn description

DOI10.1016/j.ipl.2003.06.001zbMath1178.68641OpenAlexW2041042424MaRDI QIDQ1029007

Bruno Zanuttini, Jean-Jacques Hébrard

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.06.001

zbMATH Keywords

algorithmscombinatorial problemsdescriptionHorn CNF

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (2)

Horn representation of a concept lattice ⋮ MCP: capturing big data by satisfiability (tool description)

Cites Work

• Unnamed Item
• Unnamed Item
• Structure identification in relational data
• Learning conjunctions of Horn clauses
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• The Inverse Satisfiability Problem
• The complexity of satisfiability problems
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: An efficient algorithm for Horn description