Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Closure properties of constraints
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Ordered binary decision diagrams as knowledge-bases
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
Learning from imprecise data: possibilistic graphical models
Computational Statistics & Data Analysis - Nonlinear methods and data mining
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
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Operations and evaluation measures for learning possibilistic graphical models
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
An efficient algorithm for Horn description
Information Processing Letters
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Learning Horn Expressions with LOGAN-H
The Journal of Machine Learning Research
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Logical analysis of data --- the vision of Peter L. Hammer
Annals of Mathematics and Artificial Intelligence
Computational Complexity
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The complexity of theory revision
Artificial Intelligence
Logical analysis of binary data with missing bits
Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
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
Fundamental study: The multiple facets of the canonical direct unit implicational basis
Theoretical Computer Science
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Boolean affine approximation with binary decision diagrams
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
Reasoning with characteristic models
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Testing expressibility is hard
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On minimal constraint networks
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Deductive inference for the interiors and exteriors of horn theories
ACM Transactions on Computational Logic (TOCL)
On minimal constraint networks
Artificial Intelligence
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Robust constraint satisfaction and local hidden variables in quantum mechanics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |