Hypergraph Horn functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 192840 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- scientific article; zbMATH DE number 3018834 (Why is no real title available?)
- A lost mathematician, Takeo Nakasawa. The forgotten father of matroid theory
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- Complexity of identification and dualization of positive Boolean functions
- Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Horn clauses and database dependencies
- On sentences which are true of direct unions of algebras
- On the Abstract Properties of Linear Dependence
- Reasoning with models
- The Complexity of Enumeration and Reliability Problems
- The decision problem for some classes of sentences without quantifiers
- Unification as a complexity measure for logic programming
- Why Horn formulas matter in computer science: initial structures and generic examples
Cited in
(3)
This page was built for publication: Hypergraph Horn functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499011)