Michael Gelfond (gelfond)
Contributions to Philosophie.ch
No contributions yet
Bibliography
Balduccini, Marcello and Gelfond, Michael. 2003. “Logic Programs with Consistency-Restoring Rules.” in AAAI-03. Working Papers of the 2003 AAAI Spring Symposium on Logical Formalization of Commonsense Reasoning, edited by Patrick Doherty, John McCarthy, and Mary-Anne Williams, pp. 9–18. Menlo Park, California: The AAAI Press.
Balduccini, Marcello, Gelfond, Michael, Nogueira, Monica, Watson, Richard A. and Barry, Matthew R. 2001. “An A-Prolog Decision Support System for the Space Shuttle.” Unpublished manuscript, Texas Tech University.
Baral, Chitta and Gelfond, Michael. 1993. “Representing Concurrent Actions in Extended Logic Programming.” in IJCAI-94. Proceedings of the 13th International Joint Conference on Artificial Intelligence, edited by Ruzena Bajcsy, pp. 866–871. San Francisco, California: Morgan Kaufmann Publishers.
Baral, Chitta and Gelfond, Michael. 1994. “Logic Programming and Knowledge Representation.” Journal of Logic Programming 19–20.
Baral, Chitta and Gelfond, Michael. 1997. “Reasoning about Effects of Concurrent Actions.” Journal of Logic Programming 31: 85–118.
Baral, Chitta and Gelfond, Michael. 2000. “Reasoning Agents in Dynamic Domains.” in Logic-Based Artificial Intelligence, edited by Jack Minker, pp. 257–279. Dordrecht: Kluwer Academic Publishers.
Baral, Chitta, Gelfond, Michael and Provetti, Alessandro. 1995. “Representing Actions I (Laws, Observations and Hypotheses).” in AAAI-95. Working Notes of the AAAI Spring Symposium on Extending Theories of Action: Formal Theories and Applications, edited by Craig Boutilier and Moisés Goldszmidt. Menlo Park, California: The AAAI Press.
Baral, Chitta, Gelfond, Michael and Provetti, Alessandro. 1997. “Representing Actions: Laws, Observations, and Hypotheses.” Journal of Logic Programming 31(1–3).
Gelfond, Michael. 1987. “Autoepistemic Logic and Formalization of Commonsense Reasoning: A Preliminary Report.” in Second International Workshop on Non-Monotonic Reasoning, edited by Michael Reinfrank, Johan de Kleer, and Erik Sandewall, pp. 177–186. Berlin: Springer.
Gelfond, Michael. 1994. “Logic Programming and Reasoning with Incomplete Information.” Annals of Mathematics and Artificial Intelligence 12: 89–116.
Gelfond, Michael. 1998. “Review of Shanahan (1997).” The Journal of Symbolic Logic 63(3): 1186–1188.
Gelfond, Michael, Leone, Nicola and Pfeifer, Gerald, eds. 1999. Logic Programming and Nonmonotonic Reasoning: Proceedings of the 5th International Conference, LPNMR ’99, El Paso, Texas, December 2–4, 1999. Lecture Notes in Artificial Intelligence n. 1730. Berlin: Springer.
Gelfond, Michael and Lifschitz, Vladimir. 1988. “The Stable Model Semantics for Logic Programming.” in Logic Programming: Proceedings of the Fifth International Conference, volume 1, edited by Robert A. Kowalski and Kenneth A. Bowen, pp. 1070–1080. Cambridge, Massachusetts: The MIT Press.
Gelfond, Michael and Lifschitz, Vladimir. 1991. “Classical Negation in Logic Programs and Disjunctive Databases.” New Generation Computing 9: 365–385.
Gelfond, Michael and Lifschitz, Vladimir. 1993. “Representing Action and Change by Logic Programs.” Journal of Logic Programming 17: 301–321.
Gelfond, Michael and Lifschitz, Vladimir. 1998. “Action Languages.” Electronic Transactions on Artificial Intelligence 3.
Gelfond, Michael, Lifschitz, Vladimir, Przymusinska, Halina and Schwartz, Grigori. 1994. “Autoepistemic Logic and Introspective Circumscription.” in TARK 1994. Theoretical Aspects of Reasoning about Knowledge: Proceedings of the Fifth Conference, edited by Ronald Fagin, pp. 197–207. San Francisco, California: Morgan Kaufmann Publishers.
Gelfond, Michael, Lifschitz, Vladimir and Rabinov, Arkady. 1991. “What are the Limitations of the Situation Calculus?” in Automated Reasoning: Essays in Honor of Woody Bledsoe, edited by Robert S. Boyer, pp. 167–179. Dordrecht: Kluwer Academic Publishers.
Gelfond, Michael and Przymusinska, Halina. 1986. “Negation as Failure: Careful Closure Principle.” Artificial Intelligence 30(3): 273–287.
Gelfond, Michael and Przymusinska, Halina. 1989. “Inheritance Reasoning in Autoepistemic Logic.” in Methodologies for Intelligent Systems: Proceedings of the Fourth International Symposium, edited by Zbigniew Raś, pp. 419–429. Amsterdam: North-Holland Publishing Co.
Gelfond, Michael and Przymusinska, Halina. 1990. “Formalization of Inheritance Reasoning in Autoepistemic Logic.” Fundamenta Informaticae 13: 403–443.
Gelfond, Michael and Przymusinska, Halina. 1995. “Reasoning in Open Domains.” in Logic Programming and Nonmonotonic Reasoning, edited by Wictor W. Marek, Anil Nerode, and Marek Truszczyński. Berlin: Springer.
Gelfond, Michael and Przymusinska, Halina. 1996. “Towards a Theory of Elaboration Tolerance: Logic Programming Approach.” Journal on Software and Knowledge Engineering 6(1): 89–112.
Gelfond, Michael, Przymusinska, Halina, Lifschitz, Vladimir and Truszczynski, Miroslaw. 1991. “Disjunctive Defaults.” 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. 230–237. San Francisco, California: Morgan Kaufmann Publishers.
Gelfond, Michael, Przymusinska, Halina and Przymusinski, Teodor C. 1989. “On the Relationship between Circumscription and Negation as Failure.” Artificial Intelligence 38(1): 75–94.