BIBLIOGRAPHY
[2] Special issue on knowledge representation and logic programming. Artificial Intelligence, 138(1-2), June 2002.
[4] Special issue on Dempster-Shafer theory, methodology, and applications. International Journal of Approximate Reasoning, 31(1–2), 2002.
[5] Dimitris Achlioptas. Lower bounds for random 3-SAT via differential equations. Theoretical Computer Science, 265(1–2):159–185, 2001.
[6] Sheldon B. Akers, Jr. Binary decision diagrams. IEEE Transactions on Computers, C-27(6):509–516, 1978.
[7] Carlos E. Alchourrón and David Makinson. The logic of theory change: Contraction functions and their associated revision functions. Theoria, 48:14–37, 1982.
[8] Carlos E. Alchourrón and David Makinson. On the logic of theory change: Safe contraction. Studia Logica, 44:405–422, 1985.
[9] Carlos E. Alchourrón and David Makinson. Maps between some different kinds of contraction function: The finite case. Studia Logica, 45:187–198, 1986.
[10] Carlos E. Alchourrón, Peter Gärdenfors, and David Makinson. On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic, 50(2):510–530, 1985.
[11] Dean Allemang, Michael Tanner, Thomas Bylander, and John Josephson. Computational complexity of hypothesis assembly. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Milan, Italy, pages 1112–1117. Morgan Kaufmann, San Mateo, CA, 1987.
[12] James Allen, James Hendler, and Austin Tate, editors. Readings in Planning. Morgan Kaufmann, San Mateo, CA, 1990.
[14] Krystof R. Apt and Maarten H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841–862, 1982.
[15] Giuseppe Attardi, Mauro Gaspari, and Pietro Iglio. Efficient compilation of first order predicates. In Proceedings of the Tenth European Conference on Artificial Intelligence, Vienna, Austria, pages 440–444. John Wiley & Sons, Chichester, 1992.
[17] Franz Baader, Martin Buchheit, and Bernhard Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1–2):195–213, 1996.
[18] Franz Baader, Diego Calvanese, Deborah McGuinness, Daniele Nardi, and Peter Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge, England, 2003.
[20] Fahiem Bacchus and Froduald Kabanza. Planning for temporally extended goals. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, OR, pages 1215–1222. AAAI Press, Menlo Park, CA, 1996.
[21] Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1–2):123–191, 2000.
[22] Andrew B. Baker. A simple solution to the Yale Shooting Problem. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, pages 11–20. Morgan Kaufmann, Los Altos, CA, 1989.
[23] Andrew B. Baker. Nonmonotonic reasoning in the framework of the situation calculus. Artificial Intelligence, 49(1–3):5–23, 1991.
[24] Chitta Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, England, 2003.
[25] Thomas Bayes. An essay towards solving a problem in the doctrine of chances. Phil. Trans. Royal Society, pages 370–418, 1763. Reprinted in Biometrika 45:293–313, 1958.
[26] John L. Bell and Moshe Machover. A Course in Mathematical Logic. North-Holland, Amsterdam, 1977.
[27] Tim Berners-Lee, James Hendler, and Ora Lassila. The semantic web. Scientific American, 284(5):34–43, 2001.
[28] Philippe Besnard. An Introduction to Default Logic. Springer-Verlag New York, Secaucus, NJ, 1990.
[30] Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1–2):279–298, 1997.
[31] Daniel G. Bobrow and Alan M. Collins, editors. Representation and Understanding: Studies in Cognitive Science. Academic Press, New York, 1975.
[32] Daniel G. Bobrow and Terry Winograd. An overview of KRL, a knowledge representation language. Cognitive Science, 1(1):3–46, 1977. Reprinted in [47].
[33] Margaret A. Boden, editor. The Philosophy of Artificial Intelligence. Oxford Readings in Philosophy, Oxford University Press, Oxford, 1990.
[34] George Boolos, John P. Burgess, and Richard C. Jeffrey. Computability and Logic, 4th edition. Cambridge University Press, Cambridge, England, 2002.
[35] Alex Borgida and David W. Etherington. Hierarchical knowledge bases and efficient disjunctive reasoning. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, pages 33–43. Morgan Kaufmann, San Mateo, CA, 1989.
[36] Alexander Borgida, Ronald J. Brachman, Deborah L. McGuinness, and Lori Alperin Resnick. CLASSIC: A structural data model for objects. SIGMOD Record, 18(2):58–67, 1989.
[37] Craig Boutilier. A unified view of qualitative belief change: A dynamical systems perspective. Artificial Intelligence, 98(1–2):281–316, 1998.
[38] Craig Boutilier, Raymond Reiter, Mikhail Soutchanski, and Sebastian Thrun. Decision-theoretic, high-level agent programming in the situation calculus. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, TX, pages 355–362. AAAI Press, Menlo Park, CA, 2000.
[39] Robert S. Boyer and J Strother Moore. A Computational Logic Handbook, 2nd edition. Academic Press, London, 1998.
[40] Ronald J. Brachman. What's in a concept: Structural foundations for semantic networks. International Journal of Man-Machine Studies, 9:127–152, 1977.
[41] Ronald J. Brachman. Structured inheritance networks. In William A. Woods and Ronald J. Brachman, editors, Research in Natural Language Understanding, Quarterly Progress Report No. 1, BBN Report No. 3742, pages 36–78. Bolt, Beranek and Newman, Cambridge, MA, 1978.
[42] Ronald J. Brachman. On the epistemological status of semantic networks. In Nicholas V. Findler, editor, Associative Networks: Representation and Use of Knowledge by Computers, pages 3–50. Academic Press, New York, 1979. Reprinted in [47].
[43] Ronald J. Brachman. What IS-A is and isn't: An analysis of taxonomic links in semantic networks. IEEE Computer, 16(10):30–36, 1983.
[44] Ronald J. Brachman. Viewing databases through a knowledge representation lens. In Kazuhiro Fuchi and Toshio Yokoi, editors, Knowledge Building and Knowledge Sharing, Proc. KB&KS ’93 Conference, Tokyo, pages 121–124. Ohmsha, Tokyo, 1994.
[45] Ronald J. Brachman and Hector J. Levesque. Competence in knowledge representation. In Proceedings of the Second National Conference on Artificial Intelligence, Pittsburgh, pages 189–192. AAAI, Menlo Park, CA, 1982.
[46] Ronald J. Brachman and Hector J. Levesque. The tractability of subsumption in frame-based description languages. In Proceedings of the Fourth National Conference on Artificial Intelligence (AAAI-84), Austin, TX, pages 34–37. William Kaufmann, Los Altos, CA, 1984.
[47] Ronald J. Brachman and Hector J. Levesque, editors. Readings in Knowledge Representation. Morgan Kaufmann, San Francisco, 1985.
[48] Ronald J. Brachman and Hector J. Levesque. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3:78–93, 1987.
[49] Ronald J. Brachman and James G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, 1985.
[50] Ronald J. Brachman and Brian C. Smith. SIGART Newsletter, Special Issue on Knowledge Representation, No. 70. ACM, New York, 1980.
[51] Ronald J. Brachman, Richard E. Fikes, and Hector J. Levesque. KRYPTON: A functional approach to knowledge representation. IEEE Computer, 16(10):67–73, 1983.
[52] Ronald J. Brachman, Victoria P. Gilbert, and Hector J. Levesque. An essential hybrid reasoning system: Knowledge and symbol level accounts of KRYPTON. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, pages 532–539. Morgan Kaufmann, Los Altos, CA, 1985.
[53] Ronald J. Brachman, Deborah L. McGuinness, Peter F. Patel-Schneider, and Alex Borgida. "Reducing" CLASSIC to practice: Knowledge representation theory meets reality. Artificial Intelligence, 114(1–2):203–250, 1999.
[54] Ivan Bratko. PROLOG Programming for Artificial Intelligence, 3rd edition. Addison-Wesley, New York, 2000.
[55] Gerhard Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pages 1043–1048. Morgan Kaufmann, San Mateo, CA, 1989.
[56] Gerhard Brewka. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge, England, 1991.
[57] Gerhard Brewka, Jürgen Dix, and Kurt Konolige. Nonmonotonic Reasoning: An Overview. CSLI, Stanford, CA, 1997.
[58] Rodney A. Brooks. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation, 2:14–23, 1986.
[59] Lee Brownston, Robert Farrell, Elaine Kant, and Nancy Martin. Programming Expert Systems in OPS5: An Introduction to Rule-Based Programming. Addison-Wesley, Reading, MA, 1985. Reprinted with corrections, January 1986.
[60] Bruce G. Buchanan, Georgia L. Sutherland, and Edward A. Feigenbaum. Heuristic DENDRAL: A program for generating explanatory hypotheses in organic chemistry. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 4, pages 209–254. Edinburgh University Press, Edinburgh, 1969.
[61] J. Richard Büchi. Turing machines and the Entscheidungsproblem. Mathematische Annalen, 148:201–213, 1962.
[62] Wolfram Burgard, Armin B. Cremers, Dieter Fox, Dirk Hahnel, Gerhard Lakemeyer, Dirk Schulz, Walter Steiner, and Sebastian Thrun. Experiences with an interactive museum tour-guide robot. Artificial Intelligence, 114(1–2):3–55, 1999.
[63] Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1–2):165–204, 1994.
[64] Tom Bylander, Dean Allemang, Michael C. Tanner, and John R. Josephson. The computational complexity of abduction. Artificial Intelligence, 49(1–3):25–60, 1991.
[65] Marco Cadoli, Francesco M. Donini, and Marco Schaerf. Is intractability of nonmonotonic reasoning a real drawback? Artificial Intelligence, 88(1–2):215–251, 1996.
[66] Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
[67] Eugene Charniak. Motivation analysis, abductive unification, and nonmonotonic equality. Artificial Intelligence, 34(3):275–295, 1987.
[69] Eugene Charniak and Solomon E. Shimony. Probabilistic semantics for cost-based abduction. In Proceedings of the Eighth National Conference on Artificial Intelligence, Boston, pages 106–111. AAAI Press, Menlo Park, CA, 1990.
[70] Keith L. Clark. Negation as failure. In Hervé Gallaire and Jack Minker, editors, Logic and Databases, pages 293–322. Plenum Press, New York, 1987.
[71] Peter Clark and Bruce W. Porter. Building concept representations from reusable components. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, Providence, RI, pages 369–376. AAAI Press, Menlo Park, CA, 1997.
[72] Peter Clark and Bruce W. Porter. Using access paths to guide inference with conceptual graphs. In Dickson Lukose, Harry Delugach, Mary Keeler, Leroy Searle, and John Sowa, editors. Conceptual Structures: Fulfilling Peirce's Dream, Proceedings of the Fifth International Conference on Conceptual Structures, pages 521–535. Lecture Notes in Artificial Intelligence, Vol. 1257. Springer-Verlag, Berlin, 1997.
[73] William F. Clocksin and Christopher S. Mellish. Programming in PROLOG, 3rd revised and extended edition. Springer-Verlag, Berlin, 1987.
[74] Jacques Cohen. A view of the origins and development of PROLOG. Communications of the ACM, 31:26–36, 1988.
[75] Alain Colmerauer, Henry Kanoui, Robert Pasero, and Philippe Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe de Recherche en Intelligence Artificielle, Université Aix-Marseille II, 1973.
[76] Paul Compton and Bob Jansen. A philosophical basis for knowledge acquisition. Knowledge Acquisition, 2(3):241–257, 1990.
[77] Luca Console and Pietro Torasso. A spectrum of logical definitions of model-based diagnosis. Computational Intelligence, 7:133–141, 1991.
[78] Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, Shaker Heights, OH, pages 151–158. Association for Computing Machinery, New York, 1971.
[79] Gregory F. Cooper. Probabilistic inference using belief networks is NP-hard. Artificial Intelligence, 42(2–3):393–405, 1990.
[80] Michael A. Covington, Donald Nute, and André Vellino. PROLOG Programming in Depth. Prentice Hall, Upper Saddle River, NJ, 1997.
[81] Philip T. Cox and Tomasz Pietrzykowski. Causes for events: Their computation and applications. In Proceedings of the Eighth Conference on Automated Deduction, Oxford, pages 608–621. Springer, Berlin, 1986.
[82] Paul Dagum and Michael Luby. Approximating probabilistic reasoning in Bayesian belief networks is NP-hard. Artificial Intelligence, 60(1):141–153, 1993.
[83] Evgeny Dantsin, Andreas Goerdt, Edward Hirsch, Ravi Kannan, Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan, and Uwe Schöning. A deterministic (2 - 2/(k + 1))n algorithm for k-sat based on local search. Theoretical Computer Science, 289(1):69–83, 2002.
[84] Adnan Darwiche and Pierre Marquis. A knowledge compilation map. Journal of Artificial Intelligence Research, 17:229–264, 2002.
[85] John Davies, Dieter Fensel, and Frank van Harmelen, editors. On-To-Knowledge: Content-Driven Knowledge-Management through Evolving Ontologies. John Wiley & Sons, New York, 2002.
[87] Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394–397, 1962.
[88] Randall Davis and Walter Hamscher. Model-based reasoning: Troubleshooting. In Howard E. Shrobe, editor, Exploring Artificial Intelligence, pages 297–346. Morgan Kaufmann, San Mateo, CA, 1988.
[89] Randall Davis, Howard Shrobe, and Peter Szolovits. What is a knowledge representation? AI Magazine, 14(1):17–33, 1993.
[90] Bruno de Finetti. Probability, Induction and Statistics: The Art of Guessing. John Wiley & Sons, New York, 1972.
[91] Bruno de Finetti. Theory of Probability: A Critical Introductory Treatment. John Wiley & Sons, New York, 1974.
[92] Giuseppe De Giacomo, Yves Lespérance, and Hector J. Levesque. ConGolog, a concurrent programming language based on the situation calculus. Artificial Intelligence, 121(1–2):109–169, 2000.
[93] Giuseppe De Giacomo, Yves Lespérance, Hector J. Levesque, and Sebastian Sardiña. On the semantics of deliberation in IndiGolog—from theory to implementation. In Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning, Toulouse, France, pages 603–614. Morgan Kaufmann, San Francisco, 2002.
[94] Johan de Kleer and Brian C. Williams. Diagnosing multiple faults. Artificial Intelligence, 32(1):97–130, 1987.
[95] Johan de Kleer and Brian C. Williams. Diagnosis with behavioral modes. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pages 1324–1330. Morgan Kaufmann, San Mateo, CA, 1989.
[96] Johan de Kleer, Jon Doyle, Charles Rich, Guy L. Steele, and Gerald J. Sussman. AMORD: A deductive procedure system. AI Memo 435, MIT, January, 1978.
[97] Thomas L. Dean and Michael P. Wellman. Planning and Control. Morgan Kaufmann, San Mateo, CA, 1991.
[98] Thomas Dean, James Allen, and John Aloimonos. Artificial Intelligence: Theory and Practice. Addison-Wesley, Menlo Park, CA, 1995.
[100] James P. Delgrande. A framework for logics of explicit belief. Computational Intelligence, 11(1):47–88, 1995.
[101] Arthur P. Dempster. A generalization of Bayesian inference. Journal of the Royal Statistical Society, 39:205–247, 1968.
[103] Zoltan Dienes and Josef Perner. A theory of implicit and explicit knowledge. Behavioral and Brain Sciences, 22:735–755, 1999.
[104] Simon Edmund Dixon. Belief Revision: A Computational Approach. Ph.D. thesis, Basser Department of Computer Science, University of Sydney, Australia, 1994.
[105] Simon Edmund Dixon and Wayne Wobcke. The implementation of a first-order logic AGM belief revision system. In Proceedings of the Fifth IEEE International Conference on Tools with Artificial Intelligence, Boston, pages 40–47. IEEE, Los Alamitos, CA, 1993.
[106] Patrick Doherty and Jonas Kvarnström. TALplanner: A temporal logic based planner. AI Magazine, 22(1):95–102, 2001.
[107] Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt. Tractable concept languages. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, Sydney, Australia, pages 458–465. Morgan Kaufmann, San Mateo, CA, 1991.
[108] Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Werner Nutt. The complexity of concept languages. In Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, Cambridge, MA, pages 151–162. Morgan Kaufmann, Los Altos, CA, 1991.
[109] Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Andrea Schaerf. Reasoning in description logics. In Gerhard Brewka, editor, Principles of Knowledge Representation, pages 191–236. CSLI, Stanford, CA, 1996.
[110] William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3):267–284, 1984.
[112] Jon Doyle. Reason maintenance and belief revision: Foundations versus coherence theories. In Peter Gärdenfors, editor, Belief Revision, pages 29–51. Cambridge University Press, Cambridge, England, 1992.
[113] Hubert Dreyfus. What Computers Still Can't Do: A Critique of Artificial Reason. MIT Press, Cambridge, MA, 1992.
[114] Didier Dubois, Henri Prade, and Ronald R. Yager, editors. Readings in Fuzzy Sets for Intelligent Systems. Morgan Kaufmann, San Mateo, CA, 1993.
[115] Richard Duda, John Gaschnig, and Peter Hart. Model design in the Prospector consultant system for mineral exploration. In Donald Michie, editor, Expert Systems in the Microelectronic Age. Edinburgh University Press, Edinburgh, 1979. Reprinted in Bonnie L. Webber and Nils J. Nilsson, editors, Readings in Artificial Intelligence, pages 334–348. Tioga, Los Altos, CA, 1981.
[116] Frank Dylla, Alexander Ferrein, and Gerhard Lakemeyer. Acting and deliberating using GOLOG in robotic soccer: A hybrid architecture. In Proceedings of the Third International Cognitive Robotics Workshop, Edmonton, Alberta, pages 29–36. AAAI Press, Menlo Park, CA, 2002.
[117] Umberto Eco and Thomas A. Sebeok, editors. The Sign of Three — Dupin, Holmes, Peirce. Indiana University Press, Bloomington, 1988.
[120] Kave Eshghi and Robert A. Kowalski. Abduction compared with negation by failure. In Proceedings of the Sixth International Conference on Logic Programming, Lisbon, Portugal, pages 234–254. MIT Press, Cambridge, MA, 1989.
[121] John Etchemendy. The Concept of Logical Consequence. Harvard University Press, Cambridge, MA, 1990.
[122] David W. Etherington and Raymond Reiter. On inheritance hierarchies with exceptions. In Proceedings of the Third National Conference on Artificial Intelligence (AAAI-83), Washington, DC, pages 104–108. William Kaufmann, Los Altos, CA, 1983. Reprinted in [47].
[123] Ronald Fagin and Joseph Y. Halpern. Belief, awareness and limited reasoning. Artificial Intelligence, 34(1):39–76, 1987.
[124] Scott E. Fahlman. NETL: A System for Representing and Using Real-World Knowledge. MIT Press, Cambridge, MA, 1979.
[125] Kuang T. Fann. Peirce's Theory of Abduction. Martinus Nijhoff, The Hague, The Netherlands, 1970.
[126] Dieter Fensel, Ian Horrocks, Frank van Harmelen, Stefan Decker, Michael Erdmann, and Michel C. A. Klein. OIL in a nutshell. In Rose Dieng and Olivier Corby, editors, Knowledge Engineering and Knowledge Management Methods, Models, and Tools: Twelfth International Conference, EKAW 2000, pages 1–16. Lecture Notes in Computer Science, Vol. 1937. Springer-Verlag, Heidelberg, 2000.
[127] Richard E. Fikes and Tom Kehler. The role of frame-based representation in reasoning. Communications of the ACM, 28(9):904–920, 1985.
[128] Richard E. Fikes and Nils J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3–4):189–208, 1971.
[129] Richard E. Fikes and Nils J. Nilsson. STRIPS, a retrospective. Artificial Intelligence, 59(1–2):227–232, 1993.
[130] Nicholas V. Findler, editor. Associative Networks: Representation and Use of Knowledge by Computer. Academic Press, New York, 1979.
[131] J. Jeffrey Finger. Exploiting Constraints in Design Synthesis. Ph.D. thesis, Stanford University, 1987.
[132] Melvin Fitting. First-Order Logic and Automated Theorem Proving, 2nd edition. Springer-Verlag, New York, 1996.
[133] Kenneth D. Forbus and Johan de Kleer. Building Problem Solvers. MIT Press, Cambridge, MA, 1993.
[134] Charles L. Forgy. Rete: A fast algorithm for the many patterns/many objects match problem. Artificial Intelligence, 19(1):17–37, 1982.
[135] Gottlob Frege. Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. Halle, Berlin, 1879. English translation in Jean van Heijenoort, editor, From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931, pages 1–82. Harvard University Press, Cambridge, MA, 1967.
[136] Nir Friedman and Joseph Y. Halpern. A knowledge-based framework for belief change, Part II: Revision and update. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, Bonn, Germany, pages 190–201. Morgan Kaufmann, San Francisco, 1994.
[137] John D. Funge. AI for Games and Animation: A Cognitive Modeling Approach. A. K. Peters, Natick, MA, 1999.
[138] Dov M. Gabbay and Franz Guenthner, editors. Handbook of Philosophical Logic, 2nd edition. 9 volumes (18 volumes expected). Kluwer, Dordrecht, The Netherlands, 2001–2002.
[139] Dov M. Gabbay, Christopher John Hogger, and John Alan Robinson, editors. Handbook of Logic in Artificial Intelligence and Logic Programming: Vols. I-V. Oxford University Press, Oxford, 1993–1998.
[140] Hervé Gallaire, Jack Minker, and Jean-Marie Nicolas. Logic and databases: A deductive approach. ACM Computing Surveys, 16(2):153–185, 1985.
[141] Peter Gärdenfors. Knowledge in Flux: Modeling the Dynamics of Epistemic States. Bradford Books, MIT Press, Cambridge, MA, 1988.
[142] Peter Gärdenfors. The dynamics of belief systems: Foundations vs. coherence theories. Revue Internationale de Philosophie, 44:24–46, 1990.
[143] Peter Gärdenfors and David Makinson. Revisions of knowledge systems using epistemic entrenchment. In Proceedings of the Second Conference on Theoretical Aspect of Reasoning about Knowledge, Pacific Grove, CA, pages 83–96. Morgan Kaufmann, San Mateo, CA, 1988.
[144] Peter Gärdenfors and Hans Rott. Belief revision. In Dov M. Gabbay, Christopher John Hogger, and John Alan Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. IV: Epistemic and Temporal Reasoning, pages 35–132. Oxford University Press, Oxford, 1995.
[145] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, 2nd printing with update edition. W. H. Freeman, San Francisco, 1980.
[146] Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
[147] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3–4):365–385, 1991.
[148] Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3(16):193–210, 1998.
[149] Michael Gelfond, Vladimir Lifschitz, and Arkady Rabinov. What are the limitations of the situation calculus? In Robert S. Boyer, editor, Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 167–179. Kluwer, Dordrecht, The Netherlands, 1991.
[150] Michael R. Genesereth. The use of design descriptions in automated diagnosis. Artificial Intelligence, 24(1–3):411–436, 1984.
[151] Michael R. Genesereth. Knowledge Interchange Format. In Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, Cambridge, MA, pages 599–600. Morgan Kaufmann, Los Altos, CA, 1991.
[152] Michael R. Genesereth and Richard E. Fikes. Knowledge Interchange Format, version 3.0 reference manual. Technical Report Logic-92–1, Stanford University, Stanford, CA, 1992.
[153] Michael R. Genesereth and Nils J. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos, CA, 1987.
[154] Gerhard Gentzen. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39:176–210, 405–431, 1934. Translated as Investigations into logical deduction, in M. E. Szabo, editor and translator, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland, Amsterdam, 1969.
[156] Edmund L. Gettier. Is justified true belief knowledge? Analysis, 23:121–123, 1963. Reprinted in [168].
[157] Matthew L. Ginsberg, editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann, Los Altos, CA, 1987.
[158] Matthew L. Ginsberg. Universal planning: An (almost) universally bad idea. AI Magazine, 10(4):40–44, 1989.
[159] Matthew L. Ginsberg. Knowledge interchange format: The KIF of death. AI Magazine, 12(3):57–63, 1991.
[160] Matthew L. Ginsberg. Essentials of Artificial Intelligence. Morgan Kaufmann, San Francisco, 1993.
[161] Kurt Gödel. über die Vollständigkeit des Logikkalküls. Ph.D. thesis, University of Vienna, 1930.
[162] Kurt Gödel. über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173–198, 1931.
[163] Kurt Gödel. On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Basic Books, New York, 1962. Translated by Bernard Meltzer. Reprinted by Dover, New York, 1992. Original appears in [162].
[164] Nikos Gorogiannis and Mark D. Ryan. Implementation of belief change operators using BDDs. Studia Logica, 70(1):131–156, 2002.
[165] Janice I. Glasgow, editor. Taking issue forum on imagery and AI. Computational Intelligence, 9(4):309–333, 1993.
[166] Cordell Green. Applications of theorem proving to problem solving. In Proceedings of the First International Joint Conference on Artificial Intelligence, Washington, DC, pages 219–239. Morgan Kaufmann, Los Altos, CA, 1969.
[167] Cordell Green. Theorem-proving by resolution as a basis for question-answering systems. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 4, pages 183–205. Edinburgh University Press, Edinburgh, 1969.
[169] Henrik Grosskreutz and Gerhard Lakemeyer. Turning high-level plans into robot programs in uncertain domains. In Proceedings of the Fourteenth European Conference on Artificial Intelligence, Berlin, pages 548–552. IOS Press, Amsterdam, 2000.
[170] Adam Grove. Two modellings for theory change. Journal of Philosophical Logic, 17:157–170, 1988.
[171] Thomas Gruber. Toward principles for the design of ontologies used for knowledge sharing. International Journal of Human-Computer Studies, 43(5–6):907–928, 1995.
[173] Susan Haack. Do we need fuzzy logic? International Journal of Man-Machine Studies, 11:437–445, 1979. Reprinted in [174].
[174] Susan Haack. Deviant Logic, Fuzzy Logic: Beyond the Formalism. University of Chicago Press, Chicago, 1996. Revised edition of Deviant Logic, Cambridge University Press, Cambridge, England, 1974.
[175] Andrew R. Haas. The case for domain-specific frame axioms. In Proceedings of the 1987 Workshop on the Frame Problem in Artificial Intelligence, pages 343–348. Morgan Kaufmann, Los Altos, CA, 1987.
[176] Armin Haken. The intractability of Resolution. Theoretical Computer Science, 39:297–308, 1985.
[178] Walter Hamscher, Luca Console, and Johan de Kleer, editors. Readings in Model-Based Diagnosis. Morgan Kaufmann, San Mateo, CA, 1992.
[179] Sven Ove Hansson. A Textbook of Belief Dynamics: Theory Change and Database Updating. Kluwer, Dordrecht, The Netherlands, 1999.
[181] Patrick J. Hayes. In defense of logic. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, pages 559–565. Morgan Kaufmann, Los Altos, CA, 1977. Reprinted in [47].
[182] Patrick J. Hayes. The logic of frames. In Dieter Metzing, editor, Frame Conceptions and Text Understanding, pages 46–61. Walter de Gruyter, Berlin, 1979.
[183] Frederick Hayes-Roth, Donald A. Waterman, and Douglas B. Lenat, editors. Building Expert Systems. Addison-Wesley, Reading, MA, 1983.
[184] Carl G. Hempel and Paul Oppenheim. Studies in the logic of explanation. Philosophy of Science, 15:135–175, 1965.
[185] James Hendler and Deborah L. McGuinness. The DARPA agent markup language. IEEE Intelligent Systems, 15(6):67–73, 2000.
[186] Carl Hewitt. PLANNER: A language for proving theorems in robots. In Proceedings of the First International Joint Conference on Artificial Intelligence, Washington, DC, pages 295–301. Morgan Kaufmann, Los Altos, CA, 1969.
[189] Steffen Hölldobler and Josef Schneeberger. A new deductive approach to planning. New Generation Computing, 8(3):225–244, 1990.
[190] Alfred Horn. On sentences which are true of direct unions of algebras. Journal of Symbolic Logic, 16:14–21, 1951.
[191] Ian Horrocks and Peter F. Patel-Schneider. Reducing OWL entailment to description logic satisfiability. In Proceedings of International Semantic Web Conference (ISWC2003), pages 17–29, Sundial Resort, Florida, October 2003. Lecture Notes in Computer Science, Vol. 2870. Springer-Verlag, Heidelberg, 2003.
[192] Ronald A. Howard and James E. Matheson. Influence diagrams. In Ronald A. Howard and James E. Matheson, editors, Readings on the Principles and Applications of Decision Analysis, Vol. 2, pages 721–762. Strategic Decisions Group, Menlo Park, CA, 1984.
[193] Michael N. Huhns and Munindar Singh, editors. Readings in Agents. Morgan Kaufmann, San Francisco, 1997.
[194] Michael Huth and Mark D. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge, England, 2000.
[195] David J. Israel. The role of logic in knowledge representation. IEEE Computer, 16(10):37–42, 1983.
[197] Peter Jackson. Computing prime implicates incrementally. In Proceedings of the Eleventh Conference on Automated Deduction, Saratoga Springs, New York, pages 253–267. Lecture Notes in Artificial Intelligence, Vol. 607. Springer-Verlag, Heidelberg, 1992.
[198] Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111–119. Association for Computing Machinery, New York, 1987.
[199] Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339–395, 1992.
[200] Edwin T. Jaynes. Probability Theory: The Logic of Science. Cambridge University Press, Cambridge, England, 2003.
[202] Richard Jeffrey. Probability and the Art of Judgment. Cambridge Studies in Probability, Induction, and Decision Theory. Cambridge University Press, Cambridge, England, 1992.
[203] Finn V. Jensen. An Introduction to Bayesian Networks. University College London Press, London, 1996.
[205] John R. Josephson and Susan G. Josephson, editors. Abductive Inference: Computation, Philosophy, Technology. Cambridge University Press, Cambridge, England, 1994.
[206] Antonis C. Kakas and Paolo Mancarella. Database updates through abduction. In Proceedings of the Sixteenth Conference on Very Large Databases, Brisbane, Australia, pages 650–661. Morgan Kaufmann, San Mateo, CA, 1990.
[207] Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive logic programming. Journal of Logic and Computation, 2(6):719–770, 1993.
[208] Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. The role of abduction in logic programming. In Dov M. Gabbay, editor, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, pages 235–324. Oxford University Press, Oxford, 1995. An updated version of [207].
[209] Byeong H. Kang, Paul Compton, and Phillip Preston. Multiple classification ripple down rules: Evaluation and possibilities. In Proceedings of the Ninth Knowledge Acquisition for Knowledge Based Systems Workshop, Banff, Alberta, Canada, pages 17.1–17.20. 1995.
[210] G. Neelakantan Kartha. Two counterexamples related to Baker's approach to the frame problem. Artificial Intelligence, 69(1–2):379–391, 1994.
[211] G. Neelakantan Kartha and Vladimir Lifschitz. A simple formalization of actions using circumscription. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pages 1970–1977. Morgan Kaufmann, San Mateo, CA, 1995.
[212] Hirofumi Katsuno and Alberto O. Mendelzon. On the difference between updating a knowledge base and revising it. In Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, Cambridge, MA, pages 387–394. Morgan Kaufmann, Los Altos, CA, 1991.
[213] Hirofumi Katsuno and Alberto O. Mendelzon. On the difference between updating a knowledge base and revising it. In Peter Gärdenfors, editor, Belief Revision, pages 183–203. Cambridge University Press, Cambridge, England, 1992. This paper extends [212].
[214] Henry Kautz and Bart Selman. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence, Vienna, Austria, pages 359–363. John Wiley & Sons, Chichester, 1992.
[215] Henry Kautz and Bart Selman. An empirical evaluation of knowledge compilation by theory approximation. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, pages 155–161. AAAI Press, Menlo Park, CA, 1994.
[216] Alex Kean. A formal characterisation of a domain independent abductive reasoning system. Technical Report HKUST-CS93–4, Department of Computer Science, Hong Kong University of Science and Technology, March 1993.
[217] Alex Kean and George Tsiknis. An incremental method for generating prime implicants/implicates. Journal of Symbolic Computation, 9(2):185–206, 1990.
[218] William Calvert Kneale and Martha Kneale. The Development of Logic. Clarendon Press, Oxford, 1964.
[219] Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In John Leech, editor, Computational Problems in Abstract Algebra, pages 263–267. Pergamon Press, Oxford, 1970.
[220] Teuvo Kohonen. Self-Organization and Associative Memory, 3rd edition. Springer-Verlag, Berlin, 1989.
[222] Kurt Konolige. On the relation between default logic and autoepistemic logic. Artificial Intelligence, 35(3):343–382, 1988.
[223] Robert A. Kowalski. Predicate logic as a programming language. Information Processing, 74:569–574, 1974.
[225] Robert A. Kowalski. The early years of logic programming. Communications of the ACM, 31:38–43, 1988.
[226] Robert A. Kowalski and Mark J. Sergot. A logic-based calculus of events. New Generation Computing, 4:67–95, 1986.
[227] Sarit Kraus, Daniel Lehmann, and Menachem Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44(1):167–207, 1990.
[228] Natasha Kurtonina and Maarten de Rijke. Expressiveness of concept expressions in first-order description logics. Artificial Intelligence, 107(2):303–330, 1999.
[229] Yannis Labrou. Semantics for an Agent Communication Language. Ph.D. thesis, Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, 1996.
[230] Yannis Labrou and Tim Finin. Semantics and conversations for an agent communication language. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, pages 584–591. Morgan Kaufmann, San Francisco, 1997. Reprinted in [193].
[231] John E. Laird, Allen Newell, and Paul S. Rosenbloom. SOAR: An architecture for general intelligence. Artificial Intelligence, 33(1):1–64, 1987.
[232] Fritz Lehmann and Ervin Y. Rodin, editors. Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, 1992.
[233] Alexander Leitsch. The Resolution Calculus. Texts in Theoretical Computer Science. Springer-Verlag, Berlin, 1997.
[235] Douglas B. Lenat and Ramanathan V. Guha. Building Large Knowledge-Based Systems: Representation and Inference in the CYC Project. Addison-Wesley, Reading, MA, 1990.
[236] Maurizio Lenzerini, Daniele Nardi, and Maria Simi, editors. Inheritance Hierarchies in Knowledge Representation and Programming Languages. John Wiley & Sons, Chichester, 1991.
[237] Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, and Richard Scherl. A logical approach to high-level robot programming: A progress report. In Control of the Physical World by Intelligent Systems, Working Notes of the 1994 AAAI Fall Symposium, pages 79–85. AAAI Press, Menlo Park, CA, 1994.
[238] Hector J. Levesque. Foundations of a functional approach to knowledge representation. Artificial Intelligence, 23(2):155–212, 1984.
[239] Hector J. Levesque. A logic of implicit and explicit belief. In Proceedings of the Fourth National Conference on Artificial Intelligence (AAAI-84), Austin, TX, pages 198–202. William Kaufmann, Los Altos, CA, 1984.
[240] Hector J. Levesque. Knowledge representation and reasoning. Annual Review of Computer Science, 1:255–288, 1986.
[241] Hector J. Levesque. Making believers out of computers. Artificial Intelligence, 30(1):81–108, 1986.
[242] Hector J. Levesque. A knowledge-level account of abduction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pages 1061–1067. Morgan Kaufmann, San Mateo, CA, 1989.
[243] Hector J. Levesque and Ronald J. Brachman. A fundamental tradeoff in knowledge representation and reasoning (revised version). In Ronald J. Brachman and Hector J. Levesque, editors, Readings in Knowledge Representation, pages 41–70. Morgan Kaufmann, San Francisco, 1985.
[244] Hector J. Levesque and Gerhard Lakemeyer. The Logic of Knowledge Bases. MIT Press, Cambridge, 2000.
[245] Hector J. Levesque and Maurice Pagnucco. LEGOLOG: Inexpensive experiments in cognitive robotics. In Proceedings of the Second International Cognitive Robotics Workshop, pages 104–109. ECAI, Berlin, 2000.
[246] Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, and Richard Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31:59–84, 1997.
[247] David Lewis. Counterfactuals. Harvard University Press, Cambridge, MA, 1973. Reprinted with corrections, 1986.
[248] David Lewis. Probabilities of conditionals and conditional probabilities. The Philosophical Review, 85:297–315, 1976.
[249] Vladimir Lifschitz. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, pages 121–127. Morgan Kaufmann, Los Altos, CA, 1985.
[250] Vladimir Lifschitz. Pointwise circumscription. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), Philadelphia, pages 406–410. Morgan Kaufmann, Los Altos, CA, 1986.
[251] Vladimir Lifschitz. On the semantics of STRIPS. In Proceedings of the 1986 Workshop on Reasoning about Actions and Plans, Timberline Lodge, OR, pages 1–9. Morgan Kaufmann, Los Altos, CA, 1987.
[252] Vladimir Lifschitz. Frames in the space of situations. Artificial Intelligence, 46(3):365–376, 1990.
[253] Vladimir Lifschitz. Circumscription. In Dov M. Gabbay, Christopher John Hogger, and John Alan Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, pages 298–352. Oxford University Press, Oxford, 1994.
[254] Vladimir Lifschitz, editor. Formalizing Common Sense: Papers by John McCarthy. Intellect, Exeter, England, 1998.
[255] James Lighthill. Artificial Intelligence: A general survey. In J. Lighthill, N. S. Sutherland, R. M. Needham, H. C. Longuet-Higgins, and D. Michie, editors, Artificial Intelligence: A Paper Symposium. Science Research Council of Great Britain, London, 1973.
[256] Fangzhen Lin. Embracing causality in specifying the indirect effects of actions. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pages 1985–1991. Morgan Kaufmann, San Mateo, CA, 1995.
[257] Robert K. Lindsay, Bruce G. Buchanan, Edward A. Feigenbaum, and Joshua Lederberg. Applications of Artificial Intelligence for Organic Chemistry: The DENDRAL Project. McGraw-Hill, New York, 1980.
[259] John W. Lloyd. Foundations of Logic Programming, 2nd, extended edition. Springer-Verlag, Berlin, 1987.
[260] George F. Luger. Artificial Intelligence: Structures and Strategies for Complex Problem Solving, 4th edition. Addison-Wesley, London, 2002.
[261] Witold Łukaszewicz. Non-Monotonic Reasoning: Formalization of Commonsense Reasoning. Ellis Horwood, New York, 1990.
[262] David Makinson. Bridges between classical and nonmonotonic logic. Logic Journal of the IGPL, 11(1):69–96, 2003.
[263] David Makinson and Peter Gärdenfors. Relations between the logic of theory change and nonmonotonic logic. In Andre Fuhrmann and Michael Morreau, editors, The Logic of Theory Change, pages 185–205. Lecture Notes in Artificial Intelligence, Vol. 465. Springer-Verlag, Berlin, 1990.
[264] Ebrahim H. Mamdani. Advances in the linguistic synthesis of fuzzy controllers. International Journal of Man-Machine Studies, 8:669–678, 1976.
[265] Zohar Manna and Richard Waldinger. The Logical Basis for Computer Programming. Vol. 1: Deductive Reasoning. Addison-Wesley, Reading, MA, 1985.
[266] V. Wiktor Marek and Miroslaw Truszczyński. Relating autoepistemic and default logics. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, pages 276–288. Morgan Kaufmann, Los Altos, CA, 1989.
[267] V. Wiktor Marek and Miroslaw Truszczyński. Nonmonotonic Logic: Context Dependent Reasoning. Springer-Verlag, Berlin, 1993.
[268] Pierre Marquis. Extending abduction from propositional to first-order logic. In Proceedings of the International Workshop on Fundamentals of Artificial Intelligence, pages 141–155. Lecture Notes in Computer Science, Vol. 535. Springer-Verlag, Berlin, 1991.
[269] Kim Marriott and Peter J. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA, 1998.
[270] Joāo P. Martins and Stuart C. Shapiro. A model for belief revision. Artificial Intelligence, 35(1):25–79, 1988.
[271] Marta Cialdea Mayer and Fiora Pirri. Propositional abduction in modal logic. Journal of the Interest Group on Pure and Applied Logics, 3(6):907–919, 1995.
[273] Norman McCain and Hudson Turner. A causal theory of ramifications and qualifications. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pages 1978–1984. Morgan Kaufmann, San Mateo, CA, 1995.
[274] Norman McCain and Hudson Turner. Causal theories of action and change. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, Providence, RI, pages 460–465. AAAI Press, Menlo Park, CA, 1997.
[275] John McCarthy. Programs with common sense. In Mechanization of Thought Processes, Vol. 1, Proc. Symposium, National Physical Laboratory, London, pages 77–84, November 1958. Reprinted in Marvin Minsky, editor, Semantic Information Processing, pages 216–270. MIT Press, Cambridge, MA, 1968. Reprinted in [47].
[276] John McCarthy. Situations, actions, and causal laws. Technical report, Stanford University Artificial Intelligence Project, 1963.
[277] John McCarthy. Epistemological problems in artificial intelligence. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, pages 1038–1044. Morgan Kaufmann, Los Altos, CA, 1977. Reprinted in [47] and [254].
[278] John McCarthy. Circumscription: A form of non-monotonic reasoning. Artificial Intelligence, 13(1–2):27–39, 1980. Reprinted in [254].
[279] John McCarthy. Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence, 28(1):89–116, 1986. Reprinted in [254].
[282] John McCarthy and Patrick Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Donald Michie and Bernard Meltzer, editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press, Edinburgh, 1969. Reprinted in [254].
[283] John McDermott. R1: An expert in the computer systems domain. In Proceedings of the First National Conference on Artificial Intelligence, Stanford, CA, pages 269–271. AAAI, Menlo Park, CA, 1980.
[285] John McDermott. R1: A rule-based configurer of computer systems. Artificial Intelligence, 19(1):39–88, 1982.
[286] Deborah L. McGuinness and Frank van Harmelen, editors. OWL web ontology language overview. Technical report, World Wide Web Consortium, 2003.
[287] Karl Meinke and John V. Tucker, editors. Many-Sorted Logic and Its Applications, John Wiley & Sons, Chichester, 1993.
[288] Elliot Mendelson. Introduction to Mathematical Logic, 4th edition. Chapman and Hall, London, 1997.
[289] Marc Mezard, Giorgio Parisi, and Riccardo Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297:812–815, 2002.
[290] Jack Minker. On indefinite databases and the closed-world assumption. Lecture Notes in Computer Science, Vol. 138, pages 292–308. Springer-Verlag, Berlin, 1982.
[291] Jack Minker. Logic and databases: A 20 year perspective—updated in honor of Ray Reiter. In Hector J. Levesque and Fiora Pirri, editors, Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter, pages 234–299. Springer, Berlin, 1999.
[292] Marvin Minsky. A framework for representing knowledge. In John Haugeland, editor, Mind Design, pages 95–128. MIT Press, Cambridge, MA, 1981. Reprinted in [47].
[293] David Mitchell, Bart Selman, and Hector J. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, pages 459–465. AAAI Press, Menlo Park, CA, 1992.
[294] Robert C. Moore. The role of logic in knowledge representation and commonsense reasoning. In Proceedings of the Second National Conference on Artificial Intelligence, Pittsburgh, pages 428–433. AAAI, Menlo Park, CA, 1982. Reprinted in [299].
[295] Robert C. Moore. Possible-world semantics for autoepistemic logic. In Proceedings of the Non-Monotonic Reasoning Workshop, New Paltz, NY, pages 344–354. AAAI, Menlo Park, CA, 1984. Reprinted in [299].
[296] Robert C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75–94, 1985. Reprinted in [299].
[297] Robert C. Moore. The role of logic in artificial intelligence. In I. Benson, editor, Intelligent Machinery: Theory and Practice. Cambridge University Press, Cambridge, England, 1986. Reprinted in [299].
[298] Robert C. Moore. Autoepistemic logic revisited. Artificial Intelligence, 59(1–2):27–30, 1993. Reprinted in [299].
[299] Robert C. Moore. Logic and Representation. CSLI Lecture Notes, Vol. 39. CSLI, Stanford, CA, 1995.
[300] Steven Morris and Paul O'Rorke. An approach to theory revision using abduction. In Working Notes of the 1990 Spring Symposium on Automated Abduction, pages 33–37. Technical Report 90–32. University of California, Irvine, 1990.
[301] Ernest Nagel and James R. Newman. Gödel's Proof. New York University Press, New York, 1958. Revised edition, cowritten with Douglas R. Hofstadter, 2002.
[302] Richard E. Neapolitan. Probabilistic Reasoning in Expert Systems: Theory and Algorithms. John Wiley & Sons, New York, 1990.
[303] Bernhard Nebel. Reasoning and Revision in Hybrid Systems. Lecture Notes in Artificial Intelligence, Vol. 422, Springer-Verlag, Berlin, 1990.
[304] Bernhard Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43(2):235–249, 1990.
[306] Allen Newell and Herbert A. Simon. GPS, a program that simulates thought. In Edward A. Feigenbaum and Julian Feldman, editors, Computers and Thought, McGraw-Hill, New York, 1963. Republished by AAAI Press/MIT Press, Menlo Park, CA/Cambridge, MA, 1995.
[307] Allen Newell and Herbert A. Simon. Human Problem Solving, Prentice Hall, Englewood Cliffs, NJ, 1972.
[308] Hwee Tou Ng and Raymond J. Mooney. On the role of coherence in abductive explanation. In Proceedings of the Eighth National Conference on Artificial Intelligence, Boston, pages 337–342. AAAI Press, Menlo Park, CA, 1990.
[309] Nils J. Nilsson. Problem Solving Methods in Artificial Intelligence. McGraw-Hill, Toronto, 1971.
[311] Nils J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, San Francisco, 1998.
[312] Ulf Nilsson and Jan Maluszynski. Logic, Programming and PROLOG. John Wiley & Sons, Chichester, 1995.
[313] Maurice Pagnucco and Pavlos Peppas. Causality and minimal change demystified. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Seattle, pages 125–130. Morgan Kaufmann, San Francisco, 2001.
[314] George S. Pappas and Marshall Swain, editors. Essays on Knowledge and Justification. Cornell University Press, Ithaca, NY, 1978.
[315] Jeff B. Paris. The Uncertain Reasoner's Companion: A Mathematical Perspective. Cambridge Tracts in Theoretical Computer Science 39. Cambridge University Press, Cambridge, England, 1994.
[316] Peter F. Patel-Schneider. Small can be beautiful in knowledge representation. In Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems, Denver, pages 11–16. IEEE Press, Los Alamitos, CA, 1984.
[317] Peter F. Patel-Schneider. A four-valued semantics for terminological logics. Artificial Intelligence, 38(3):319–351, 1989.
[318] Peter F. Patel-Schneider, Ronald J. Brachman, and Hector J. Levesque. ARGON: Knowledge representation meets information retrieval. In Proceedings of the First Conference on Artificial Intelligence Applications, Denver, pages 280–286. IEEE Computer Society Press, Silver Spring, MD, 1984.
[319] Gabrielle Paul. Approaches to abductive reasoning: An overview. Artificial Intelligence Review, 7:109–152, 1993.
[320] Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 2nd revised printing. Morgan Kaufmann, San Francisco, 1988.
[322] Edwin P. D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, pages 324–332. Morgan Kaufmann, Los Altos, CA, 1989.
[323] Charles Sanders Peirce. Collected Papers of Charles Sanders Peirce. Vols. 1–8, edited by Charles Hartshorne, Paul Weiss, and Arthur W. Burks. Harvard University Press, Cambridge, MA, 1931–1958.
[324] Charles Sanders Peirce. Philosophical Writings of Peirce. Selected and edited with an introduction by Justus Buchler. Dover, New York, 1955. Unaltered republication of book published in 1940 by Routledge and Kegan Paul.
[325] Charles Sanders Peirce. Reasoning and the Logic of Things. Edited by Kenneth Laine Ketner, with an introduction by Kenneth Laine Ketner and Hilary Putnam. Harvard University Press, Cambridge, MA, 1992.
[326] Yun Peng and James A. Reggia. Abductive Inference Models for Diagnostic Problem-Solving. Springer-Verlag, New York, 1990.
[327] Roger Penrose. The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Vintage, London, 1990.
[328] Fiora Pirri and Raymond Reiter. Some contributions to the metatheory of the situation calculus. Journal of the ACM, 46(3):261–325, 1999.
[329] Marco Pistore and Paolo Traverso. Planning as model checking for extended goals in non-deterministic domains. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Seattle, pages 479–486. Morgan Kaufmann, San Francisco, 2001.
[330] David Poole. A logical framework for default reasoning. Artificial Intelligence, 36(1):27–47, 1988.
[331] David Poole, Randy Goebel, and Romas Aleliunas. THEORIST: A logical reasoning system for defaults and diagnosis. In Nick Cercone and Gordon McCalla, editors, The Knowledge Frontier: Essays in the Representation of Knowledge, pages 331–352. Springer-Verlag, New York, 1987.
[332] David Poole, Alan Mackworth, and Randy Goebel. Computational Intelligence: A Logical Approach. Oxford University Press, New York, 1998.
[333] Harry E. Pople Jr. On the mechanization of abductive logic. In Proceedings of the Third International Joint Conference on Artificial Intelligence, Stanford, CA, pages 147–152. Morgan Kaufmann, Los Altos, CA, 1973.
[334] Zenon Pylyshyn. Computation and Cognition: Toward a Foundation for Cognitive Science. MIT Press, Cambridge, MA, 1984.
[336] M. Ross Quillian. Semantic memory. In Marvin Minsky, editor, Semantic Information Processing, pages 216–270. MIT Press, Cambridge, MA, 1968.
[337] Ashwin Ram and David Leake. Evaluation of explanatory hypotheses. In Proceedings of the Thirteenth Annual Conference of the Cognitive Science Society, Chicago, pages 867–871. Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.
[339] Michael Reinfrank. Fundamentals and Logical Foundations of Truth Maintenance. Ph.D. thesis, Department of Computer and Information Science, University of Linköping, 1989.
[340] Michael Reinfrank, Oskar Dessler, and Gerhard Brewka. On the relation between truth maintenance and autoepistemic logic. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pages 1206–1212. Morgan Kaufmann, San Mateo, CA, 1989.
[341] Raymond Reiter. Equality and domain closure in first-order databases. Journal of the Association for Computing Machinery, 27(2):235–249, 1980.
[342] Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2): 81–132, 1980.
[343] Raymond Reiter. On interacting defaults. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver, pages 270–276. AAAI, Menlo Park, CA, 1981.
[345] Raymond Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and Databases, pages 55–76. Plenum Press, New York, 1987.
[346] Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57–95, 1987.
[347] Raymond Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 359–380. Academic Press, New York, 1991.
[348] Raymond Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Cambridge, MA, 2001.
[349] Raymond Reiter and Johan de Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87), Seattle, pages 183–188. Morgan Kaufmann, Los Altos, CA, 1987.
[350] Michael D. Resnik. Choices: An Introduction to Decision Theory. University of Minnesota Press, Minneapolis, 1987.
[352] Elaine Rich and Kevin Knight. Artificial Intelligence, 2nd edition. McGraw-Hill, New York, 1990.
[353] Tom Richards. Clausal Form Logic: An Introduction to the Logic of Computer Reasoning. Addison-Wesley, Boston, 1989.
[354] Gordon A. Ringland and David A. Duce, editors. Approaches to Knowledge Representation: An Introduction. Research Studies Press, Letchworth, Hertfordshire, England, 1988.
[355] Don D. Roberts. The Existential Graphs of Charles S. Peirce. Mouton de Gruyter, The Hague, 1973.
[356] R. Bruce Roberts and Ira P. Goldstein. The FRL primer. AI Memo 408, Artificial Intelligence Laboratory. MIT, Cambridge, MA, 1977.
[357] John Alan Robinson. A machine-oriented logic based on the Resolution principle. Journal of the Association for Computing Machinery, 12(1):23–41, 1965.
[358] Hans Rott. Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning. Oxford University Press, Oxford, 2001.
[359] Stuart J. Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 2nd edition. Prentice Hall, Upper Saddle River, NJ, 2002.
[360] Earl Sacerdoti. The nonlinear nature of plans. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, pages 206–214. Morgan Kaufmann, Los Altos, CA, 1975.
[361] Earl Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5(2):231–272, 1974.
[362] Wesley C. Salmon. Four Decades of Scientific Explanation. University of Minnesota Press, Minneapolis, 1989.
[363] Erik Sandewall. Features and Fluents: The Representation of Knowledge about Dynamical Systems. Vol. 1. Oxford University Press, Oxford, 1995.
[364] Erik Sandewall. Underlying semantics for action and change with ramification. Linköping Electronic Articles in Computer and Information Science, 3:307–329, 1998.
[365] Marco Schaerf and Marco Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74(2):249–310, 1995.
[366] Roger C. Schank and Robert P. Abelson. Scripts, Plans, Goals, and Understanding: An Inquiry into Human Knowledge Structures. Lawrence Erlbaum Associates, Hillsdale, NJ, 1977.
[367] Karl Schlechta. Nonmonotonic Logics: Basic Concepts, Results, and Techniques. Lecture Notes in Artificial Intelligence, Vol. 1187. Springer-Verlag, Berlin, 1997.
[368] James G. Schmolze and Thomas A. Lipkis. Classification in the KL-ONE knowledge representation system. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Karlsruhe, Germany, pages 330–332. William Kaufmann, Los Altos, CA, 1983.
[369] Marcel J. Schoppers. Universal plans for reactive robots in unpredictable domains. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Milan, Italy, pages 1039–1046. Morgan Kaufmann, San Mateo, CA, 1987.
[370] Marcel J. Schoppers. Representation and Automatic Synthesis of Reaction Plans. Ph.D. thesis, University of Illinois at Urbana-Champaign, 1989.
[371] Lenhart K. Schubert. Monotonic solution of the frame problem in the situation calculus: An efficient method for worlds with fully specified actions. In Henry E. Kyburg, Ronald P. Loui, and Greg N. Carlson, editors, Knowledge Representation and Defeasible Reasoning, pages 23–67. Kluwer, Dordrecht, The Netherlands, 1990.
[372] Lenhart K. Schubert. Explanation closure, action closure and the Sandewall test suite for reasoning about change. Journal of Logic and Computation, 4(5):679–900, 1994.
[375] Bart Selman, Hector J. Levesque, and David Mitchell. A new method for solving hard instances of satisfiability. In Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, pages 440–446. AAAI Press, Menlo Park, CA, 1992.
[376] Glenn Shafer. A Mathematical Theory of Evidence. Princeton University Press, Princeton, NJ, 1976.
[378] Glenn Shafer and Judea Pearl, editors. Readings in Uncertain Reasoning. Morgan Kaufmann, San Francisco, 1990.
[379] Murray Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge, MA, 1997.
[380] Steven Shapiro, Maurice Pagnucco, Yves Lespérance, and Hector J. Levesque. Iterated belief change in the situation calculus. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning, Breckenridge, CO, pages 527–538. Morgan Kaufmann, San Francisco, 2000.
[381] Stuart C. Shapiro. The SNePS semantic network processing systems. In Nicholas V. Findler, editor, Associative Networks: Representation and Use of Knowledge by Computers, pages 179–203. Academic Press, New York, 1979. Reprinted in [47].
[382] Stuart C. Shapiro. An introduction to SNePS 3. In Bernhard Ganter and Guy W. Mineau, editors, Conceptual Structures: Logical, Linguistic, and Computational Issues, pages 510–524. Lecture Notes in Artificial Intelligence, Vol. 1867, Springer-Verlag, Berlin, 2000.
[383] Stuart C. Shapiro and Frances L. Johnson. Automatic belief revision in SNePS. In Proceedings of the Eighth International Workshop on Nonmonotonic Reasoning, Breckenridge, CO, 2000.
[385] Yoav Shoham. Artificial Intelligence Techniques in PROLOG. Morgan Kaufmann, San Francisco, 1994.
[387] Thoralf A. Skolem. Logisch-kombinatorische untersuchungen über die erfüll-barkeit oder beweisbarkeit mathematischer sätze nebst einem theoreme über die dichte mengen. Videnskapsakademiets Skrifter I. Matematisk-naturvidenskabelig klasse, 4:1–36, 1920. Also appears in Jens E. Fenstad, editor, Th. Skolem: Selected Works in Logic, pages 103–136. Universitetsforlag, Oslo, 1970.
[388] Thoralf A. Skolem. über die mathematische logik. Norsk Matematisk Tidsskrift, 10:125–142, 1928.
[389] John Slaney and Sylvie Thiébaux. Blocks world revisited. Artificial Intelligence, 125(1–2):119–153, 2001.
[390] Brian Cantwell Smith. Reflection and Semantics in a Procedural Language. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1982. Also appears as Technical Report MIT/LCS/TR-272, MIT.
[391] Paul Smolensky. On the proper treatment of connectionism. Behavioral and Brain Sciences, 2:1–74, 1988.
[392] John F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading, MA, 1984.
[393] John F. Sowa, editor. Principles of Semantic Networks: Explorations in the Representation of Knowledge. Morgan Kaufmann, San Mateo, CA, 1991.
[394] John F. Sowa. Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole, Pacific Grove, CA, 2000.
[395] Richard M. Stallman and Gerald J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9(2):135–196, 1977.
[396] Lynn Andrea Stein. Skeptical inheritance: Computing the intersection of credulous extensions. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, Detroit, pages 1153–1158. Morgan Kaufmann, San Mateo, CA, 1989.
[397] Lynn Andrea Stein. Computing skeptical inheritance. In Maurizio Lenzerini, Daniele Nardi, and Maria Simi, editors, Inheritance Hierarchies in Knowledge Representation and Programming Languages, pages 69–81. John Wiley & Sons, Chichester, 1991.
[398] Lynn Andrea Stein. Resolving ambiguity in nonmonotonic inheritance hierarchies. Artificial Intelligence, 55(2–3):259–310, 1992.
[400] Mark E. Stickel. A nonclausal connection-graph resolution theorem-proving program. In Proceedings of the Second National Conference on Artificial Intelligence, Pittsburgh, pages 229–233, AAAI, Menlo Park, CA, 1982.
[401] Mark E. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1(4):333–355, 1985.
[402] Mark E. Stickel. A PROLOG-like inference system for computing minimal-cost abductive explanations in natural-language interpretation. Annals of Mathematics and Artificial Intelligence, 4:89–106, 1991.
[403] Gerald J. Sussman and Drew McDermott. Why conniving is better than planning. AI Memo 255A, MIT, Cambridge, MA, 1972.
[404] Gerald J. Sussman and Terry Winograd. MICRO-PLANNER reference manual. Technical report, Artificial Intelligence Laboratory, MIT, Cambridge, MA, 1970.
[405] Alfred Tarski. über den Begriff der logischen Folgerung. Actes du Congrés International de Philosophie Scientifique, 7:1–11, 1936. Translated in [406].
[407] Austin Tate. Advanced Planning Technology: Technological Achievements of the ARPA/Rome Laboratory Planning Initiative. AAAI Press, Menlo Park, CA, 1996.
[408] Ernest Teniente. An abductive framework to handle consistency-preserving updates in deductive databases. In Proceedings of the ICLP'95 Joint Workshop on Deductive Databases and Logic Programming and Abduction in Deductive Databases and Knowledge-Based Systems, pages 111–125. GMD-Studien No. 266, GMD, Sankt Augustin, Germany, 1995.
[409] Michael Thielscher. Ramification and causality. Artificial Intelligence, 89(1–2): 317–364, 1997.
[410] Michael Thielscher. Introduction to the fluent calculus. Linköping Electronic Articles in Computer and Information Science, 3(14):179–192, 1998.
[411] Pierre Tison. Generalization of consensus theory and application to the minimization of boolean functions. IEEE Transactions on Electronic Computers, 4:446–456, 1967.
[412] David S. Touretzky. The Mathematics of Inheritance Systems. Morgan Kaufmann, Los Altos, CA, 1986.
[413] David S. Touretzky, John F. Horty, and Richmond H. Thomason. A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Milan, Italy, pages 476–482. Morgan Kaufmann, San Mateo, CA, 1987.
[415] Richard von Mises. Probability, Statistics and Truth, 2nd revised English edition prepared by Hilda Geiringer. Allen & Unwin, London, 1957. Republished by Dover, New York, 1981. Translation of the third German edition, 1951.
[416] Gerd Wagner. Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation. Lecture Notes in Artificial Intelligence, Vol. 764. Springer-Verlag, Berlin, 1994.
[417] Richard Waldinger. Achieving several goals simultaneously. In Edward W. Elcock and Donald Michie, editors, Machine Intelligence 8, pages 94–136. Ellis Horwood, Chichester, 1975. Reprinted in Bonnie L. Webber and Nils J. Nilsson, editors, Readings in Artificial Intelligence, pages 250–271. Tioga, Los Altos, CA, 1981.
[418] R. J. Walker. An enumerative technique for a class of combinatorial problems. In Richard E. Bellman and Marshall Hall Jr., editors, Combinatorial Analysis: Proceedings of the Symposium on Applied Mathematics. Vol. X, pages 91–94. American Mathematical Society, Providence, 1960.
[419] Hao Wang. Toward mechanical mathematics. IBM Journal of Research and Development, 4:2–22, 1960. Reprinted in Hao Wang, Logic, Computers, and Sets, Science Press, Peking, 1962; Hao Wang, A Survey of Mathematical Logic, North-Holland, Amsterdam, 1964; Hao Wang, Logic, Computers, and Sets, Chelsea, New York, 1970.
[420] Li-Xin Wang. A Course in Fuzzy Systems and Control. Prentice Hall, Upper Saddle River, NJ, 1997.
[422] Alfred North Whitehead and Bertrand Russell. Principia Mathematica, 2nd edition. Cambridge University Press, Cambridge, England, 1927.
[423] David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.
[424] Mary-Anne Williams. Iterated theory base change: A computational model. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, pages 1541–1550. Morgan Kaufmann, San Mateo, CA, 1995.
[425] Mary-Anne Williams. Towards a practical approach to belief revision: Reason-based change. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, pages 412–421. Morgan Kaufmann, San Francisco, 1996.
[426] Terry Winograd. Frame representations and the declarative/procedural controversy. In Daniel G. Bobrow and Allan M. Collins, editors, Representation and Understanding: Studies in Cognitive Science, pages 185–210. Academic Press, New York, 1975.
[427] Patrick Henry Winston. Learning structural descriptions from examples. In Patrick Henry Winston, editor, Psychology of Computer Vision, pages 157–209. McGraw-Hill, New York, 1975. Reprinted in [47].
[428] Patrick Henry Winston. Artificial Intelligence, 3rd edition. Addison-Wesley, Reading, MA, 1992.
[429] Ludwig Wittgenstein. Tractatus logico-philosophicus. Routledge and Kegan Paul, London, 1974. Originally published in German in Annalen der Naturphilosophie, 1921, as Logisch-Philosophische Abhandlung.
[430] William A. Woods. What's in a link: Foundations for semantic networks. In Daniel G. Bobrow and Allan M. Collins, editors, Representation and Understanding: Studies in Cognitive Science, pages 35–82. Academic Press, New York, 1975. Reprinted in [47].
[431] Larry Wos. The Automation of Reasoning: An Experimenter's Notebook with OTTER Tutorial. Academic Press, San Diego, 1996.
[432] Larry Wos and George A. Robinson. Paramodulation and set of support. In Proceedings of the IRIA Symposium on Automatic Demonstration, Versailles, pages 276–310. Springer-Verlag, Berlin, 1968.
[433] Larry Wos, George A. Robinson, and Daniel F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the Association of Computing Machinery, 12(4):536–541, 1965.
[434] Jon R. Wright, Elia S. Weixelbaum, Karen E. Brown, Gregg T. Vesonder, Stephen R. Palmer, Jay I. Berman, and Harry H. Moore. A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T Network Systems. In Proceedings of the Innovative Applications of Artificial Intelligence Conference, Washington, DC, pages 183–193. AAAI Press, Menlo Park, CA, 1993.
[435] Robert M. Wygant. CLIPS: A powerful development and delivery expert system tool. Computers and Industrial Engineering, 17:546–549, 1989.
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.