Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient parallel algorithms for functional dependency manipulations
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
The complexity of arc-colorings for directed hypergraphs
Discrete Applied Mathematics
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Attribute-incremental construction of the canonical implication basis
Annals of Mathematics and Artificial Intelligence
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Autonomous sets: a method for hypergraph decomposition with applications in database theory
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On software component co-installability
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Structure theorems for optimum hyperpaths in directed hypergraphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hydras: directed hypergraphs and horn formulas
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On software component co-installability
ACM Transactions on Software Engineering and Methodology (TOSEM) - Testing, debugging, and error handling, formal methods, lifecycle concerns, evolution and maintenance
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
On implicational bases of closure systems with unique critical sets
Discrete Applied Mathematics
Hi-index | 0.00 |