On functional dependencies in q-Horn theories
Artificial Intelligence
Horn minimization by iterative decomposition
Annals of Mathematics and Artificial Intelligence
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
An efficient algorithm for Horn description
Information Processing Letters
Pseudo-models and propositional Horn inference
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
A survey on knowledge compilation
AI Communications
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
New Results for Horn Cores and Envelopes of Horn Disjunctions
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Pseudo-models and propositional Horn inference
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
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
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
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
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
| Hi-index | 0.00 |