Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
Artificial Intelligence
Reasoning about action I: a possible worlds approach
Artificial Intelligence
On generating all maximal independent sets
Information Processing Letters
Updating logical databases
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of identification and dualization of positive Boolean functions
Information and Computation
ACM SIGACT News
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
Journal of Algorithms
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Almost all monotone Boolean functions are polynomially learnable using membership queries
Information Processing Letters
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Decision lists and related Boolean functions
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Information Systems - Special issue: The semantic web and web services
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Minimum implicational basis for ∧-semidistributive lattices
Information Processing Letters
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
About keys of formal context and conformal hypergraph
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Generating positive and negative exact rules using formal concept analysis: problems and solutions
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Parallel computation of the minimal elements of a poset
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Some complexity results about essential closed sets
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
How to apply SAT-solving for the equivalence test of monotone normal forms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Hardness of enumerating pseudo-intents in the lectic order
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Uncovering and reducing hidden combinatorics in guigues-duquenne bases
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
About the family of closure systems preserving non-unit implications in the guigues-duquenne base
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Some notes on managing closure operators
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Computing Implications with Negation from a Formal Context
Fundamenta Informaticae - Concept Lattices and Their Applications
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science. In the present paper, we address this problem and its decisional variant, i.e., the recognition of the transversal hypergraph for another hypergraph. We survey some results on problems which are known to be related to computing the transversal hypergraph, where we focus on problems in propositional Logic and AI. Some of the results have been established already some time ago, and were announced but their derivation was not widely disseminated. We then address recent developments on the computational complexity of computing resp. recognizing the transversal hypergraph. The precise complexity of these problems is not known to date, and is in fact open for more than 20 years now.