Matthew L. Ginsberg (ginsberg-ml)
Contributi a Philosophie.ch
No contributions yet
Bibliography
Baker, Andrew B. and Ginsberg, Matthew L. 1989a. “A Theorem Prover for Prioritized Circumscription.” in IJCAI-89. Proceedings of the 11th International Joint Conference on Artificial Intelligence, edited by N. S. Sridharan, pp. 463–467. San Francisco, California: Morgan Kaufmann Publishers.
Baker, Andrew B. and Ginsberg, Matthew L. 1989b. “Temporal Projection and Explanation.” in IJCAI-89. Proceedings of the 11th International Joint Conference on Artificial Intelligence, edited by N. S. Sridharan, pp. 906–911. San Francisco, California: Morgan Kaufmann Publishers.
Crawford, James M., Ginsberg, Matthew L., Luck, Eugene and Roy, Amitabha. 1996. “Symmetry-Breaking Predicates for Search Problems.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 148–159. San Francisco, California: Morgan Kaufmann Publishers.
Darwiche, Adnan and Ginsberg, Matthew L. 1992. “A Symbolic Generalization of Probability Theory.” in AAAI-92. Proceedings of the Tenth National Conference on Artificial Intelligence, edited by Paul S. Rosenbloom and Peter Szolovits, pp. 622–627. Menlo Park, California: The AAAI Press.
Etherington, David W., Forbus, Kenneth D., Ginsberg, Matthew L., Israel, David J. and Lifschitz, Vladimir. 1989. “Critical Issues in Nonmonotonic Reasoning.” in KR’89: Principles of Knowledge Representation and Reasoning, edited by Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, pp. 500–504. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1984. “Analyzing Incomplete Information.” hpp 84-:-17. Palo Alto, California: Department of Computer Science, Stanford University.
Ginsberg, Matthew L. 1985. “Counterfactuals.” in IJCAI-85. Proceedings of the 9th International Joint Conference on Artificial Intelligence, edited by Arivind K. Joshi, pp. 80–86. San Francisco, California: Morgan Kaufmann Publishers. Reprinted as Ginsberg (1986a).
Ginsberg, Matthew L. 1986a. “Counterfactuals.” Artificial Intelligence 30(1): 35–79.
Ginsberg, Matthew L. 1986b. “Multi-Valued Logics.” in AAAI-86. Proceedings of the Fifth National Conference on Artificial Intelligence, edited by Tom Kehler and Stanley J. Rosenschein, pp. 243–247. Menlo Park, California: The AAAI Press. Reprinted in Ginsberg (1987a, 251–255).
Ginsberg, Matthew L., ed. 1987a. Readings in Nonmonotonic Reasoning. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1987b. “Introduction.” in Readings in Nonmonotonic Reasoning, edited by Matthew L. Ginsberg, pp. 1–23. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1987c. “Possible Worlds Planning.” in Reasoning about Actions and Plans, Proceedings of the 1986 Workshop at Timberline, Oregon, edited by Michael P. Georgeff and Amy L. Lansky, pp. 213–243. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1988. “Multivalued Logics: A Uniform Approach to Reasoning in Artificial Intelligence.” Computational Intelligence 4(3): 265–316.
Ginsberg, Matthew L. 1989. “A Circumscriptive Theorem Prover.” Artificial Intelligence 39(2): 209–230.
Ginsberg, Matthew L. 1990a. “A Local Formalization of Inheritance.” in Proceedings of the 1990 Non-Monotonic Reasoning Workshop. Menlo Park, California: The AAAI Press.
Ginsberg, Matthew L. 1990b. “Bilattices and Modal Operators.” Journal of Logic and Computation 1.
Ginsberg, Matthew L. 1991a. “The Computational Value of Nonmonotonic Reasoning.” 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. 262–268. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1991b. “Computational Considerations in Reasoning about Action.” 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. 250–261. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1993. Essentials of Artificial Intelligence. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1994. “AI and Nonmonotonic Reasoning.” in Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning, edited by Dov M. Gabbay, Christopher J. Hogger, and James A. Robinson, pp. 1–33. Oxford: Oxford University Press.
Ginsberg, Matthew L. 1995. “Approximate Planning.” Artificial Intelligence 76(1–2): 89–123.
Ginsberg, Matthew L. 1996a. “A New Algorithm for Generative Planning.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 186–197. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1996b. “Do Computers Need Common Sense?” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 620–626. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. 1996c. “Partition 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. 228–233. Menlo Park, California: The AAAI Press.
Ginsberg, Matthew L. and Holbrook, Hugh. 1992. “What Defaults Can Do that Hierarchies Can’t.” in Proceedings of the Fourth Workshop on Nonmonotonic Reasoning. Menlo Park, California: The AAAI Press.
Ginsberg, Matthew L. and McAllester, David Allen. 1994. “GSAT and Efficient Backtracking.” in KR’94: Principles of Knowledge Representation and Reasoning, edited by Jon Doyle, Erik Sandewall, and Pietro Torasso, pp. 226–227. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. and Parker, Andrew J. 2000. “Satisfiability Algorithms and Finite Quantification.” in KR’00: Principles of Knowledge Representation and Reasoning, edited by Anthony G. Cohn, Fausto Giunchiglia, and Bart Selman, pp. 690–701. San Francisco, California: Morgan Kaufmann Publishers.
Ginsberg, Matthew L. and Smith, David E. 1987a. “Reasoning about Action I: A Possible Worlds Approach.” in AAAI-87. Proceedings of the 1987 Workshop on the Frame Problem in Artificial Intelligence, edited by Frank Malloy Brown. San Francisco, California: Morgan Kaufmann Publishers. Reprinted as Ginsberg and Smith (1988a).
Ginsberg, Matthew L. and Smith, David E. 1987b. “Reasoning about Action II: The Qualification Problem.” in AAAI-87. Proceedings of the 1987 Workshop on the Frame Problem in Artificial Intelligence, edited by Frank Malloy Brown, pp. 259–287. San Francisco, California: Morgan Kaufmann Publishers. Reprinted as Ginsberg and Smith (1988b).
Ginsberg, Matthew L. and Smith, David E. 1988a. “Reasoning about Action I: A Possible Worlds Approach.” Artificial Intelligence 35(2): 165–195. Reprinted, in revised form, in Ginsberg (1987a, 433–463).
Ginsberg, Matthew L. and Smith, David E. 1988b. “Reasoning about Action II: The Qualification Problem.” Artificial Intelligence 35(3): 311–342.
Jönsson, Ari K. and Ginsberg, Matthew L. 1996. “Procedural Reasoning in Constraint Satisfaction.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 160–171. San Francisco, California: Morgan Kaufmann Publishers.
Reinfrank, Michael, de Kleer, Johan and Ginsberg, Matthew L., eds. 1989. Non-Monotonic Reasoning: 2nd International Workshop, Grassau, June, 1988. Lecture Notes in Artificial Intelligence n. 346. Berlin: Springer.
Smith, David E., Genesereth, Michael R. and Ginsberg, Matthew L. 1986. “Controlling Recursive Inference.” Artificial Intelligence 30(3): 343–389.