Kein Profilbild | No profile picture | Utilisateur n'as pas d'image
https://philosophie.ch/profil/selman-b

Bart Selman (selman-b)

Contributi a Philosophie.ch

No contributions yet

Bibliography

    Cohn, Anthony G., Giunchiglia, Fausto and Selman, Bart, eds. 2000. KR’00: Principles of Knowledge Representation and Reasoning. San Francisco, California: Morgan Kaufmann Publishers.
    Gogic, Goran, Kautz, Henry A., Papadimitriou, Christos H. and Selman, Bart. 1995. The Comparative Linguistics of Knowledge Representation.” in IJCAI-95. Proceedings of the 14th International Joint Conference on Artificial Intelligence, edited by Christopher S. Mellish and C. Raymond Perrault, pp. 862–869. San Francisco, California: Morgan Kaufmann Publishers.
    Gomes, Carla P. and Selman, Bart. 2001. Algorithm Portfolios.” Artificial Intelligence 126(1–2): 43–62.
    Kautz, Henry A., Kearns, Michael J. and Selman, Bart. 1995. Horn Approximations of Empirical Data.” Artificial Intelligence 74(1): 129–145.
    Kautz, Henry A., McAllester, David Allen and Selman, Bart. 1996. Encoding Plans in Propositional Logic.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 374–384. San Francisco, California: Morgan Kaufmann Publishers.
    Kautz, Henry A. and Selman, Bart. 1989. Hard Problems for Simple Default Logics.” in KR’89: Principles of Knowledge Representation and Reasoning, edited by Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, pp. 189–197. San Francisco, California: Morgan Kaufmann Publishers. Published as Kautz and Selman (1991).
    Kautz, Henry A. and Selman, Bart. 1991. Hard Problems for Simple Default Logics.” Artificial Intelligence 49(3): 243–279.
    Kautz, Henry A. and Selman, Bart. 1992. Planning as Satisfiability.” in ECAI-92. Proceedings of the Tenth European Conference on Artificial Intelligence, edited by B. Neumann, pp. 359–379. Hoboken, New Jersey: John Wiley; Sons, Inc.
    Kautz, Henry A. and Selman, Bart. 1996. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search.” in AAAI-96. Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Ninth Innovative Applications of Artificial Intelligence Conference, edited by William J. Clancey and Daniel S. Weld, pp. 1194–1201. Menlo Park, California: The AAAI Press.
    Kautz, Henry A. and Selman, Bart. 1999. Unifying SAT-Based and Graph-Based Planning.” in IJCAI-99. Proceedings of the 16th International Joint Conference on Artificial Intelligence, edited by Thomas L. Dean, pp. 318–325. San Francisco, California: Morgan Kaufmann Publishers.
    Kautz, Henry A. and Selman, Bart. 2000. Encoding Domain Knowledge for Propositional Planning.” in Logic-Based Artificial Intelligence, edited by Jack Minker, pp. 169–186. Dordrecht: Kluwer Academic Publishers.
    Kautz, Henry A., Selman, Bart and Milewski, Al. 1996. Agent Amplified Communication.” in AAAI-96. Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Ninth Innovative Applications of Artificial Intelligence Conference, edited by William J. Clancey and Daniel S. Weld, pp. 1–9. Menlo Park, California: The AAAI Press.
    Mitchell, David G., Selman, Bart and Levesque, Hector J. 1992. Hard and Easy Distributions for SAT Problems.” in AAAI-92. Proceedings of the Tenth National Conference on Artificial Intelligence, edited by Paul S. Rosenbloom and Peter Szolovits, pp. 459–465. Menlo Park, California: The AAAI Press.
    Selman, Bart. 1990a. Tractable Defeasible Reasoning.” PhD dissertation, Toronto: Computer Science Department, University of Toronto.
    Selman, Bart. 1990b. Sketch Map Interpretation: A Complexity Analysis.” Unpublished manuscript, University of Toronto.
    Selman, Bart. 1990c. Computing Explanations.” Presented at AAAI Spring Symposium on Automated Deduction.
    Selman, Bart. 1994. Near-Optimal Plans, Tractability, and Reactivity.” in KR’94: Principles of Knowledge Representation and Reasoning, edited by Jon Doyle, Erik Sandewall, and Pietro Torasso, pp. 521–529. San Francisco, California: Morgan Kaufmann Publishers.
    Selman, Bart. 1995. Stochastic Search and Phase Transitions: AI Meets Physics.” in IJCAI-95. Proceedings of the 14th International Joint Conference on Artificial Intelligence, edited by Christopher S. Mellish and C. Raymond Perrault, pp. 998–1002. San Francisco, California: Morgan Kaufmann Publishers.
    Selman, Bart and Hirst, Graeme. 1987. Parsing as an Energy Minimization Problem.” in Genetic Algorithms and Simulated Annealing, edited by Lawrence D. Davis. San Francisco, California: Morgan Kaufmann Publishers.
    Selman, Bart and Kautz, Henry A. 1989. The Complexity of Model-Preference Default Theories.” in Non-Monotonic Reasoning: 2nd International Workshop, Grassau, June, 1988, edited by Michael Reinfrank, Johan de Kleer, and Matthew L. Ginsberg. Lecture Notes in Artificial Intelligence n. 346. Berlin: Springer.
    Selman, Bart and Kautz, Henry A. 1990. Model-Preference Default Theories.” Artificial Intelligence 45(3): 287–322.
    Selman, Bart and Kautz, Henry A. 1991. Knowledge Compilation Using Horn Clause Approximations.” in AAAI-91. Proceedings of the Ninth National Conference on Artificial Intelligence, edited by Thomas L. Dean and Kathleen R. McKeown, pp. 904–909. Menlo Park, California: The AAAI Press.
    Selman, Bart and Kirkpatrick, Scott. 1996. Critical Behavior in the Computational Cost of Satisfiability Testing.” Artificial Intelligence 81(1–2): 273–295.
    Selman, Bart and Levesque, Hector J. 1989. The Tractability of Path-Based Inheritance.” in IJCAI-89. Proceedings of the 11th International Joint Conference on Artificial Intelligence, edited by N. S. Sridharan, pp. 1140–1145. San Francisco, California: Morgan Kaufmann Publishers.
    Selman, Bart and Levesque, Hector J. 1990. Abductive and Default Reasoning: A Computational Core.” in AAAI-90. Proceedings of the Eighth National Conference on Artificial Intelligence, edited by Thomas G. Dietterich and William R. Swartout, pp. 343–348. Menlo Park, California: The AAAI Press.
    Selman, Bart and Levesque, Hector J. 1993. The Complexity of Path-Based Defeasible Inheritance.” Artificial Intelligence 62(2): 303–339.
    Selman, Bart and Levesque, Hector J. 1996. Support Set Selection for Abductive and Default Reasoning.” Artificial Intelligence 82(1–2): 259–272.
    Selman, Bart, Levesque, Hector J. and Mitchell, David G. 1992. A New Method for Solving Hard Satisfiability Problems.” in AAAI-92. Proceedings of the Tenth National Conference on Artificial Intelligence, edited by Paul S. Rosenbloom and Peter Szolovits, pp. 440–446. Menlo Park, California: The AAAI Press.
    Selman, Bart, Mitchell, David G. and Levesque, Hector J. 1996. Generating Hard Satisfiability Problems.” Artificial Intelligence 81(1–2): 17–29.