Directed hypergraphs and Horn minimization
From MaRDI portal
Publication:2404615
DOI10.1016/j.ipl.2017.07.013zbMath1420.68154OpenAlexW2744562989MaRDI QIDQ2404615
Kristóf Bérczi, Erika R. Bérczi-Kovács
Publication date: 19 September 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.07.013
Hypergraphs (05C65) Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85) Boolean functions (06E30)
Cites Work
- Unnamed Item
- Unnamed Item
- On implicational bases of closure systems with unique critical sets.
- Linear connectivity problems in directed hypergraphs
- Directed hypergraphs and applications
- Bidual Horn functions and extensions
- Polynomial certificates for propositional classes
- Query Learning and Certificates in Lattices
- On Approximate Horn Formula Minimization
- Canonical Horn Representations and Query Learning
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimal Representation of Directed Hypergraphs
- Minimum Covers in Relational Database Model
This page was built for publication: Directed hypergraphs and Horn minimization