Daphne Koller
- Erol et al. 1994 Erol, K., Hendler, J., and Nau, D. S. HTN planning: complexity and expressivity, Proceedings of the Twelth National Conference on Artificial Intelligence (AAAI-94), 1994, 1123-1128. Google Scholar
Digital Library
- Fikes and Nilsson 1971 Fikes, R. E., and Nilsson, N. J. STRIPS: a new approach to the application of theorem proving to problem solving, Artificial Intelligence, 2, 3-4, 1971, 189-208.Google ScholarCross Ref
- Nilsson 1995 Nilsson, N. Eye on the prize (artificial intelligence), AI Magazine, 16, 2, 1995, 9-17, http://robotics.stanford.edu/people/nilsson/prize.ps Google ScholarDigital Library
- Pearl 1988 Pearl, J. Probabilistic Reasoning in Intellligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Francisco, California, 1988. Google ScholarDigital Library
- Sacerdoti 1977 Sacerdoti, E. D. A Structure for Plans and Behavior, Elsevier/North-Holland, New York, 1977.Google Scholar
Recommendations
Average-case intractability vs. worst-case intractability
We show that not all sets in NP (or other levels of the polynomial-time hierarchy) have efficient average-case algorithms unless the Arthur-Merlin classes MA and AM can be derandomized to NP and various subclasses of P/poly collapse to P. Furthermore, ...
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are $W[1]$-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when ...
Comments