scientific article; zbMATH DE number 1354130

zbMath0925.03036MaRDI QIDQ4268444

Dimitris Kavvdias, Christos H. Papadimitriou, Martha Sideris

Publication date: 31 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Hypergraphs (05C65) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)

Related Items

Reasoning with ordered binary decision diagrams ⋮ Generating all maximal models of a Boolean expression ⋮ Horn axiomatizations for sequential data ⋮ Error-free and best-fit extensions of partially defined Boolean functions ⋮ On the Boolean connectivity problem for Horn relations ⋮ On the complexity of enumerating pseudo-intents ⋮ The inverse satisfiability problem ⋮ Bidual Horn functions and extensions ⋮ Inner-core and outer-core functions of partially defined Boolean functions ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ On the difference of Horn theories ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Information loss in knowledge compilation: a comparison of Boolean envelopes ⋮ On the dualization in distributive lattices and related problems ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ Double Horn functions ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ An efficient algorithm for Horn description ⋮ Semantical and computational aspects of Horn approximations ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms ⋮ Ordered binary decision diagrams as knowledge-bases ⋮ Logical analysis of binary data with missing bits ⋮ On functional dependencies in \(q\)-Horn theories