Strong duality in Horn minimization

DOI10.1007/978-3-662-55751-8_11zbMATH Open1495.68097OpenAlexW2745994242MaRDI QIDQ1679964FDOQ1679964

Authors: Endre Boros, Ondřej Čepek, Kazuhisa Makino 

Publication date: 22 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-662-55751-8_11

Recommendations

• Directed hypergraphs and Horn minimization
• Horn minimization by iterative decomposition
• A decomposition method for CNF minimality proofs
• Horn functions and their DNFs
• Hardness results for approximate pure Horn CNF formulae minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Cited In (5)

• A decomposition method for CNF minimality proofs
• Enumerating Minimally Revised Specifications Using Dualization
• On approximate Horn formula minimization
• Learning a propagation complete formula
• kd-tree based adaptive interpolation algorithm for chemical kinetics problems with interval parameters

This page was built for publication: Strong duality in Horn minimization

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