Tom Bylander (bylander)
Contributions à Philosophie.ch
No contributions yet
Bibliography
Allemang, Dean, Tanner, Michael, Bylander, Tom and Josephson, John R. 1987. “Computational Complexity of Hypothesis Assembly.” in IJCAI-87. Proceedings of the 10th International Joint Conference on Artificial Intelligence, edited by John McDermott, pp. 1112–1117. San Francisco, California: Morgan Kaufmann Publishers.
Bylander, Tom. 1991. “The Monotonic Abduction Problem: A Functional Characterization on the Edge of Tractability.” in KR’91: Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, edited by James F. Allen, Richard E. Fikes, and Erik Sandewall, pp. 70–77. San Francisco, California: Morgan Kaufmann Publishers.
Bylander, Tom. 1994. “The Computational Complexity of Propositional STRIPS Planning.” Artificial Intelligence 69(1–2): 165–204.
Bylander, Tom. 1996. “A Probabilistic Analysis of Propositional STRIPS Planning.” Artificial Intelligence 81(1–2): 241–271.
Bylander, Tom. 1998. “Worst-Case Analysis of the Perceptron and Worst-Case Exponentiated Update Algorithms.” gb 106(2): 335–352.
Bylander, Tom, Allemang, Dean, Tanner, Michael and Josephson, John R. 1989. “Some Results Concerning the Computational Complexity of Abduction.” in KR’89: Principles of Knowledge Representation and Reasoning, edited by Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, pp. 44–54. San Francisco, California: Morgan Kaufmann Publishers.