Communications of the ACM
Artificial Intelligence
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Making believers out of computers
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Intelligent decision systems
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Asymptomatic conditional probabilities for first-order logic
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Randomised algorithms for counting and generating combinatorial structures
Randomised algorithms for counting and generating combinatorial structures
Monte-Carlo algorithms for enumeration and reliability problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On the computational power of PP and (+)P
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Learning to reason the non monotonic case
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A connectionist framework for reasoning: reasoning with examples
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Monte Carlo inference via greedy importance sampling
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Toward robust real-world inference: a new perspective on explanation-based learning
ECML'06 Proceedings of the 17th European conference on Machine Learning
| Hi-index | 0.01 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...