Computing intersections of Horn theories for reasoning with models
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On functional dependencies in q-Horn theories
Artificial Intelligence
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Ordered binary decision diagrams as knowledge-bases
Artificial Intelligence
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Disjunctions of Horn Theories and Their Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Ordered Binary Decision Diagrams as Knowledge-Bases
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An efficient algorithm for Horn description
Information Processing Letters
Horn axiomatizations for sequential data
Theoretical Computer Science
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
New Results for Horn Cores and Envelopes of Horn Disjunctions
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
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
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Logical analysis of binary data with missing bits
Artificial Intelligence
On the diffvierence of horn theories
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Deductive inference for the interiors and exteriors of horn theories
ACM Transactions on Computational Logic (TOCL)
Some notes on managing closure operators
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
Hi-index | 0.00 |