Contributors' Addresses - Springer978-1-4612-4980-1/1.pdf · Contributors' Addresses 589 Hector...

Contributors' Addresses

Advisory Committee Danny Bobrow Xerox Corporation Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304 415-494-4367 Bobrow@PARC

Ronald Brachman Bell Laboratories 600 Mountain Avenue Murry Hill, NJ 07974 415-496-4631 decvax !allegra!rjb

Michael Brodie Computer Corporation of America 4 Cambridge Center Cambridge, MA 02142 617-492-8860 brodie@Cca

John McDermott Department of Computer Science Carnegie-Mellon University Pittsburgp, PA 15213 412-268-2599 McDermott@CMUA

John Mylopoulos Department of Computer Science University of Toronto Toronto, Ontario CANADA M5S 1A4 416-978-5180 jm%utai%toronto.csnet%csnet-relay

John M. Smith Computer Corporation of America 4 Cambridge Center Cambridge, MA 02142 617-492-8860 jsmith@Cca

Michael Stonebraker 549 Evans Hall Department of Electrical Engineering and Computer Science University of California, Berkeley Berkeley, CA 94720 415-642-5799 mike@berkeley

Research Agency Representatives

Ted M. Albert Data Administrator United States Geological Survey 806 National Center Reston, VA 22092 703-860-6086

Bernard Chern Design, Manufacturing, and Computer Engineering Division National Science Foundation Room 1108 1800 G. Street, NW Washington, DC 20550 202-357-7508 Chern@USC-ISI

588 Knowledge Base Management Systems

Stephen Guptill Chief, Branch of Analysis United States Geological Survey 521 National Center Reston, VA 22092 703-860-6345

1. Allen Sears Information Processing Techniques Office Defense Advanced Research Projects Agency 1400 Wilson Blvd. Arlington, VA 22209 202-694-5921 Sears@USC-ISIA

Research Participants

Francois Bancilhon Microelectronics and Computer Technology Corp. 9430 Research Boulevard Austin, TX 78759-6509 512-343-0860 Bancilhon@MCC

Robert 1. Bobrow (Rusty) Bolt, Beranek & Newman, Inc. Department of Artificial Intelligence 10 Moulton Street Cambridge, MA 02138 617-497-3601 Rusty@BBNG

Alex Borgida Department of Computer Science Rutgers University Hill Center, Busch Campus New Brunswick, NJ 08903 201-932-4744 [email protected]

Bruce Buchanan Heuristic Programming Project 701 Welch Road Stanford University Standord, CA 94305 415-497-0935 Buchanan@Sumex-AIM

Umeshwar Dayal Computer Corporation of America 4 Cambridge Center Cambridge, MA 02142 617-492-8860 dayal@Cca

David De Witt Computer Sciences Dept. University of Wisconsin-Madison 1210 West Dayton Street Madison, WI 53706 608-263-5489 [email protected]

Mark Fox Robotics Institute Carnegie-Mellon University Pittsburgh, PA 15213 412-268-3832 Mark.Fox@Cmu-ri-isll

Hector Garcia-Molina Dept. of Electrical Engineering and Computer Science Princeton University Princeton, NJ 08544 609-452-4633 hector%princeton@Csnet-relay

Mike Genesereth Department of Computer Science Stanford University Stanford, CA 94305 415-497-0324 GENESERETH@SU-SCORE

Danny Hillis Thinking Machines Corporation 245 First Street Cambridge, MA 02142 617-876-1111 [email protected]

David Israel SRI International - EK268 333 Ravenswood Avenue Menlo Park, CA 94025 415-859-4254 Israel@SRI-WARBUCKS

Matthias Jarke 711 Merrill Hall New York University 90 Trinity Place New York, NY 10006 212-285-6079 B20,M-JARKE@NYU20 effective Oct. '85 on leave at: Johann Wolfgang GoetheUniversitaet Frankfurt Fachbereich Informatik Dantestrasse 9 D-6000 Frankfurt am Main West Germany

Randy Katz Computer Science Division Electrical Engineering and Computer Science Department Evans Hall University of California, Berkeley Berkeley, CA 94720 415-642-8778 randy@berkeley

Contributors' Addresses 589

Hector Levesque Department of Computer Science University of Toronto Toronto, Ontario M5S lA 7 Canada 416-978-3618 hector%toronto.csnet@Csnet-relay

Frank Manola Computer Corporation of America 4 Cambridge Center Cambridge, MA 02142 617-492-8860 manola@Cca

Tom Mitchell Department of Computer Science Rutgers University Hill Center, Busch Campus New Brunswick, NJ 08903 201-932-3259 MITCHELL@RUTGERS

Shamim Naqvi Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 201-522-5101 decvax !allegra !san

Peter Szolovits Laboratory for Computer Science 545 Technology Square Cambridge, MA 02139 617-253-3476 PSZ@MIT-MC

Jeffrey D. Ullman Dept. of Computer Science Stanford University Stanford, CA 94305 415-497-1512 ullman@Su-score


Yannis Vassiliou Graduate School of Business Administration New York University 90 Trinity Place New York, NY 10006 212-598-7536 spirakis.acfl @nyu

David H. D. Warren Dept. of Computer Science The University of Manchester Manchester M13 9PL England

Bonnie Lynn Webber Dept. of Computer and Information Science The Moore School University of Pennsylvania Philadelphia, PA 19104 215-898-7745 bonnie%upenn.csnet

Gio Wiederhold Computer Science Department Jacks Hall 436 Stanford University Stanford, CA 94305 415-497-0685 wiederhold@SUMEX-AIM

Bill Woods Applied Expert Systems 5 Cambridge Center Cambridge, MA 02142 617-492-7322 wwoods@bbn

Student Assistants

Ellis Chang Computer Science Division Electrical Engineering and Computer Science Department Evans Hall University of California, Berkeley Berkeley, CA 94720 415-642-8778 chang%ucbernie@UCB-VAX

Goetz Graefe Computer Sciences Dept. University of Wisconsin-Madison 1210 West Dayton Street Madison, WI 53706 608-244-6073 graef e@WISC-DB

Brian Nixon Department of Computer Science University of Toronto Toronto, Ontario CANADA M5S lA4 416-978-4299 nixon%Toronto@CSNet-Relay

Martin Stanley Department of Computer Science University of Toronto Toronto, Ontario CANADA M5S lA7 mts% Toronto@CSNet-Relay

References

[ABRI74] Abrial, J.R., "Data semantics," in Data management systems, J.W.K1imbie and K.L.Koffeman, eds., North Holland, Amsterdam, 1974, pp. 1-59.

[AC76] Astrahan, M. M., D. D. Chamberlin, et aI., "System R: Relational Approach to Database Management," ACM Trans. Database Systems, 1, 1976.

[AC085] Albano, A., L.Cardelli, and R.Orsini, "Galileo: A strongly typed, interactive conceptual language", ACM Trans. on Database Systems, Vo1.10, No.2, June 1985, pp.230-260.

[ADAP83] "ADAPLEX: Rationale and Reference Manual," Technical Report CCA-83-03, Computer Corporation of America, May 1983.

[AE82] Apt, K., M. van Emden, Contributions to the Theory of Logic Programming, J. of the ACM 29, 3, 1982.

[AHU76] Aho, A., J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley: Reading, Massachusetts, 1976.

[AKSF83] Aikins, J. S., Kunz, J. C., Shortliffe, E. H., and Fallat, R. J., "PUFF: An Expert System for Interpretation of Pulmonary Function Data", Computers and Biomedical Research, Vol. 16, pp. 199-208, 1983. Reprinted in [CS84].

[ALLE82] Allen, J., "Recognizing Intentions from Natural Language Utterances", In M. Brady (editor), Computational Models of Discourse, MIT Press, Cambridge MA, 1982.


[ALLE83] Allen, l, "Maintaining knowledge about temporal intervals", Communications of the ACM, Vol. 26, No. 11, November 1983, pp. 832-843.

[ANLP83] Bea Oshika, Program Chair (editor), Proc. of the Conference on Applied Natural Language Processing, Association for Computational Linguistics, Santa Monica Ca, 1983.

[APPE85] Appelt, D., Planning English Sentences, Cambridge University Press, Cambridge England, 1985.

[APPR85] Afrati, F., C. H. Papadimitriou, G. Papageorgiou, and A. Roussou, "On testing convergence of the Sagiv-Ullman capture rule", unpublished memorandum, Dept. of CS, Stanford Univ., Private communication, Feb., 1985.

[ASTR76] Astrahan, M. et. aI., "System R; A Relational Approach to Data", ACM-TODS, June 1976.

[ASU79a] Aho AV, Sagiv Y, Ullman JD, "Equivalences among relational expressions", SIAM Journal of Computing, 8:2, 218-246, 1979.

[ASU79b] Aho, A.V., Sagiv, Y. and lD. Ullmann, "Efficient optimization of a class of relational expressions", A CM Transactions on Database Systems, Vol. 4, No.4, December 1979, pp.435-454.

[AU79] Aho, A., l Ullman, "Universality of Data Retrieval Languages", Sixth A CM Symposium on PrinCiples of Programming Languages, 1979.

[AW83] Allen, B.P., and lM. Wright, "Integrating Logic Programs and Schemata", Proceedings of the 8th International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, 1983.

[BACK78] Backus, l, "Can Programming Be Liberated From the von Neumann Style?" Communications of the ACM, (8): 613-641, 1978.

[BALZ80] Balzer, R., et aI., "HEARSAY-III: A Domain-Independent Framework for Expert Systems," Proc. AAAI Conference, August 1980.

References 593

[BANC85] Bancilhon, F., "On recursive rule evaluation in a knowledge base system", Proc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems, M. L. Brodie, ed., CCA, Cambridge, Mass, 1985.

[BARR82] Barron,J. "Dialogue and process design for Interactive Information Systems using Taxis", Proc. SIGDA Con/. on Office Information Systems, June 1982, Philadelphia, PA, pp.12-20.

[BATC80] Batcher, K.E., "Design of a Massively Parallel Processor," IEEE Transactions on Computers, C-29 (9), 1980.

[BATE84] Bates, M., "Accessing a Database with a Transportable Natural Language Interface", In IEEE Computer Society (editor), Proc. First Con/. on Artificial Intelligence Applications, IEEE, December, 1984, pages 9-12.

[BA YE85] Bayer, "Query Evaluation and Recursion in Deductive Database Systems," Proceedings of the Islamorada Workshop on Knowledge Base Management Systems, February 1985 (to be published in [BROD86]).

[BB82] Bernstein PA, Blaustein BT, "Fast methods for testing quantified relational calculus assertions", Proceedings ACM-SIGMOD Conference, Orlando, Fl, 39-50, 1982.

[BB84a] Bates, L. and Bobrow, R., "Natural Language Interfaces: What's Here, What's Coming, Who Needs It", In W. Reitman (editor), Artificial Intelligence Applications for Business, pages 179-194. Ablex, Norwood NJ, 1984.

[BB84b] Batory, D. S., A. P. Buchmann, "Molecular Objects, Abstract Data Types and Data Models - A Framework", Tenth International Conference on Very Large Data Bases, August 1984.

[BBC80] Bernstein, P., B. Blaustein, and E. Clarke, "Fast Maintenance of Integrity Assertions Using Redundant Aggregate Data," Proc. Sixth VLDB, October 1980.


[BBCK79] Brachman, R., Bobrow, R., Cohen, P., Klovstad, 1., Webber, B. and Woods, W., "Research in Natural Language Understanding -Annual Report: 1 Sept 78 - 31 Aug 79", Technical Report 4274, Bolt Beranek and Newman Inc., August, 1979.

[BBDM84] Brodie, M. L., B. Blaustein, U. Dayal, F. Manola, and A. Rosenthal, "CAD/CAM Database Management" in IEEE Database Engineering Newsletter, R. Katz (ed,), Special Issue on Engineering Data Management, July 1984.

[BC79]! Buneman, P. and Clemons, E., "Efficiently Monitoring Relational Databases", ACM-TODS, June 1979.

[BCGK83] Blaustein, B. T., R. M. Chilenskas, H. Garcia-Molina, C. W. Kaufman, and D. R. Ries, "Maintaining Replicated Databases Even in the Presence of Network Partitions," Proc. Third Symposium on Reliability in Distributed Software and Database Systems, Clearwater Beach, FL., IEEE, October 1983.

[BD81a] Baroody, A1. and DJ. DeWitt, "An Object-Oriented Approach to Database System Implementation", ACM Transactions on Database Systems, Vol. 6, No.4, December, 1981.

[BD81b] Barr, A. and Davidson, 1., "Representation of Knowledge" in Handbook of Artificial Intellingence, Barr, A and Feigenbaum E., (eds), William Kaufman, Los Altos, CA, 1981.

[BD82] Baroody, A1. and DJ. DeWitt, "The Impact of Run-Time Schema Interpretation in a Network Data Model DBMS", IEEE Transactions on Software Engineering, March 1982.

[BDFS82] Balzer R, Dyer D, Fehling M, Saunders S, "Specification-based computing environments", Proceedings 8th VLDB Conference, Mexico City, 273-279, 1982.

[BDT83] Bitton, D., DeWitt, D. and C. Turbyfill, "Benchmarking Database Systems - A Systematic Approach", Proceedings of the 1983 Very Large Database Conference, Florence, Italy, (October 1983), pp. 8-19.

References 595

[BEEC83] Beech, D., "Introducing the integrated data model", HewlettPackard Computer Science Laboratory Technical Note CSL-15, January, 1983.

[BF83] Brachman, R. l, Fikes, R. E., and Levesque, H. l, "Krypton: In

tegrating Terminology and Assertion," Proc. AAAI-83, Washington, DC, August, 1983, 31--35.

[BFL83a] Brachman, R.l, R.E. Fikes and H.l Levesque.,- "Krypton: A Functional Approach to Knowledge Representation", IEEE COMPUTER, Special Issue on Knowledge Representation, Vol. 16, No. 10, October 1983, pp. 67-73.

[BFL83b] Brachman, R.l, R.E. Fikes, and H. Levesque, "KRYPTON: Integrating Terminology and Assertion," in Proc. National Conference on Artificial Intelligence, AAAI83, Washington, D.C, August, 1983, pp. 31-35.

[BG80] Bobrow, D. G., I. P. Goldstein, "Representing Design Alternatives", Proc. AISB Conference, Amsterdam, 1980.

[BG81a] Bernstein, P., and N. Goodman, "Concurrency Control in Distributed Database Systems", ACM Computing Surveys, 13(2), June 1981.

[BG81b] Borgida, A. and S. Greenspan, "Data and activities: exploiting hierarchies of classes", Proc. Pingree Workshop on Data abstraction, Databases and Conceptual Modeling, ACM SIGMOD Record Vo1.l1, No.2, February 1981.

[BG84] Boral, H. and I. Gold, "Towards a Self-Adapting Centralized Concurrency Control Algorithm", Proceedings of the 1984 SIGMOD Conference, Boston, Ma., 1984.

[BGK85] Bobrow, D. G., I. P. Goldstein, R. H. Katz, "Context Structures/Versioning: A Survey", Islamorada Workshop on Knowledge and Data Bases, Islamorada, FL, February 1985.


[BGM85] Borgida, A., S.Greenspan, lMylopoulos, "Knowledge representation as the basis for requirements specifications", IEEE COMPUTER, Special issue on Requirements Engineering, VoLl8, No.4, April 1985, pp. 82-90.

[BGRC83] Blaustein, B. T., H. Garcia-Molina, D. R. Ries, R. M. Chilenskas, and C. W. Kaufman, "Maintaining Replicated Databases Even in the Presence of Network Partitions", IEEE EASCON Conference, September 1983.

[BGV46] Burks, Arthur W., Herman H. Goldstine, and John von Neumann, "Preliminary Discussion of the Logical Design of an Electronic Computing Instrument," in Report on the Mathematical and Logical Aspects of an Electronic Computing Instrument, Pt. I, Vol. 1, The Institute for Advanced Study, ECP list of reports 1946-1957, no. 1, 1946.

[BGW82] Balzer, R., N. Goldman, and D. Wile, "Operational specification as the basis for rapid prototyping", Proc. ACM Software Engineering Symp. on Rapid Prototyping, Columbia, MD., in ACM Software Eng. Notes, Vol.7, No.5, December 1982.

[BH80] Ball, E. and P. Hayes, "Representation of Task-Specific Knowledge in a Gracefully Interacting User Interface," Proc. AAAI Conference, August 1980.

[BHR80] Bayer, R., Heller, H., and A. Reiser, "Parallelism and Recovery in Database Systems", A CM Transactions on Database Systems, Vol. 5, No.2, June 1980.

[BI84] Brachman, R, and D. Israel, "Some Remarks on the Semantics of Representation Languages," in in Brodie, Mylopoulos, Schmidt (eds.), Conceptual Modelling: Perspectives from Artificial Intelligence, Databases, and Programming Languages, Springer-Verlag, New York, 1984, pp. 119-142.

[BJ84] Brodie, M., and Jarke, M., "On Integrating Logic Programming and Data Bases", Proc. 1st International Conference on Expert Data Base Systems, Kiowah, S.C., Oct 1984.

References 597

[BK82] Bowen KA, Kowalski RA, "Amalgamating language and metalanguage in logic programming", in Clark KL, Taernlund S-A (eds,) , Logic Programming, London: Academic Press, 153-172, 1982.

[BKNT77] Bobrow, D.G., Kaplan, R.M., Norman, D.A., Thompson, H. and Winograd, T., "GUS, A Frame-Driven Dialog System", Artificial Intelligence, Vol. 8, pp. 155-173, 1977.

[BL84a] Brachman, R. J., and Levesque, H. J., "The Tractability of Sub

sumption in Frame-Based Description Languages," Proc. AAAI-84, Austin, TX, August, 1984, pp. 34-37.

[BL84b] Brachman RJ. and H.J. Levesque, "What Makes a Knowledge Base Knowledgeable? A View of Databases from the Knowledge Level", Proceedings of the First International Workshop on Expert Database Systems, Kiawah Island, SC, USA, October, 1984.

[BLAS80] Blaser, A. (ed,) , Database Techniques for Pictorial Applications, Springer-Verlag: New York, New York, 1980.

[BLP84] Brachman, R. J., H. J. Levesque, and P. F. Patel-Schneider, "What Makes a Knowledge Base Knowledgeable? A View of Databases from the Knowledge Level," in L. Kerschberg (ed.), Expert Database Systems, Proc. First IntI. Workshop on Expert Database Systems, Kiawah Island, S.c., October 1984.

[BLUM82] Robert L. Blum, "Discovery and Representation of Causal Relationships from a Large Time-Oriented Clinical Database: The RX Project", Lecture Notes in Medical Informatics No. 19, Lindberg and Reichertz (eds,), Springer-Verlag, New York, 1982, 242 pp.

[BM84] Bachant, J. and J. McDermott, "Rl revisited: four years in the trenches". The AI Magazine, Vol. 5, No.3, 1984.

[BM86] Brodie, M. L., and Mylopoulos, J. "Knowledge Bases and Databases: Semantic vs Computational Theories of Information", New Directions for Database Systems, Gad Ariav and Jim Clifford (Eds,) , Ablex Publishing Co., New York, to appear 1986. Also Computer Corporation of America Report CCA-TR-85-01.


[BMN84] Gallaire, H., J. Nicolas, J. Minker, Advances in Database Theory, Vol. 2, Plenum Press, New York 1984.

[BMP8I] Ben-Ari, M., Manna, Z. and Pnueli, A "The temporal logic of branching time.", In 8th ACM POPL Symposium, January, 1981. pp.164-176.

[BMS83] Brodie, M., J. Mylopoulos, J. Schmidt, Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, Springer-Verlag, 1983.

[BMS84] Brodie, M.L., J.Mylopoulos and J.W.Schmidt, Eds. On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, Springer Verlag, New York, 1984.

[BMW82] Borgida A, Mylopoulos J, Wong HKT, "Methodological and computer aids for interactive information systems development", in Schneider HJ, Wasserman AI (eds.), Automated Tools/or In/ormation Systems Development, Amsterdam: North-Holland, pp. 109-124, 1982.

[BMW84] Borgida, A., J. Mylopoulos, and H. K. T. Wong, "Generalization/Specialization as a Basis for Software Specification," in [BMS84], pp. 87-114.

[BMW86] Borgida, A, Mitchell, T., and Williamson, K., "Learning Improved Integrity Constraints and Schemas from Exceptions in Databases and Knowledge Bases", in this volume.

[BORG85a] Borgida, A, "Features of languages for the development of Information Systems at the Conceptual level", IEEE SOFTWARE, Vol.2, No.1, pp.63-73, January 1985.

[BORG85b] Borgida, A., "Language features for flexible handling of exceptions in Information Systems", ACM Trans. on Database Systems, Vol. 10, No.4, December 1985.

[BP83] Barwise, J. and Perry, J., Situations and Attitudes, MIT Press, Cambridge MA, 1983.

References 599

[BPL85] Brachman, R, V. Pigman, and H. Levesque, "An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of Krypton," in Proc. Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, August, 1985, Vol I, pp. 532-539.

[BR84] Brodie, M. L., and D. Ridjanovic, "On the Design and Specification of Database Transactions," in [BMS84].

[BRAC77] Brachman R.l, "A Structural Paradigm for Representing Knowledge," (Ph.D. Thesis), Harvard University, May 1977.

[BRAC80] Brachman, R. l, "An Introduction to KL-ONE", in R. J. Brachman, et al. (eds.) , Research in Natural Language Understanding, Annual Report, Bolt, Beranek and Newman, Inc., Cambridge, Massachusetts, 1980.

[BRAD82] Brady, M., Computational Models of Discourse, MIT Press, Cambridge MA, 1982.

[BRAT83] Bratman, M., "Taking Plans Seriously", Social Theory and Practice, 9:271-287, 1983.

[BROD80] Brodie, M. L., "The Application of Data Types to Database Semantic Integrity", Information Systems, Vol 5, No.4, 1980.

[BROD84] Brodie, M. L., "On the Development of Data Models," in [BMS84], 1984.

[BROD85] Brodie, M. Summary of Panel Discussion on Knowledge Base Management Systems, Kiawah Workshop on Expert Database Systems, October 1984.

[BROW80] Browning, S.A., "A Tree Machine," Lambda Magazine, 1 (2): 31-36, 1980.

[BS78] Brodie, M. and H. Schmidt, "What is the use of abstract data types in databases?", Proceedings of the 1978 VLDB Conference, pp. 140-141, 1978.

References 601

[CDG84] Carey, M., DeWitt,D., and G. Graefe, "Concurrency Control and Recovery for PROLOG - A Proposal", in Expert Database Systems, Benjamin/Cummings Publishing Co, to appear.

[CDKK85] Chou, H.T., DeWitt, D.J., Katz, R., and A. Klug,Design and Implementation of the Wisconsin Storage System, Software Practice and Experience, August, 1985.

[CFLR81] Chan, A., S. Fox, K. Lin, and D. Ries, "The Design of an Ada Compatible Local Database Manager," Technical Report CCA-81-09, Computer Corporation of America, Cambridge, Mass., 1981.

[CFM84] Chakravarthy US, Fishman D, Minker J, "Semantic query optimization in expert systems and database systems", iIi [KERS84], 1984.

[CH79] Chandra, A.K., D. Harel, "Computable Queries for Relational Databases", in Proc. 11th. Sym. on Theory oj Computing, 1979.

[CH80] Chandra, A. and Harel, D., "Computable Queries for Relational Data Bases", JCSS 21, 156-178, 1980.

[CH82a] Chandra, A. and Harel, D. , "Horn Clauses and the Fixpoint Query Hierarchy", Proceedings First PODS, 1982.

[CH82b] Chandra, A. and Harel, D., "Structure and Complexity of Relational Queries", JCSS 25, 99-128, 1982.

[CH82c] Chandra, A., D. Harel, "Horn Clause Queries and Generalization", ACM SIGACT-SIGMOD Symposium on Principles oj Database Systems, 1982.

[CHAN78] Chang, C. L., "DEDUCE 2: Further Investigations of Deduction in Relational Data Bases", in H. Gallaire, 1 Minker (eds,), Logic and Data Bases, Plenum Press: New York, New York, 1978.

[CHAN81] Chang, C., "On the Evaluation of Queries Containing Derived Relations in Relational Database", in Advances in Data Base Theory' Vol.1. H.Gallaire, 1 Minker and 1M. Nicolas (eds.), Plenum Press, New York, pp 235-260, 1981.


[CHAN82] Chan, A., et ai, "The Implementation of an Integrated Concurrency Control and Recovery Scheme", Proceedings of the 1982 SIGMOD Conference, Orlando, Florida, 1982.

[CHAN85] Chandrasekaran, B., "Generic Tasks in Expert System Design and Their Role in Explanation of Problem Solving", Proceedings of the Workshop on AI and Distributed Problem Solving, May, 1985.

[CHEI85] Cheikes, B., "Monitor Offers on a Dynamic Database: The search for relevance", Technical Report CIS-85-43, Dept. of Computer and Information Science, University of Pennsylvania, October, 1985.

[CHEN76] Chen, P.P.S., "The Entity-Relationship model: towards a unified view of data.," ACM Trans. on Database Systems, Vol. 1, No.1, March 1976, pp. 9-36.

[CHEN84] Cheng, J. et. aI., "IBM Database 2 Performance: Design, Implementation and Tuning", IBM Systems Journal, February 1984.

[CHER84] 0 Cherniak, C., "Computational Complexity and the Universal Acceptance of Logic," in The Journal of Philosophy, Vol. LXXXI, No. 20, December, 1984.

[CHES80] Chester, D., "HCPRVR: an Interpreter for Logic Programs," Proceedings of the National Conference on Artificial Intelligence, 1980.

[CL73] Chang, C., R. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

[CL81] Clancey, W.J. and Letsinger, R., "NEOMYCIN: Reconfiguring a Rule-Based Expert System", Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vol. 2, 1981, pp. 829-836. Reprinted in [CS84].

[CLAN84] Clancey, W. J., "Classification Problem Solving", Proceedings of the National Conference on Artificial Intelligence (AAAI-84), pp. 49-55, August, 1984.

References 603

[CLAR78] Clark, K., "Negation as Failure", in [GM78], 1978.

[CLAR79] D. W. Clark, "Measurements of Dynamic List Structure Use in Lisp," IEEE Transactions on Software Engineering, Vol. SE-5, Num. 1, January 1979, pp. 51-59.

[CLEM811 Clemons, E., "Design of an External Schema Facility to Define and Process Recursive Structures," Proceedings of the ACM Transactions on Database Sytems, Vol.6, No.2, June 1981, pp. 81-92.

[CM811 Clocksin, W. and Mellish, C., Programming in Prolog, SpringerVerlag, Berlin, Germany, 1981.

[CM82] Conklin, 1. and McDonald, D., "Salience: the key to the selection problem in natural language generation", Proceedings of the 20th Annual Meeting, pages 129-135. Assoc. for Computational Linguistics, University of Toronto, June, 1982.

[CM84] Copeland, G. and D. Maier, "Making Smalltalk a Database System", Proceedings of the 1984 SIGMOD Conference, Boston, Ma., 1984.

[CMS83] Cammarata, C., D. McArther, and R. Steeb, "Strategies of Cooperation in Distributed Problem Solving," Proc. IlCAI83, Karlsruhe, August 1983.

[CMT82] Chakravarthy, U. S., 1. Minker, and D. Tran, "Interfacing Predicate Logic Languages and Relational Databases", First International Logic Programming Conference, France, September 1982.

[CODD70] Codd, E. F., "A relational model for large shared data banks", Comm. ACM, Vol. 13, No.6, pp. 377-387, June 1970.

[CODD72] Codd, E.F., "Relational Completeness of Database Sublanguages", Data Base Systems (Ed. R. Rustin), Prentice Hall, 1972.

[CODD79] Codd, E.F., "Extending the database relational model to capture more meaning," ACM Trans. on Database Systems, Vol. 4, No.4, December 1979, pp. 395-434.


[COHE78] Cohen, P., "On Knowing What to Say: Planning Speech Acts", Technical Report 118, Dept. of Computer Science, Univ. of Toronto, January, 1978.

[CORE85] Corella, F., "Semantic Retrieval and Levels of Abstraction", In L. Kerschberg (editor), Expert Database Systems, Benjamin Cummings, New York, 1985.

[CP84] Ceri, S., Pelagatti, G.: Distributed Databases. Principles and Systems, McGraw-Hill, 1984.

[CPA81] Cohen, P.R., Perrault, C.R. and Allen, J., "Beyond Question Answering." In W. Lehnart & M. Ringle (Eds.), Strategies for Natural Language Processing, Lawrence Erlbaum Associates, Hillsdale, NJ., 1981.

[CS79] Chang, C., J. Slagle, Using Rewriting Rules for Connection Graphs to Prove Theorems, Artificial Intelligence 12, 2, 1979.

[CS84] Clancey, W. J. and Shortliffe, E. H., Readings in Medical ArtifiCial Intelligence: The First Decade, Addison Wesley, 1984.

[CULL85] R. E. Cullingford, Natural Language Processing: A Knowledge Engineering Approach, Totawa: Allanheld & Rowman, 1985. (In press)

[CW84J! Chang, C. and Walker, A., "PROSQL: A Prolog Programming Interface with SQLlDS", Proc. 1st International Conference on expert Data Bases, Kiowah, S.C., Oct 1984.

[DATE81] Date, C.J., An Introduction to Databases Systems, 3rd ed., Addison-Wesley, Reading, MA, 1981.

[DATE83] Date, C. J., An Introduction to Databases Systems, Volume II, Addison-Wesley, Reading, MA, 1983.

[DAVI79] Davis, R., "Interactive Transfer of Expertise", ArtifiCial Intelligence, 12(2):121-157, 1979.

References 605

[DAVI84] Davis, R., "Diagnostic Reasoning Based on Structure and Behavior", Artificial Intelligence, Vol. 24, 1984, pp. 347-410.

[DAYA83] Dayal, u., "Processing Queries over Generalization Hierarchies in a Multidatabase System," Proc. Ninth International Conference on Very Large Data Bases, October 1983.

[DAYA85] Dayal, V., "Query Processing in a Multidatabase System", in W. Kim, D. Reiner, D. Batory (eds.), Query Processing in Database Systems, Springer-Verlag: New York, New York, 1985.

[DCF82] deCastilho, J.M.V., M.A. Casanova, and A.L. Furtado. "A temporal framework for database specifications.", In Proceedings 8th VLDB Conference, Mexico, September 1982. pp. 280-291.

[DDSS77] deKleer, J., Doyle, J., Steele, G., and Sussman, G. J., "AMORD: Explicit Control of Reasoning", Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, 1977, pp. 116-125.

[DEJ082] Dejong, G., "Automatic Schema Acquisition in a Natural Language Environment", in Proceedings of the Second National Conference on ArtifiCial Intelligence, pages 410-413, Pittsburgh, P A, August, 1982.

[DEWI79] DeWitt, D.l., "DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems", IEEE Transactions on Computers, June 1979, pp. 395-406.

[DEWI84] D. J. DeWitt et aI, "Implementation Techniques for Main Memory Database Systems," Proc. SIGMOD 84, Boston, June 1984, pp. 1-8.

[DF84] Deering, M., and J. Faletti, "Database Support for Storage of AI Reasoning Knowledge," in L. Kerschberg (ed.), Expert Database Systems, Proc. First IntI. Workshop on Expert Database Systems, Kiawah Island, S.C., October 1984.


[DHMR84] Dayal, U., H. Y. Hwang, F. Manola, A. Rosenthal, and 1. M. Smith, "Knowledge-Oriented Database Management, Phase I, Final Technical Report", CCA-84-02, Computer Corporation of America, Cambridge, Mass., August 1984.

[DJ85] Dhar V, Jarke M, "Learning from prototypes", Proceedings Sixth International Conference on Information Systems, Indianapolis, In, 1985.

[DJNY83] Davis, e.G., SJajodia, P.A.Ng, R.Yeh (eds). Entity-Relationship approach to Software Engineering, North Holland, 1983.

[DK75] Davis, R., and 1. King, "An Overview of Production Systems," Memo AIM-271, Stanford Artificial Intelligence Laboratory, 1975.

[DOYL79] Doyle, 1., "A Truth Maintenance System", Artificial Intelligence, Vol. 12, 1979, pp. 231-272.

[DS83] Davis R, Smith, RG, "Negotiation as a metaphor for distributed problem solving", Artificial Intelligence, 20, 63-109, 1983.

[DSHL82] Daniels, D., P. Seliger, L. Haas, B. Lindsay, C. Mohan, A. Walker, and P. L. Wilus, "An Introduction to Distributed Query Compilation in R *", in Distributed Databases, H. 1. Schneider (ed.), 1982, pp. 291-309.

[DST80] Downey PJ, Sethi R, Tarjan RE, "Variations on the common subexpression problem", Journal of the ACM, 27, 4, 758-771, 1980.

[EGLT76] Eswaren, K. P., 1. N. Gray, R. Lorie, and I. L. Traiger, "The Notions of Consistency and Predicate Locks in a Database System", Communication ACM, 19, 11, November 1976.

[EHLR80] Erman L.D., F. Hayes-Roth, V.R. Lesser, and D.R. Reddy, "The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty", Computing Surveys, Vol. 12, No.2, June 1980, pp. 213-253.

[ENDE72] Enderton, H.B. "A mathematical introduction to logic" Academic Press, 1972.

References 607

[ERIC78] Erickson, R. D., "Optimality of stationary halting policies and finite termination of successive approximations", TR - 33, Dept. of OR, Stanford Univ.

[ESWA75]/ Eswaren, K., "A General Purpose Trigger Subsystem and Its Inclusion in a Relational Data Base System", RJ 1833, IBM Research, San Jose, Ca., July 1975.

[FAGI81l Fagin R, "A normal form for relational databases that is based on domains and keys", ACM Transactions on Database Systems, 6:3, 387-415, 1981.

[FAHL77] Fahlman, S. E., NETL: A System jor Representing and Using Real World Knowledge, MIT Press, 1979.

[FAHL79] Fahlman, S.E., NETL: A System jor Representing and Using RealWorld Knowledge, MIT Press, 1979.

[FB81] Feldman, J.A. and D.H. Ballard, "Computing with Connections," TR7, Department of Computer Science, University of Rochester, 1981.

[FBL71l Feigenbaum, E.A., Buchanan, B.G. and Lederberg, J., "On Generality and Problem Solving: A Case Study Using the DENDRAL Program", in Machine Intelligence 6, Meltzer, B. and Michie, D. (eds.), American Elsevier, New York, 1971, pp. 165-190.

[FC85] Furtado A, Casanova M, "Updating relational views", in Kim W, Reiner D, Batory DS (eds.), Query Processing in Database Systems, New York: Springer-Verlag, 206-217, 1985.

[FCKH80] Friedell, M., R. Carling, D. Kramlich, and C. F. Herot, "The Management of Very Large Two-Dimensional Raster Graphics Environments", Workshop on Picture Data Description and Management, August 1980.

[FIND79] Findler, N.V., "Associative Networks: Representation and Use of Knowledge by Computer", Academic Press, New York, 1979.


[FLRR84] Fox, S., T. Landers, D. R. Ries, and R. Rosenberg, DAPLEX User's Manual, Computer Corporation of America, Cambridge, Massachusetts, 1984.

[FM77] Forgy, C. L., and 1. McDermott, "OPS - A Domain-Independent Production System Language", Fifth International Joint Conference on Artificial Intelligence, Cambridge, Massachusetts, 1977.

[FORG79] Forgy, C. L., "On the Efficient Implementation of Production Systems," Ph. D. Dissertation, Carnegie-Mellon University, 1979.

[FORG811 Forgy, C., "OPS5 User's Manual", Technical Report No. CMUCS-81-135, Carnegie-Mellon University, 1981.

[FORG82] Forgy, C.L., "Rete: a fast algorithm for the many pattern/many object pattern match problem", Artificial Intelligence, Vol 19, No 1, 1982.

[FORG84] C. L. Forgy, "The OPS83 Report," Department of Computer Science, Carnegie-Mellon University, May 1984.

[FOX79] Fox M.S., "On Inheritance in Knowledge Representation", Proceedings of the Sixth International Joint Conference on Artificial Intelligence, pp. 282-284, Tokyo Japan, 1979.

[FS84] Fox M., and S. Smith, "ISIS: A Knowledge-Based System for Factory Scheduling", International Journal of Expert Systems, Vol. 1, No.1, 1984.

[FSG84] Fox M., A. Sathi, and M. Greenberg, "The Application of Knowledge Representation Techniques to Project Management", Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems, Colorado, 1984.

[FSG85] Sathi A., Fox M., and M. Greenberg, "Representation of Activity Knowledge for Project Management", IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. PAM-7, No.5, September 1985, pp. 531-552.

References 609

[FWA84] Fox M.S., lM. Wright, and D. Adam, "Experiences with SRL: An Analysis of a Frame-based Knowledge Representation", Proceedings of the First International Workshop on Expert Database Systems, Kiawah Island, SC, 1984.

[GARC83] Garcia-Molina, H., "Using Semantic Knowledge for Transaction Processing in a Distributed Database," ACM Transactions on Database Systems, Vol. 8, No.2, June 1983.

[GAZD79] Gazdar, G., "A Solution to the Projection Problem", in Oh, c.-K. and Dinneen, D. (editors), Syntax and Semantics, pages 57-90. Academic Press, New York, 1979.

[GB80a] Goldstein, I. P., D. G. Bobrow, "A Layered Approach to Software Design", in D. Barstow, H. Shrobe, G. Sandwall (editors) Interactive Programming Environments IP [GB80b] Goldstein, I. P., D. G. Bobrow, "Descriptions for a Programming Environment", Proc. ist Ann. Con/. Am. Assoc. Art. int., (August 1980).

[GB8I] Goldstein, I. P., D. G. Bobrow, "Layered Networks as a Tool for Software Development", Proceedings 7th International Joint Conference on AI, August 1981.

[GBM82] Greenspan, S., A. Borgida, and lMylopoulos. "Capturing more world knowledge in the requirements specification", Proc. 6th International Conference on Software Engineering, Tokyo, 1982.

[GBW83] Geschke, M. l, R. A. Bullock, and L. E. Widmaier, "TAC*II -An Expert Knowledge Based System for Tactical Decision Making," Master's Thesis, Naval Postgraduate School, Monterey, CA, June 1983.

[GENE83] Genesereth, M. R., "MRS: a metalevel representation system", HPP - 83 - 28, Dept. of CS, Stanford Univ., 1983.

[GHW82] Guttag, l, lHorning, and lWing. "Some Notes on Putting Formal Specifications to Productive Use", Xerox PARC Report CSL-82-3, June 1982.


[GJW83] Grosz, B., Joshi, A.K. and Weinstein, S., "Providing a Unified Account of Definite Noun Phrases in Discourse", Proc. 21st Annual Meeting, pages 44-50. Assoc. for Computational Ling., Cambridge MA, June, 1983.

[GKLS81] Goodman. N., R. Katz, T. Landers, J. M. Smith, and L. Yedwab, "Database Integration and Incompatible Data Handling in MUL TIBASE - A System for Integrating Heterogeneous Distributed Databases," Technical Report CCA-81-06, Computer Corporation of America, Cambridge, Mass., May 1981.

[GLH83] H. Garcia-Molina, R. Lipton, and P. Honeyman, "A Massive Memory Database System," Technical Report 314, Department of Electrical Engineering and Computer Science, Princeton University, May 1983.

[GLV84] H. Garcia-Molina, R. Lipton, and J. Valdes, "A Massive Memory Machine," IEEE Transactions on Computers, Vol. C-33, Num. 5, May 1984, pp. 391-399.

[GM78] Gallaire, H. and Minker, J. (eds.), Logic and Data Bases. New York, Plenum Press, 1978.

[GMB82] Greenspan, S., J.Mylopoulos, A. Borgida, "Capturing more world knowledge in the requirements specification", Proc. 6th International Conference on Software Engineering, Tokyo, 1982.

[GMN81] Gallaire, H., J. Nicolas, J. Minker, Advances in Database Theory, Vol. 1, Plenum Press, New York 1981.

[GMN84] Gallaire, H.,J. Minker, J. Nicolas, Advances in Database Theory, Plenum Press, Vol. 2, 1984.

[GOLD70] Goldman, A., A Theory of Human Action, Prentice-Hall Inc., Englewood Cliffs NJ, 1970.

[GR83] Goldberg, A. and D. Robson, Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.

References 611

[GRAY781! Gray, J., "Notes on Data Base Operating Systems", RJ 2254, IBM Research, San Jose, Ca., August 1978.

[GRAY79] Gray, J., "Notes On Database Operating Systems", in Operating Systems: An Advanced Course, R. Bayer, R. M. Graham and G. Seegmuller (edsJ, pp. 393-481, Springer-Verlag, 1979.

[GRAY81] Gray J, "The transaction concept -- virtues and limitations", Proceedings 7th Very Large Data Base Conference, Cannes, 144-154, 1981.

[GRAY83] J. Gray, "What Difficulties Are Left in Implementing Database Systems", Invited Talk at SIGMOD Conference, San Jose, CA., May 1983.

[GREE83] Greenberg M., "RETINAS User's Manual", Internal report, Robotics Institute, Carnegie-Mellon University, Pittsburgh PA, 1983.

[GREE84] Greenspan, S. "Requirements modeling: A knowledge representation approach to software requirements definition", Ph.D. Thesis, Dept. of Computer Science, University of Toronto, 1984; also CSRG Report No. 155.

[GREW83] Grewendorf, G., "What Answers can be Given?", in F. Kiefer (editor), Questions and Answers, pages 45-84. D. Reidel Publishing Company, 1983.

[GRIC75] Grice, H. P., "Logic and Conversation",. in P. Cole and J.L. Morgan (editors), Syntax and Semantics, Academic Press, New York, 1975.

[GS82] Guttman, A. and M. Stonebraker, "Using a Relational Database Management System for Computer Aided Design Data", IEEE Database Engineering, Vol. 5, No.2, June, 1982.

[GSP76] Gorry, G. A., Silverman, H., and Pauker, S. G., "Capturing Clinical Expertise: A Computer Program that Considers Clinical Responses to Digitalis", American Journal of Medicine, Vol. 64, March, 1978, pp. 452-460.


[GSP78] Gorry, G. A, Silverman, H., and Pauker, S. G., "Capturing Clinical Expertise: A Computer Program that Considers Clinical Responses to Digitalis", American Journal of Medicine, Vol. 64, pp. 452-460, March, 1978.

[GUTT84] Guttman, A, "R-Trees: A Dynamic Index Structure for Spatial Searching", Proceedings of the 1984 SIGMOD Conference, Boston, Ma., 1984.

[HAGM83] Hagmann, R., "Preferred classes: a proposal for faster Smalltalk-80 execution", in Smalltalk-80: Bits of History, Words of Advice, G. Krasner, Editor, Addison-Wesley, 1983, pp. 323-330.

[HAGM84] R. Hagmann, "A Crash Recovery Scheme for a Memory Resident Database System," Unpublished manuscript, July 1984.

[HALS79] Halstead, R.H., "Reference Tree Networks: Virtual Machine and Implementation," MIT/LCS/TR-222, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA, 1979.

[HARM85] G. H. Harman, Reasoned Revision of Belief.

[HAYE76] Hayes-Roth, F. "Patterns of Induction and Associated Knowledge Acquisition Algorithms", In Chen, C. (editor), Pattern Recognition and Artificial Intelligence. Academic Press, New York, 1976.

[HAYE85] Hayes, P., "Some problems and non-problems in representation theory" in Readings in Knowledge representation, Brachman, R., and Levesque, H., (eds), Morgan Kaufman, Los Altos, 1985.

[HB80] Hammer, M. and B.Berkowitz, "DIAL: A programming language for data intensive applications," Proc. ACM-SIGMOD Conference, May 1980, pp. 75-92.

[HCR84] Hasling, D., Clancey, W. and Rennels, G., "Strategic Explanations for a Diagnostic Consultation System", Inti J. of Man-Machine Studies, 20:3-20, January, 1984.

References 613

[HD82] Hawthorn, Paula B. and David J. DeWitt, "Performance Analysis of Alternative Database Machine Architectures," IEEE Transactions on Software Engineering, SE-8 0): 61-74, 1982.

[HEND75] Hendrix, G. "Expanding the Utility of Semantic Networks Through Partitioning", Proceedings IJCAI-75, Tbilisi, USSR, 1975.

[HEWI71] Hewitt, C., "Planner: A Language for Proving Theorems in Robots", Proc. 1971 Internation Joint Conference on Artificial Intelligence, 1971.

[HEWI72] Hewitt, c., Description and Theoretical Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot, Ph.D. thesis, Dept. of Mathematics, MIT, Cambridge, MA, 1972.

[HEWI80] Hewitt, C.E., "The Apiary Network Architecture for Knowledgeable Systems," Proceedings of Lisp Conference, Stanford, 107-118, 1980.

[HEWI85a] Hewitt C, "Implications of open systems", in larke M (ed.) , Managers, Micros, and Mainframes: Integrating Systems for End Users, London: John Wiley & Sons, 1985.

[HEWI85b] Hewitt, C., "The Challenge of Open Systems", presented at the Artificial Intelligence Conference, Capri, Italy, 1985.

[HH80] Haas N, Hendrix GG, "An approach to acquiring and applying knowledge", Technical Note 227, SRI International, Menlo Park, Ca, 1980.

[HHW84] Hollan, J., Hutchines, E. and Weitzman, 1., "STEAMER: An Interactive Inspectable Simulation-based Training System", AI Magazine, 5(2):15-28, Summer, 1984.

[HILL85] Hillis, W. Daniel, The Connection Machine, The MIT Press, 1985.

[HIRS85] Hirschberg, J., "Scalar Implicature", PhD thesis, University of Pennsylvania, December, 1985.


[HL82] Haskin, R. and R. Lorie, "On Extending the Functions of a Relational Database System", Proceedings of the 1982 ACM SIGMOD Conference, Orlando, FL, 1984, pp. 207-212.

[HM75] Hammer, M. M., and D. J. McLeod, "Semantic Integrity in a Relational Data Base System," Proc. International Conference on Very Large Data Bases, September 1975.

[HM8I] Hammer, M. and D.McLeod, "Database description with SDM: a semantic data model," ACM Trans. on Database Systems, Vol. 6, No.3, Sept. 1981.

[HMN83] Henschen LJ, McCune WW, Naqvi SA, "Compiling constraintchecking programs from first-order formulas", in Gallaire H, Minker J, Nicolas J-M (eds.) , Advances in Database Theory 2, New York: Plenum Press, 145-169, 1983.

[HN84] Henschen, 1. J. and S. A. Naqvi, "On compiling queries in recursive first-order databases", J. ACM, Vol. 31, No.1, pp. 47-85, January, 1984.

[HOLL8I] Holland, John H., "Genetic Algorithms and Adaptation," Technical Report No. 34, University of Michigan, 1981.

[HOPF82] Hopfield, J.1., "Neural Networks and Physical Systems with Emergent Collective Computational Abilities," Proceedings of the National Academy of Sciences USA, (79): 2554-2558, 1982.

[HR79] Hobbs, J. and Robinson, J., "Why Ask?", Discourse Processes, 2, 1979.

[HR85] Heiler, S. I., and Rosenthal, A., "G-WHIZ: A Visual Interface for the Functional Model with Recursion", submitted to 11th International Conference on Very Large Data Bases, 1985.

[HS84] Hinton, G.E. and T.J. Sejnowski, "Learning semantic features," Proceedings of the Sixth Annual Conferences of the Cognitive Science SOCiety, Boulder, CO, 1984.

References 615

[HWL83] Hayes-Roth, F., D. A. Waterman, and D. B. Lenat, BUilding expert Systems, Addison-Wesley, Reading, Mass., 1983.

[HZ80] Hammer, M. and S. Zdonik, "Knowledge-based query processing", Proc. 6th VLDB Conference, Montreal, 1980, pp.137-147.

[IEEE77] IEEE Trans. on Software Engineering, Vol. SE-3, No.1, January 1977.

[IMME82] Immerman N, "Relational queries computable in polynomial time", Proceedings 14th ACM Symposium on Theory of Computing, San Francisco, Ca, 147-152, 1982.

[IOAN84] loannides, Y., et aI., "Enhancing INGRES with Deductive Power", Proceedings of the 1st International Workshop on Expert Database Systems, Kiowah SC, October 1984.

[IOAN85] loannides, Y., "A Time Bound on the Materialization of some Recursively Defined Views", Proceedings of the Eleventh Conference on Very Large Data Bases, 1985.

[ISL84] ISL, "Intelligent Systems Laboratory Software Systems Manual", Internal report, Robotics Institute, Carnegie-Mellon University, Pittsburgh P A, 1984.

[ISRA83] Israel, D., "Interpreting Network Formalisms," in N.J. Cercone (ed.) , Computational LinguistiCS, International Series in Modern Applied Mathematics and Computer Science, Vol. 5, 1983, Pergamon Press, Toronto, pp. 1-13.

[JAME82] James, G., and W. Stoeller, "Operations on Tree-Structured Tables", X3H2-26-15 Standards Committee Working Paper, 1982, pp. 81-92.

[JARK84] Jarke M, "External semantic query simplification: a graphtheoretic approach and its implementation in PROLOG", in [KERS841, 1984.


[JARK85] Jarke M, "Common subexpression analysis in multiple query optimization", in Kim W, Reiner D, Batory DS (eds.) , Query Processing in Database Systems, New York: Springer-Verlag, 191-205, 1985.

[JARK86] Jarke M., "Control of Search and Knowledge Acquisition", in this volume, 1986.

[JCV84] Jarke M, Clifford J, Vassiliou Y, "An Optimizing PROLOG Front-end to a Relational Query System", Proceedings ACMSIGMOD Conference, Boston, Ma, 296-306, 1984.

[JIEH85] Jieh Hsiang, "Refutational Theorem Proving using TermRewriting Systems," in Artificial Intelligence, Vol. 25, March, 1985, pp. 225-300.

[JJS86] Jarke M, Jelassi MT, Shakun MF, "MEDIATOR: Towards a negotiation support system", to appear in Shakun MF (ed.), Evolutionary Systems Design: Policy Making under Complexity, San Francisco: Holden Day, 1986.

[JK83] Jarke, M. and J. Koch, "Range nesting: a fast method to evaluate quantified queries", Proc. ACM SIGMOD Conference, San Jose, 1983, pp.196-206.

[JK84] Jarke, M., Koch, J., "Query optimization in database systems", ACM Computing Surveys, 16:2, 1984, pp. 111-152.

[JOSH82] Joshi, A.K., "Mutual Beliefs in Question Answering Systems", in N. Smith (editor), Mutual Belief, Academic Press, New York, 1982.

[JS84]Jarke M, Shalev J, "A database architecture for supporting business transactions", Journal of MIS, 1: 1, 1984.

[JV83] Jarke, M., and Y. Vassiliou, "Coupling Expert Systems with Database Management Systems," NYU Symposium on Artificial Intelligence Application for Business, May 1983.

References 617

[JV84] Jarke M, Vassiliou Y, "Coupling expert systems with database management systems", in Reitman WR (ed,), Artificial Intelligence Applications for Business, Norwood, NJ: Ablex Publ., pp. 65-85, 1984.

[JWW84a] Joshi, A., Webber, B. and Weischedel, R., "Preventing False Inferences", Proceedings ofCOLING-84, Stanford CA, July, 1984.

[JWW84b] Joshi, A., Webber, B. and Weischedel, R., "Living Up to Expectations: Computing Expert Responses", Proceedings of AAAI-84, Austin TX, August, 1984.

[JWW84c] Joshi, A., Webber, B. and Weischedel, R., "Default Reasoning in Interaction", Proceedings of 1984 Workshop on Non-Monotonic Reasoning, AAAI, Menlo Park CA, October, 1984.

[KAPL82] Kaplan, J., "Cooperative Responses from a Portable Natural Language Database Query System", M. Brady (editor), Computational Models of Discourse, MIT Press, Cambridge MA, 1982.

[KBB83] Kaufman, C. W., J. Barnett, and B. T. Blaustein, "The DACOS Forms-Based Query System", Journal of Telecommunication Networks, 1983 (pp. 463-482).

[KELL86] Keller, A.M., "Choosing a View Update Translator by Dialog at View Definition Time, IEEE Computer, Jan.1986.

[KERS84] Kerschberg L, ed., Expert Database Systems, New York: SpringerVerlag, to appear, 1984.

[KHIS84] Kung, R., E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro, and M. Stonebraker, "Heuristic Search in Database Systems", Proc. First Int'l Workshop on Expert Database Systems, October 1984, pp. 96-107.

[KING80a] King, J., "Intelligent Retrieval Planning", Proc. 1st Natl. Con/. on AI, pp.243-245, August 1980.


[KING80b] King, J. "Modelling Concepts for Reasoning about Access to Knowledge, Proc.of the ACM Workshop on Data Abstraction, Data Bases, and Conceptual Modelling, Pingree Park CO, June 23--26, 1980, ACM-SIGPLAN Notices, Vol. 16, No.1, January 1981.

[KING81] King JJ, "QUIST: A system for semantic query optimization in relational data bases", Proceedings 7th VLDB Conference, Cannes, France, pp. 510-517, 1981.

[KK83] Kaehler, T. and T. Krasner, "LOOM - Large objected oriented memory for Smalltalk-80 systems", in Smalltalk-80: Bits of History, Words of Advice, G. Krasner, Editor, Addison-Wesley, 1983, pp. 323-330.

[KK84] Kotteman JE, Konsynski BR, "Dynamic metasystems for information systems development", Proceedings Fifth International Conference on Information Systems, Tucson, Az, 187-204, 1984.

[KKMF84] Kitakami H, Kunifuji S, Miyachi T, Furukawa K, Proceedings International Symposium on Logic Programming, Atlantic City, NJ, 131-142, 1984.

[KL80] Kung, H.T. and C.E. Leiserson, "Systolic Arrays," in Introduction to VLSI Systems, C.A. Mead and L.A. Conway, Addison-Wesley, sec. 8.3, 1980.

[KL84] Katz, R. H., T. J. Lehman, "Database Support for Versions and Alternatives of Large Design Files", IEEE Transactions on Software Engineering, Vol. SE-lO, No.2, March 1984.

[KON081] Konolige, K., "A Metalanguage Representation of Relational Databases for Deductive Question-Answering Systems", in Con! on Very Large Databases, Montreal, 1981.

[KOSH84] Koshafian, Setrag, A Building Blocks Approach to Statistical Databases, Ph.D. Thesis, Computer Sciences Department, University of Wisconsin, June, 1984.

[KOWA74] Kowalski, R., "Predicate logic as a programming language", Proc. 1974 IFIP Congress, pp. 569-574, North Holland, 1974.

References 619

[KOWA75] Kowalski, R., "A Proof Procedure Using Connection Graphs," 1. ACM, 22 (4), October, 1975, pp. 572-595.

[KOWA78] Kowalski, R., Logic for Data Description, In [GM78], 1978.

[KOWA79] Kowalski, R., Logic for Problem Solving, Elsevier, 1979.

[KOWA81] Kowalski RA, Logic as a database language, Imperial College, London, 1981.

[KP81] Koenig, S. and Paige, R., "A transformational Framework for the Automatic Control of Derived Data", Proceedings Seventh VLDB, Cannes, France, September 1981.

[KRAM86] Kramer, B. "Representing Control Knowledge", PhD thesis, Department of Computer Science, University of Toronto, (forthcoming).

[KRAS83] Krasner G, ed., Smalltalk-80, Reading, Mass: Addison-Wesley, 1983.

[KRB85] Kim, W., D. Reiner, and D. Batory (eds.), Query Processing in Database Systems, Springer-Verlag, New York, NY, February 1985.

[KRD85] Kim, W., Reiner, D. and Batory, D. (eds.), Query Processing in Database Systems, Springer-Verlag, 1985.

[KT81] Kellogg, C. and Travis, L., "Reasoning with Data in a Deductively Augmented Data Management System", H. Gallaire (editor), Advances in Data Bases, pages 261-295. Plenum Press, 1981.

[KT83] Kowalski, T., and D. Thomas, "The VLSI Design Automation Assistant: Prototype System", Proceedings of the 20th ACM-IEEE Design Automation Conference, June 1983.

[KUIP85] Kuipers, B., "Qualitative Simulation in Medical Physiology: A Progress Report", MIT/LCS/TM-280, MIT Laboratory for Computer Science, Cambridge, MA, June 1985.


[LAFU82] Lafue GME, "Semantic integrity dependencies and delayed integrity checking", Proceedings 8th VLDB Conference, Mexico City, 292-299, 1982.

[LAL82] Lang, K., Auld, R. and Lang, T., "The Goals and Methods of Computer Users", Int. l. Man-Machine Studies, 17:375-399, 1982.

[LBEF82] Litwin, W., J. Baudenant, C. Esculier, A. Ferrier, A. M. Glorieux, J. La Chimia, K. Kabbai, C. Moulinoux, P. Rolin, and C. Stranget, "SIRIUS Systems for Distributed Database Management," in Distributed Databases, H. J. Schneider (ed.), North Holland, 1982.

[LEHN811 Lehnert, W., "A Computational Theory of Human Question Answering", A. Joshi, B. Webber and I. Sag (editors), Elements of Discourse Understanding, chapter 6, pages 145-176. Cambridge University Press, 1981.

[LEVE77] Levesque, H., "A Procedural Approach to Semantic Networks", TR-105, Dept. of Computer Science, University of Toronto, 1977.

[LEVE811 Levesque, H. J., "The Interaction with Incomplete Knowledge Bases: A Formal Treatment," Proc. IlCAI-Bi, Vancouver, 1981, pp. 240-245.

[LEVE83] Levesque, H., The Logic of Incomplete Knowledge Bases, In [BMS83].

[LEVE84a] Levesque, H., "Foundations of a Functional Approach to Representation", Artificial Intelligence, 23(2):155-212, July, 1984.

[LEVE84b] Levesque, H. J., "The Logic of Incomplete Knowledge Bases," in [BMS841, pp. 165-186, 1984.

[LEVE84c] Levesque, H., "A fundamental tradeoff in Knowledge Representation and reasoning", Proc. of the CSCSIISCEIO Con!, London, Ontario, 1984.

[LEVE84d] Levesque, H., "A logic of explicit and implicit belief', in Proc. of the AAAI-B4 Conference, Austin, Texas, 1984.

References 621

[LEVI83] Levinson, S., Pragmatics, Cambridge University Press, Cambridge England, 1983.

[LEWI78] Lewis, H., "Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus," in Proc. 19th IEEE Symposium on Foundations o/Computer Science, 1978, pp. 35-47.

[LGSJ78] V.Lum, S.Ghosh, M.Scholnick, D Jefferson , S.Su, 1. Fry, T.Teorey, B.Yao, "1978 New Orleans Data Base Design Workshop Report", IBM Report RJ2554(33154)7113179.

[LIPS79] Lipski, W., On Semantic Issues Connected with Incomplete Information Databases, ACM Trans. on Database Systems 4,3, Sept. 1979.

[LITW84] Litwin, W., "MALPHA, A Multidatabase manipulation language", Proc. IEEEDEC, April, 1984.

[LOHM83] Lohman, G. M., et at., "Remotely Sensed Geophysical Databases: Experience and Implications for Generalized DBMS", ACM SIGMOD International conference on Management 0/ Data, 1983.

[LONG81] P. Proctor (ed.) , Longman Dictionary 0/ Contemporary English, Bath, UK: Longman Group, Ltd. 1981

[LONG83] Long, W. 1., "Reasoning About State from Causation and Time in a Medical Domain", AAAI, 1983.

[LORI81] Lorie, R. A. , "Issues in Database for Design Applications," IBM Research Report RJ3176, IBM Research Lab., San Jose, CA, July 1981.

[LP83] Lorie, R. and W. Plouffe, "Complex Objects and Their Use in Design Transactions", Proceedings 0/ the Engineering Design Applications o/the 1983 ACM-IEEE Database Week, San Jose, CA, May 1983.


[LR82] Landers, T., and R. L. Rosenberg, "An Overview of MULTIBASE," in Proc. 2nd International Symposium on Distributed Databases, H. J. Schneider (ed.) , Berlin, W. Germany, September 1982.

[Ll74a] Liskov, B., and lilIes, S., "Programming with Abstract Data Types," SIGPLAN Notices, Vol. 9, No.4, 1974.

[Ll74b] Liskov, B. and lilIes, S., "Specification Techniques for Data Abstraction", Transactions on Software Engineering, Vol. 1, No. 1, March 1975, 7-19.

[MACS83] "Macsyma Reference Manual -- Version 10", MIT Laboratory for Computer Science Report, Cambridge, Mass., January, 1983.

[MA1E83] Maier, D., The Theory of Relational Databases, Computer Science Press, Potomac, MD, 1983.

[MAYS80] Mays, E., "Failures in natural language systems: application to data base query systems", fIProc. First National Conference on Artificial Intelligence (AAAI), Stanford CA, August, 1980.

[MAYS83] Mays, E., "A Modal Temporal Logic for Reasoning about Change", Proc. 1983 Assoc. for Computational Linguistics Conference, Cambridge MA, June, 1983.

[MAYS85] Mays, E., "A Temporal Logic for Reasoning about Changing Data Bases in the Context of Natural Language Question-Answering", In L. Kerschberg (editor), Expert Database Systems, New York: Benjamin Cummings, 1985.

[MB85] Mylopoulos J, Brodie ML, "AI and databases: semantic vs. computational theories of information", in Ariav G, Clifford J (eds.), New Directions for Database Systems, Norwood, NJ: Ablex Publ, 1985.

[MBW80] 1. Mylopoulos, P. Bernstein and H.K.T. Wong, "A language facility for designing interactive database-intensive systems", ACM Trans. on Database Systems, Vol. 5, No.2, June 1980, pp. 185-207.

References 623

[MCAL80] D. McAllester, "An Outlook on Truth Maintenance," MIT AITR-551, August 1980.

[MCCA68] McCarthy, J. "Programs with common sense." In Semantic information processing, M.Minsky (editor), The MIT Press, 1968.

[MCCA80] McCarthy, J., "Circumscription, A Form of Non-Monotonic Reasoning", Artificial Intelligence i3, 1980.

[MCCA81] McCawley, J. Everything linguists ever wanted to know about logic, but were afraid to ask., University of Chicago Press, 1981.

[MCC083] McCoy, K., "Correcting Misconceptions: What to Say", CHi'83 Conference Human Factors in Computing Systems, Cambridge MA, December, 1983.

[MCC085] McCoy, K., "Correcting Object-related Misconceptions", Technical Report MS-CIS-85-57, University of Pennsylvania, Dept. of Computer and Information Science, 1985. Ph.D. Thesis.

[MCDE80] McDermott, J., "R1: An Expert in the Computer Systems Domain", Proceedings of the First Annual National Conference on Artificial intelligence, Stanford, CA, 1980.

[MCDE81] McDermott, D. "A temporal logic for reasoning about processes and plans." Technical Report 196, Dept. of Computer Science, Yale University, March, 1981.

[MCDE82a] McDermott, J. "Rl: A Rule-based Configurer of Computer Systems", Artificial intelligence, Vol. 19, No.1, 1984.

[MCDE82b] McDermott, J., "R1's Formative Years", Artificial intelligence Magazine, Vol. 2, No.2, 1982, pp. 21-29.

[MCDE83] McDermott, J. "Extracting Knowledge from Expert Systems", Proceedings of UCAI-83, Karlsruhe, West Germany, 1983.

[MCKE85] McKeown, K., Text Generation: Using Discourse Strategies and Focus Constraints to Generate Natural Language Text, Cambridge University Press, Cambridge, England, 1985.


[MCLE78] McLeod, D. "A semantic database model and its associated structured user interface", PhD Thesis, MIT, 1978.

[MCM82] Michalski, R.S., Carbonell, J.G. and Mitchell, T.M (eds.), Machine Learning: An Artificial Intelligence Approach, Tioga Press, 1982.

[MCM83] Michalski, R., Carbonell, J. and Mitchell, T., Machine Learning: An Artificial Intelligence Approach., Tioga Publishing Company, 1983.

[MCM85] Mitchell, T., Carbonell, J., and Michalski, R. (eds.), Machine Learning: A Guide to Current Research, Kluwer Academic Press, 1986.

[MD80] D. V. McDermott and J. Doyle, "Non-Monotonic Logic I," Artificial Intelligence, Vol. 13, 1980

[MERR84] Merrett, T. H., Relational Information Systems, Reston Publishing: Reston, Virginia, 1984.

[MINK78] Minker, J., "An Experimental Relational Database System Based on Logic", in H. Gallaire, J. Minker (eds.), Logic and Databases, Plenum Press: New York, New York, 1978.

[MINK81] Minker, J., "On Indefinite Databases and the Closed World Assumption", Univ. of Maryland Technical Report No. 1076, 1981.

[MINK82] Minker, J., On Indefinite Databases and the Closed World Assumption, 6th Conf. on Automated Deduction, New York, in Lecture Notes in Computer Science, no. 138, (ed. D. Loveland), Springer-Verlag, 1982.

[MINS75] Minsky, Marvin, "A Framework for Representing Knowledge", in The Psychology of Computer Vision, Winston, Patrick H. (ed.), McGraw-Hill, New York, 1975.

[MINS79] Minsky, M., "$K$-Lines: A Theory of Memory," Massachusetts Institute of Technology Artificial, Intelligence Laboratory Memo 516. Reprinted in Cognitive Science, (1980) 117-133, 1979.

References 625

[MITC82] Mitchell, T., "Generalization as Search", Artificial Intelligence 18(2), pp.203-226, March 1982.

[MITC83] Mitchell, T., "Learning and Problem Solving", Proc. of IJCAI 83, pp.1139-1151, Karlsrhue, Germany, August 1983.

[MITC86] Mitchell, T., Keller, R., and S. Kedar-Cabelli, "Explanation-Based Generalization: A Unifying View" Machine Learning, Vol. 1, No. 1, Kluwar Academic Press, January 1986.

[ML84] Mylopoulos, l and Levesque, H., "An Overview of Knowledge Representation", in On Conceptual Modelling: Perspectives From Artificial Intelligence, Databases and Programming Languages, Brodie, M., Mylopoulos, l, and Schmidt, l (edsJ, Springer-Verlag, 1984.

[MMS79] Mitchell, lG., Maybury, W., and R. Sweet, "Mesa Language Manual", Xerox Research Center, Palo Alto, CA, 1979.

[MMS85] Mitchell, T., Mahadevan, S. and Steinberg, L., "LEAP - A Learning Apprentice for VLSI Design", in Proceedings of the Ninth International Joint Conference on Artificial Intelligence, August 1985.

[MONT73] Montague, R. "The proper treatment of quantification in ordinary English." In lHintikka, lMoravics and P.Suppes (editors), Approaches to natural languages, Reidel, 1973. pp. 221-242.

[MOOR80] Moore, R., "Reasoning about Knowledge and Action", Technical Report 191, SRI International, 1980.

[MOOR84] Moore, R.C., "A Formal Theory of Knowledge and Action", in R.C. Moore and l Hobbs (editor), Formal Theories of the Commonsense World, Ablex Publishing, Norwood NJ, 1984.

[MORG84] Morgenstern M., "Constraint equations: declarative expression of constraints with automatic enforcement", Proceedings 10th VLDB Conference, Singapore, pp. 291-300, 1984.


[MOSE84] Moser, M., "Domain Dependent Semantic Acquisition", IEEE Computer Society (editor), Proc. First Con! on Artificial Intelligence Applications, pp. 13-18. IEEE, December, 1984.

[MPM82] Miller, R. A., Pople, H. E., Myers, 1. D., "INTERNIST-I, An Experimental Computer-Based Diagnostic Consultant for General Internal Medicine", New England Journal of Medicine, Vol. 307, August 19, 1982, pp. 468-476.

[MR84] Mercer, R. and Rosenberg, R., "Generating Corrective Answers by Computing Presuppositions of Answers, not of Questions", Proceedings of the 1984 Conference, pp. 16-19. Canadian Society for Computational Studies of Intelligence, University of Western Ontario, London, Ontario, May, 1984.

[MS81a] McKay, D. and Shapiro, S., "Using Active Connection Graphs for Reasoning with Recursive Rules", Proceedings 7th IJCAI, pp 368-374, 1981.

[MS81b] McLeod, D. and 1.M.Smith. "Abstraction in Databases", Proc. of Workshop on Data Abstraction, Databases and Conceptual Modelling, M.L. Brodie and S. ZilIes (eds,) , ACM SIGMOD Record VoU1, No.2, January 1981.

[MSS84] Mitchell, T.M., Steinberg, L.I., and Shulman, 1.S., "A Knowledge-Based Approach to Design", In Proceedings of the IEEE Workshop of PrinCiples of Knowledge-Based Systems, pages 27-34. IEEE, December, 1984.

[MW80] Mylopoulos, 1., and H. Wong, "Some Features of the TAXIS Data Model," Proc. 6th International Conference on Very Large Databases, Montreal, Que., Canada, October 1980.

[MW84]/ Missicoff, M. and Wiederhold, G., "Toward a Unified Approach for Expert and Data Base Systems", Proc. 1st International Conference on Expert Data Base Systems, Kiowah, S.C., Oct. 1984.

[MWM85] McKeown, K., Wish, M. and Matthews, K., "Tailoring Explanations for the User", Proceedings of the 1985 Conference, InCI Joint Conference on Artificial Intelligence, Los Angeles CA, August, 1985.

References 627

[MYL080] Mylopoulos, 1. "A Perspective for Research on Conceptual Modelling", Proceedings Pingree Park Workshop on Data Abstraction, Databases and Conceptual Modelling, Pingree Park, Colorado, 1980.

[NAIS83] Naish, L., "Automatic generation of control for logic programs", TR 83/6, Dept. of CS, Univ. of Melbourne, 1983.

[NAQV84] Naqvi, S., "Interfacing Prolog and Relational Databases: The Problem of Recursive Queries", Proceedings ist international Workshop on Expert Database Systems, Kiawha, October 1984.

[NAQV85a] Naqvi, S., Some Extensions to the Closed World Assumption, submitted for publication.

[NAQV85b] Naqvi, S., Negative Queries in Horn Databases, submitted for publication.

[NAUG85] Naughton, 1., Work in progress, Dept. of CS, Stanford Univ., 1985.

[NEWE80] Newell, A., "The Knowledge Level," Presidential Address, American Association for Artificial Intelligence, AAAI80, Stanford University, Stanford, CA (19 August 1980), in AI Magazine, Vol., No.2 (Summer 1981), pp. 1-20.

[NEWE82] Newell, A., "The Knowledge Level", ArtifiCial Intelligence, Vol. 18, No.1, 1982, pp. 87-127.

[NG78] Nicolas J-M, Gallaire H, "Data base: theory vs. interpretation", in [GALL 781, 1978.

[NH83] Naqvi, S. and Henschen, L., "Synthesizing Least Fixed Point Queries into Non-recursive Iterative Programs", Proceedings IJCAI 83, Karlsruhe, 1983.

[NHS84] Nievergelt, 1., Hinterberger, H., and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure", A CM Transactions on Database Systems, Vol. 9, No.3, (March 1984), pp. 38-71.


[NIC082] Nicolas J-M, "Logic for improving integrity checking in relational databases", Acta Informatica, 18, 227-253, 1982.

[NILS80] Nilsson, N., Principles of Artificial Intelligence. Tioga Publishing Company, 1980.

[NY78] Nicolas J-M, Yazdanian K, "Integrity checking in relational databases", in [GALL781, 1978.

[OGLL84] Overbeek, R.A, J. Gabriel, T. Lindholm and E.L. Lusk, "Prolog on Multiprocessors", Internal Report, Argonne National Laboratory, Argonne, Illinois 60439, 1984.

[OM84] Orenstein, J. A, and T. H. Merrett, "A Class of Data Structures for Associative Searching", ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984.

[OST84] Olle, T. W., H. G. Sol, and C. J. Tully (eds.), Information Systems Design Methodologies: A Feature Analysis, North Holland, Amsterdam, September 1984.

[PALE72] Palermo, F.P., "A data base search problem", Proceedings 4th Computer and Information Science Symposium, Miami Beach, 1972, pp.67-101.

[PGKS76] Pauker, S. G., Gorry, G. A, Kassirer, J. P., Schwartz, W. B., "Toward the Simulation of Clinical Cognition. Taking a Present Illness by Computer", The American Journal of MediCine, Vol. 60, June, 1976, pp. 981-996.

[PIL083] Pilote, M. "A Framework for the Design of Linguistic User Interfaces", PhD thesis, Department of Computer Science, University of Toronto, 1983.

[POLL85] Pollack, M., "Information Sought and Information Provided", Proceedings of CHI'85, pages 155-160. Assoc. for Computing Machinery (ACM), San Francisco CA, April, 1985.

References 629

[POPL82] Pople, H. E., Jr., "Heuristic Methods for Imposing Structure on Ill-Structured Problems: The Structuring of Medical Diagnostics", in Artificial Intelligence in Medicine, Szolovits, P. (ed.), Westview Press, Boulder, Colorado, 1982, pp. 119-190.

[PSS81] Patil, R. S., Szolovits, P., and Schwartz, W. B., "Causal Understanding of Patient Illness in Medical Diagnosis", Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vol. 2, 1981, pp. 893-899. Reprinted in [CS841.

[PSS82] Patil, R. S., Szolovits, P., and Schwartz, W. B., "Information Acquisition in Diagnosis", Proceedings of the National Conference on Artificial Intelligence, 1982, pp. 345-348.

[PTK85] Poggio, T., V. Torre, and C. Koch, "Computational vision and regularization theory," Nature, Vol. 317: 314-313, 1985.

[QR68] Quillian, M. Ross, "Semantic memory," in Semantic Information Processing, M. Minsky (ed,), MIT Press, 227-270, 1968.

[RBFG80] Rothnie, 1. B., P. A. Bernstein, S. Fox, N. Goodman, M. Hammer, T. A. Landers, C. Reeve, D. W. Shipman, and E. Wong, "Introduction to a System for Distributed Databases (SDD-l), ACM Trans. Database Systems. 5, 1, March 1980.

[RBS84] Rychener, M. D., R. Banares-Alcantara, and E. Subrahmanian, "A Rule-Based Blackboard Kernel System: Some Principles in Design," Proc. IEEE Workshop on Principles of Knowledge-Based Systems, December 1984.

[REED83] Reed, D., "Implementing Atomic Actions on Decentralized Data", ACM Transactions on Computer Systems, V 1, N 1, (March 1983).

[REIN84] IEEE Database Engineering Newsletter, D. Reiner (ed,), Special Issue on Database Design Techniques, Tools, and Environments December 1984.

[REIT77] Reiter, R., "An Approach to Deductive Question-Answering", BBN tech. report no. 3649.


[REIT78a] Reiter, R., Deductive Q-A on Relational Databases, In [GM781.

[REIT78b] Reiter, R., On Closed World Databases, In [GM781.

[REIT78c] Reiter, R., "Reductive Question-Answering on Relational Data Bases", in H. Gallaire, 1. Minker (eds,) , Logic and Data Bases, Plenum Press: New York, New York, 1978.

[REIT80] Reiter, R., Equality and Domain Closure in First-Order Databases, J. of the ACM 27,2, 1980.

[REIT83a] Reiter, R., "Circumscription Implies Predicate Completion (Sometimes)", Proc. of AAAI Con/., Pittsburgh 1982.

[REIT83b] Reiter, R., Towards a Logical Reconstruction of Relational Database Theory, In [BMS831.

[REIT84] Reiter, R., "Towards a Logical Reconstruction of Relational Database Theory," in [BMS84], 1984.

[REQU80] Requicha, A. G., "Representations for Rigid Solids: Theory, Methods, and Systems", ACM Computing Surveys, 12, 4, December 1980.

[RF82] Reddy Y.V. and M.S. Fox, "KBS: An Artificial Intelligence Approach to Flexible Simulation", CMU-RI-TR-82-1, Robotics Institute, Carnegie-Mellon University, Pittsburgh PA, 1982.

[RH83] Reimer, U., and U. Hahn, "A Formal Approach to the Semantics of a Frame Data Model," Proc. /JCAI-83, Karlsruhe, 1983.

[RHM84] Rosenthal, A., S. Heiler, and F. Manola, "An Example of Knowledge-Based Query Processing in a CAD/CAM DBMS," Proceedings 10th International Conference on Very Large Data Bases, March 1984.

[RICH81] Rich, c., "Inspection Methods in Programming", Ph.D. thesis, MIT, MIT-TR-604, 1981.

References 631

[RICH82] Rich, C., "Knowledge Representation Languages and Predicate Calculus: How to Have Your Cake and Eat it too", Proceedings AAAI-82, Pittsburgh, 1982.

[RIEG79] Rieger, C., "ZMOB: A Mob of 256 Cooperative Z80A-Based Microcomputers," Computer Science Tech. Rep. Series TR-825, University of Maryland, College Park, MD, 1979.

[RVA84] Rissland, E., Valcarce, E. and Ashley, K., "Explaining and Arguing with Examples", Proceedings of the Natl. Con/. on Art. Intelligence, pages 288-294. AAAI-84, University of Texas at Austin, August, 1984.

[ROBI81] Robinson, 1. T., "The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indices", Proceedings of the 1981 SIGMOD Conference, Ann Arbor, MI., 1981.

[ROSE78] D. Rosenkrantz, "Dynamic Database Dumping," Proceedings 1978 SIGMOD Conference, May 1978.

[ROSS77] Ross, D. T., "Structured Analysis(SA): A Language for Communicating Ideas," IEEE Trans. on Software Engineering, Vol. Se-3, No. 1, Jan. 1977.

[ROUS79] Roussopoulos, N., "CSDL: a conceptual schema definition language for the design of data base applications", IEEE Trans. on Software Engineering, Vol. SE-5, No.5, Sept. 1979.

[ROUS82] Roussopoulos N, "View Indexing in Relational Databases", ACM Transactions on Database Systems, 7:2, 258-290, 1982.

[RS79] Rowe, L. and K. Schoens, "Data Abstraction, Views, and Updates in RIGEL", Proceedings of the 1979 SIGMOD Conference, Boston, MA., 1979.

[RTI84] Relational Technology, Inc., INGRES Version 3.0 Reference Manual, December 1984.

[RU71] Rescher, N. and A. Urquhart. Temporal Logic, Springer Verlag, 1971.


[RUSS78] Russell, R.M., "The Cray-l Computer System," Communications 0/ the ACM, 21 0): 63-72,1978.

[RYCH84] Rychener M., "PSRL User's Manual", Technical Report, Robotics Institute, Carnegie-Mellon University, 1984.

[SABM73] Shortliffe, E., Axline, S.G., Buchanan, B.G., Merigan, T.C. and Cohen, S.N., "An Artificial Intelligence Program to Advise Physicians Regarding Antimicrobial Therapy", Computers and Biomed.Res., Vol. 6, No.6, Dec.l973, pp.544--560.

[SACE73] Sacerdoti ED, "Planning in a hierarchy of abstraction spaces", Proceedings 3rd IJCAI, 412-422, 1973.

[SAD077] Sadock, J., "Modus Brevis: The Truncated Argument", Proceedings 0/ the 1977 Meeting, pages 545-554. Chicago Linguistics Society, Chicago IL, 1977.

[SB83] Schmidt, J. W., and M. L. Brodie, Relational Database Systems: Analysis and Comparison, Springer-Verlag, New York, NY, 1983.

[SC75] Smith, 1.M., and P.Y.T. Chang, "Optimizing the performance of a relational algebra database interface", Communications o/the ACM, 18,10, October 1975, pp.568-579.

[SCHA75] Schank, R., Conceptual In/ormation Processing, North-Holland, Amsterdam, 1975.

[SCHM77] Schmidt, J.W., "Some High Level Constructs for Data of Type Relation", ACM Transactions on Database Systems, 2,3, September, 1977.

[SCHM84] Schmidt J.W., "Database programming: language constructs and execution models", in Ammann, U. (ed.), Programmiersprachen und Programmentwicklung, Heidelberg: Springer-Verlag, 1-26, 1984.

[SCHW80] Schwartz, J.T., "Ultracomputers," ACM Transactions on Programming Languages and Systems, 2 (4): 484-521.

References 633

[SELI79] Selinger, P.G., et. al., "Access Path Selection in a Relational DBMS", Proceedings of the 1979 SIGMOD Conference, June 1979.

[SERG83] Sergot, M., "A Query-the-User Facility for Logic Programming", P. Degano and E. Sandewall (editor), Integrated Interactive Computing Systems, pages 27-41. North-Holland, 1983.

[SERN80] ASernadas, "Temporal aspects of logical procedure definition", Information Systems, Vol.5, No.3, 1980, pp. 167-187.

[SF82] Sequin, C.H. and R.M. Fujimoto, "X-Trees and Y-Components," Report UCB/CSD 821107, Computer Science Division (EECS), University of California, Berkeley, CA.

[SFL83] Smith, 1. M., S. A Fox, and T. Landers, "ADAPLEX Rationale and Reference Manual," Technical Report CCA-83-08, Computer Corporation of America, Cambridge, MA, May 1983.

[SFS77] Swan, R.1., S.H. Fuller, and D.P. Siewiorek, "CM* - A Modular, Multi-Microprocessor," Proc. AFIPS Con!, (46): 637-643.

[SG84] K. Salem and H. Garcia-Molina, "Disk Striping," Technical Report 332, Department of Electrical Engineering and Computer Science, Princeton University, December 1984.

[SHAW82] Shaw, David Elliot, "The NON-VON Supercomputer," Department of Computer Science, Columbia University.

[SHIB8S1 Shibahara, T. "Explicit and Active Use of Causal Knowledge: A Knowledge-Based Arrythmia Recognition System", PhD thesis, Department of Computer Science, University of Toronto, 1985.

[SHIP81] Shipman, D., "The Functional Data Model and the Data Language DAPLEX," ACM Transactions on Database Systems, Vol. 6, No.1, March 1981.

[SHNE80] Shneiderman, B., Software Psychology, Winthrop, Cambridge, MA, 1980.


[SHOR76] Shortliffe, E. H., "MYCIN: Computer-based Medical Consultations", American Elsevier, New York, 1976.

[SICK76] Sickel, S., A Search Technique for Clause Interconnectivity Graphs, IEEE Trans. on Computers C-25,8, Aug. 1976.

[SIDN82] Sidner, C. L., "Focusing in the Comprehension of Definite Anaph ora" , in M. Brady (editor), Computational Models of Discourse, MIT Press, Cambridge MA, 1982.

[SIGM83] Engineering Design Applications: Proc. ACM SIGMOD, San Jose, CA, May 1983.

[SK84a] Shepherd A, Kerschberg L, "Constraint management in expert database systems", in [KERS84], 1984.

[SK84b] Shepherd, A. and L. Kerschberg, PRISM: A Knowledge Based System for Semantic Integrity Specification and Enforcement in Database Systems", Proceedings of the 1984 SIGMOD Conference, Boston, Ma., 1984.

[SLOT78] Slotnick, D.L., et al., "The ILLIAC IV Computer," IEEE Transactions on Computers, C-17 (8): 746-757.

[SMIT82] Smith B.C., "Reflection and Semantics in a Procedural Language", PhD thesis, Laboratory of Computer Science, MIT, 1982; also MIT ILCS/TR -272.

[SMIT83] R. G. Smith, "Strobe: Support for structured object knowledge representation", Proc. 8th Intern. Joint Con! on Artificial Intelligence, Karlruhe, W.Germany, August 1983.

[SMIT84] Smith JM, "Expert database systems: a database perspective", in [KERS841, pp. K:1-22, 1984.

[SR81] Stearns, R., and D. Rosenkrantz, "Distributed Database Concurrency Controls Using Before-Values", Proceedings of the 1981 SIGMOD Conference, Ann Arbor, MI., 1981.

References 635

[SRG83] Stonebraker, l, B. Rubenstein, A Guttman, "Application of Abstract Data Types and Abstract Indices to CAD Databases", ACM SIGMOD Database Week - Engineering Design Applications, 1983.

[SRM86] Sathi, A, Roth, S., and T.E. Morton, (1986), "Callisto: An Intelligent Project Management System", AI Magazine, to appear.

[SS77] Smith, lM., and D.C.P.Smith, "Database abstractions: aggregation and generalization", ACM Trans. on Database Systems, Vol.2, No.2, June 1977, pp.l05-133.

[SS78] Steele, Guy 1. Jr., and Gerald Jay Sussman, "The Revised Report on SCHEME: A Dialect of Lisp," AI Memo 452, Massachusetts Institute of Technology.

[SS81] Stevens, A and Steinberg, c., "A Typology of Explanations and its Application to Intelligent Computer Aided Instruction", Technical Report 4626, Bolt Beranek and Newman Inc., March, 1981.

[SS82a] D. P. Siewiorek and R. S. Swarz, The Theory and Practice of Reliable System Design, Digital Press, 1982.

[SS82b] Sacco, G. M. and M. Schkolnick, "A Mechanism for Managing the Buffer Pool i~ a Relational Database System Using the Hot Set Model", Proceedings of the 1982 Very Large Database Conference, Mexico City, Mexico, (September 1982), pp. 257-262.

[SS83] Schwarz, P.M., and AZ. Spector, "Recovery of Shared Abstract Types", Technical Report No. CMU-CS-83-151, Carnegie-Mellon University, October 1983.

[SS84] Schwarz, P.M., and AZ. Spector, "Synchronizing Shared Abstract Types", ACM Transactions on Computer Systems, Vol. 2, No.3, August 1984.

[STEF81] Stefik M, "Planning with constraints (MOLGEN)" , Artificial Intelligence, 16, 111-170, 1981.


[STIC82] Stickel, M. E., "A Nonc1ausal Connection-Graph Resolution Theorem-Proving Program," Proc. AAAI-82, Pittsburgh, PA, 1982, pp. 229-233.

[STIC84] Stickel, M., "Automated Deduction by Theory Resolution," SRI Technical Note No. 340, Menlo Park, CA, 1984. (A version of this paper is to appear, under the same title, in J. Automated Reasoning, 1985.)

[STON75] Stonebraker, M., "Implementation of Integrity Constraints and Views by Query Modification", Proc. 1975 ACM-SIGMOD Conference, San Jose, Ca., May 1975.

[STON76] Stonebraker, M., et aI., "The Design and Implementation of INGRES," ACM Trans. Database Systems, 1, 3, September 1976.

[STON8l] Stonebraker, M. R., "Operating System Support for Database

Management", Communications of the ACM, V 24, N 7, (July 1981), pp. 412-418.

[STON83] Stonebraker, M., et. aI., "Application of Abstract Data Types and Abstract Indices to CAD Databases", Proceedings of the Engineering Design Applications of the 1983 ACM-IEEE Database Week, San Jose, CA, 1983.

[STON84] Stonebraker, M., et. aI., "QUEL as a Data Type", Proceedings of the 1984 SIGMOD Conference, Boston, Ma., 1984.

[STZ84] Shmueli 0, Tsur S, Zfirah H, "Rule support in PROLOG", in [KERS841, 1984.

[SU84] Sagiv, Y. and J. D. Ullman, "Complexity of a top-down capture rule", STAN - CS - 84 - 1009, Dept. of CS, Stanford Univ., July, 1984.

[SUTH65] Sutherland, I.E., "SKETCHPAD: A Man Machine Graphical Communications System," Massachusetts Institute of Technology, Lincoln Laboratory Tech. Rep. 296.

References 637

[SV84] Simon E, Valduriez P, "Design and implementation of an extendible integrity subsystem", Proceedings ACM-SIGMOD Conference, Boston, Mass, 9-17, 1984.

[SW48] Shannon, C. and Weaver, W., The Mathematical Theory ofComputation, the Univ. of Illinois Press, 1962, reprinted from the Bell System Technical Journal, 1948.

[SW74] Stonebraker, M. and E. Wong, "Access control in a relational database management system by query modification", Proc. ACM National Con!, pp. 180-187, 1974.

[SW84]/ Sciore, E. and Warren, D.S., "Toward an Integrated DatabaseProlog System", Proc. 1st International Conference on Expert Data Bases, Kiowah, S.C., Oct 1984.

[SWA83] Stonebraker, 1., 1. Woodfill, E. Anderson, "Implementation of Rules in Relational Data Base Systems", Memorandum UCB/ERL, 83110, University of California, Berkeley, California, 1983.

[SWAR83] Swartout, W., "XPLAIN: A System for Creating and Explaining Expert Consulting Programs", Artificial Intelligence, 21:285-325, 1983.

[SWC70] Sussman, G. 1., T. Winograd, and E. Charniak, "Micro-planner reference manual", MIT - AI 203a, AI Lab., MIT, Cambridge, Mass., 1970.

[SWKH76] Stonebraker, M., Wong, G., Kreps, P., and G. Held, "The Design and Implementation of INGRES", ACM Transactions on Database Systems, V 1, N 3, (September 1976), pp. 189-222.

[SWL83] N.C.Shu, H.K.T.Wong and V.Y.Lum, "Forms approach to requirements specification for database design", Proc. SIGMOD 83 Conference, San Jose, Ca., May 1983.

[SWMB85] Smith, R.G., H.A. Winston, T.A. Mitchell and B.G. Buchanan, "Representation and use of explicit justification for knowledge base refinemnent", Proc. 9th IJCAI, Los Angeles, CA. August 1985.


[SY82] Sacco, G.M. and Yao, S.B., "Query optimization in distributed database systems", Advances in Computers, Vol. 21, Academic Press, 1982, pp. 225-273.

[TARS55] Tarski, A., "A Lattice-Theoretical Fixpoint Theorem and its Applications", Pacific Journal oj Mathematics, 5, 2, June 1955 (pp. 285-309).

[TENN81] Tennant, H., Natural Language Processing, Petrocelli, 1981.

[TH77] Teichroew, D., and E. A. Hershey, III "PSLlPSA: A ComputerAided Technique for Structured Documentation and Analysis of Information Processing Systems," IEEE Trans. on Software Engineering, Vol. SE-3, No.1, Jan. 1977.

[TODD76] Todd, S. l P., "The Peterlee relational test vehic1e---a system overview", IBM Systems J., Vol. 15, No.4, pp. 285-308, 1976.

[TOFF77] Toffoli, Tommaso, "Cellular Automata Mechanics," Tech. Rep. 208, Logic of Computers Group, CCS Department, The University of Michigan.

[TRIL84] Trillin, C., Killings, Ticknor and Fields, New York City, 1984.

[TW84] Tick, E., and D.H.D. Warren, "Towards a pipelined Prolog processor", New Generation Computing, Vol 2, no 4, pp. 323-345, 1984.

[UG85] Ullman, l D. and A. Van Gelder, "Testing applicability of topdown capture rules", STAN - CS - 85 - 1046, Dept. of CS, Stanford Univ., 1985.

[ULLM82] Ullman, l D., Principles oj Database Systems, Computer Science Press, Rockville, Md., 1982.

[ULLM83] Ullman, lD., Principles oj Database Systems, Computer Science Press 1983.

[ULLM85] Ullman, J., "Implementation of Logical Query Languages for Databases", ACM Transactions on Database Systems, Vol. 10., No.3, pp. 289-321, 1985

References 639

[UM80] Uno, S., and H. Matsuka, "A Relational Database for Design Aids System", Workshop on Picture Data Description and Management, August 1980.

[VANG85] Van Gelder, A., "Deriving relations among argument sizes in logic programs", unpublished manuscript, Dept. of CS, Stanford Univ., 1985.

[VANM8I] van Melle, W., "System Aids in Constructing Consultation Programs", UMI Research Press, Ann Arbor, MI, 1981.

[VASS80] Vassiliou, Y., A Formal Treatment of Imperfect Information in Database Management, Ph.D. thesis, Dept. of Computer Science, Univ. of Toronto, 1980.

[VCJ83] Vassiliou, Y., J. Clifford, and M. Jarke, "How Does An Expert System Get Its Data?", Ninth International Conference on Very Large Data Bases, 1983.

[VCJ85] Vassiliou, Y., Clifford, J., and Jarke, M., "Access to Specific Declarative Knowledge by Expert Systems," Decision Support Systems, Vol. 1, No.2, 1985.

[VERE78] Vere, S. A., "Inductive learning of relational productions", In Waterman, D. A. and Hayes-Roth, F. (editors), Pattern-Directed Inference Systems. Academic Press, New York,

1978.

[VERH78] Verhofstad, J. S. M., "Recovery Techniques for Database Systems," ACM Computing Surveys, 10, 2, June 1978.

[VK76] Van Emden, M., R. Kowalski, The Semantics of Predicate Logic as a Programming Language, J. of the ACM 23,4, 1976.

[VSZM83] Vesonder, G. T., Stolfo, S. J., Zielinski, J. E., Miller, F. D., and Copp, D. H., "ACE: An Expert System for Telephone Cable Maintenance", Proceedings of the Eighth Joint Conference on Artificial Intelligence, Vol. 1, 1983, pp. 116-121.


[WALK82] Walker, A., "Automatic Generation of Explanations of Results from Knowledge Bases", Technical Report RJ3481, IBM San Jose Research Laboratory, May, 1982.

[WARR77] Warren, D., "Implementing Prolog -Compiling Predicate Logic Programs", University of Edinburgh, DAI report nos. 39 and 40, 1977.

[WARR81] Warren, D.H.D., "Efficient Processing of Interactive Relational Database Queries Expressed in Logic", Proc. of the Seventh International Conference on Very Large Data Bases, Cannes, France, pp. 272-281, 1981.

[WBW85] Gio Wiederhold, Robert L. Blum, and Michael Walker, "An Integration of Knowledge and Data Representation", in this volume.

[WDHL82] Williams, R., D. Daniels, L. Haas, G. Lapis, B. Lindsay, P. Ng, R. Obermarck, P. Selinger, A. Walker, P. Wilms, and R. Yost, "R *: An Overview of the Architecture," Proc. 2nd International Conference on Databases: Improving Usability and Responsiveness, Jerusalem, Israel, 1982.

[WE83] Wiederhold, G. and R. Elmasri "A formal high-level query language for the Entity-Relationship Model", ER Approach to Information Modeling and Analysis, P.P.Chen ed., North Holland, 1983

[WEBB82] Webber, B. L., "So What Can We Talk about Now", in M. Brady (editor), Computational Models of Discourse, MIT Press, Cambridge MA, 1982.

[WEBE78] Weber, H. "A Software Engineering View of Database Systems, Proceedings of the 1978 VLDB Conference, pp. 36-51, 1978.

[WEIN80] Weiner, J., "BLAH, A System which explains its Reasoning", Artificial Intelligence, 15:19-48, 1980.

[WESS81] Wesson, R., et aI., "Network Structures for Distributed Situation Assessment," IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-ll, No.1, January 1981.

References 641

[WH78] D. Waterman and F. Hayes-Roth (Editors), Pattern Directed Inference Systems, Academic Press, New York, 1978.

[WIDD80] Widdoes, L.c., "The S-1 Project: Developing High Performance Digital Computers," Spring COMPCON 1980, 282-291, 1980.

[WIED75] Gio Wiederhold, James F. Fries, and Stephen Weyl, "Structured Organization of Clinical Databases"; Proceedings of the National Computer Conference, 1975, AFIPS Vo1.44, pp. 479-485.

[WIED83] Gio Wiederhold, Database Design; McGraw-Hill Book Company, New York, Second edition, January 1983, 768 pp.

[WIED84] Wiederhold, G., "Knowledge and Database Management", IEEE Software, Vol. 1, No.1, January 1984, pp.63--73.

[WIED85] Gio Wiederhold, "Knowledge versus Data", position paper, in this volume.

[WIN072] Winograd, T., Understanding Natural Language, Addison-Wesley, New York, 1972.

[WIN082] Winograd, T., Language as a Cognitive Process, Addison-Wesley, 1982.

[WINS79] Winston PH, "Learning and reasoning by analogy", Communications of the ACM, 23, 12, 689-703, 1979.

[WINS83] Winston, P., "Learning by Augmenting Rules and Accumulating Censors", Machine Learning: An Artificial Intelligence Approach, Volume II, Michalski, Carbonell, and Mitchell eds., KaufmanMorgan Publishers, 1986,).

[WITH83] F. G. Withington, "Winners and Losers in the Fifth Generation," Datamation, December 1983, pp.l93-209. (These forecasts also appear in "Future Information Processing Technology, 1983," Institute for Computer Sciences and Technology of the ***LINE MISSING IN ORIGINAL FILE***.


[WM77] Wong, H.K.T., and Mylopoulos, 1., "Two Views of Data Semantics: Data Models in Artificial Intelligence and Database Management," INFOR, 15, 3, 1977.

[WMJB83] Wahlster, W., Marburger, H., Jameson, A. and Busemann, S., "Over-Answering Yes-No Questions: Extended responses in a NL interface to a vision system", Proceedings of the 8th IlCAI, pages 643-646. IJCAI, Karlsruhe, West Germany, August, 1983.

[WOLF84] Wolfram, Stephen, "Cellular Automata as Models of Complexity," Nature, 311 (4): 419-424, 1984.

[WOOD70] Woods, W.A., "Transition Network Grammars for Natural Language Analysis," Communications of the A CM, Vol. 13, No. 10, October 1970, pp. 591-606.

[WOOD73] Woods, W.A., "Progress in Natural Language Understanding: An Application to Lunar Geology," AFIPS Conference Proceedings, Vol. 42., 1973, pp. 441-450.

[WOOD75] Woods, W.A., "What's In a Link: Foundations for Semantic Networks," in D. Bobrow and A. Collins (Eds,) , Representation and Understanding: Studies in Cognitive SCience, Academic Press, New York, 1975, pp. 35-82.

[WOOD78a] Woods, W.A., "Semantics and Quantification in Natural Language Question Answering", Advances in Computers, Vol. 17, Academic Press, New York, 1978, pp. 1-87.

[WOOD78b] Woods, W.A., "Generalizations of ATN Grammars," in Woods, W.A. & Brachman, R.I., (Eds,) Research in Natural Language Understanding, BBN Report No. 3963, Bolt Beranek and Newman, Inc., Cambridge, Mass., 1978.

[WOOD79] Woods, W.A., Semantics for a Question-Answering System, Garland Publishing, Inc., New York, 1979.

[WOOD80] Woods, W.A., "Cascaded ATN Grammars", American Journal of Computational Linguistics, Vol. 6, No.1, January-March 1980, pp. 1-12.

References 643

[WOOD83] Woods, W.A., "What's Important about Knowledge Representation?" IEEE Computer, Vol. 16, No. 10, October 1983, pp. 22-27.

[WP82] Warren, D.H.D., and F.C.N. Pereira, "An efficient easily adaptable system for interpreting natural language queries", American Journal 0/ Computational Linguistics, Vol 8, No 3-4, pp. 110-122, 1982.

[WP84] Wise, M. J. and D. M. Powers, "Indexing PROLOG Clauses via Superimposed Code Words and Field Encoded Words", Proceedings o/the 1984 Symposium on Logic Programming, Feb. 6-9, 1984.

[WP85] Waltz, David and Jordan B. Pollack, "Massively Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation," Cognitive Science, 9 (1): 51-74, 1985.

[WSK83] Weber W, Stucky W, Karszt J, "Integrity checking in database systems", In/ormation Systems, 8:2, 125-136, 1983.

[WY76] Wong, E., and K. Youssefi, "Decomposition - a strategy of query processing", ACM Transactions on Database Systems, Vol. 1, No.3, September 1976, 223-241.

[YH85] Yahya, A., L. Henschen, "Deduction in Non-Horn Databases", Journal 0/ Automated Reasoning, 1, No.2, 1985.

[YOK084] Yokota, H., et aI., "An Enhanced Inference Mechanism for Generating Relational Algebra Queries", ACM SIGACT-SIGMOD Symposium on Principles 0/ Database Systems, 1984.

[ZL0077] Zloof, M. M., "Query-by-Example: A Data Base Language", IBM Systems Journal, 16, 4, 1977 (pp. 324-343).

[ZL0082] Zloof, M. M., "Office-by-Example: A Business Language that Unifies Data and Word Processing and Electronic Mail", IBM Systems Journal, 21, 3, 1982.

Index

Abstract data type 13, 14, 16, 21, 232, 321, 323n, 324, 331, 513

references 593, 599, 622, 635, 636 Abstract object types 232, 252-254 Abstraction principles 467, 469 Access methods 315-318 passim, 324-328 Access operations 471-475, 504

and massive memory 543 in distributed knowledge base

system 417 in SRL 425,427,428 references 600, 618, 633, 637

Access planning, in databases 117 Access, simultaneous 453 ACE 347

reference 639 Active data structures 553 Activity classes (see Classes, activity) Activity, in CML 462 Activity objects in RML 480-481 ADAPLEX 203,464

references 591, 633 Adornment 154, 156, 156n, 157, 159 Agent responsibility 429 AI (artificial intelligence) ix, 13, 43, 53,

56,63,80,83,84,86,87,91,102, \03, 118, 191, 192, 197, 198,218, 219,260,284,403,553,554

and constraints 332 and database, issues 204, 575-578

references 605, 622 and knowledge representation 465 and knowledge/symbollevel 418 and massive memory 543 and question answering 376 computers 529 history xi-xv, 339-346 interaction with databases xi-xii interaction with database 504 knowledge 260n knowledge bases, and databases 71-75 languages 298, 576-577

(see also PROLOG) programming techniques 538

research in knowledge-based systems 339-351

vs. knowledge base, issues 569-573 references 628, 632

Alphabeta pruning 340 Alternatives (versions) 455-457, 459, 520

reference 618 (see also Versioning, alternatives)

Anaphora 446 in Natural Language 356, 357 reference 634

Anaphoric expression (see Anaphora) ANSI/SPARC 212, 508 Answers 365-401

conceptual categories 376 cooperative 367,372-379 correct 372-374 definition 386 indirect 380-381 non-misleading 378-380 pragmatically significant 375 useful 375-378 references 611, 626, 628, 630, 642

Application domains, semantics 461 AR (Artificial Reasoner) 546-549 Architecture (see Database; DBMS;

KBMS) ARPA net 572 Artificial intelligence (see AI) ASK (see KRYPTON; KL; Query opera

tions) Assertion classes (see Classes, assertion) Assertions 475,481-488,498,499

disjunctive 374 existential 374 negative 374 (see also Classes, assertion)

ATN (see Augmented transition networks) Attributes 112

in CML 463-464, 468 Augmented transition networks

(ATN) 184,186.187.190.354-355 grammar 393 reference 642

646 Index

8-tree 211, 214, 426, 539, 580 index 311,326,458,459

Backtracking 121-122, 298, 408 and priority 305-310

Backward chaining 297,298,299, 302-305, 314, 343, 343n-344n

and views 312-313 Beam search 412 Belief

revision 546-549 references 612, 616, 620

Binary trees 530, 539 Binding 494, 498

constraints 494 parameter 478

Blackboards 421-422 reference 629

Boltzman machines 529 Buffer management 320, 322, 324, 325,

328,516,539 references 600, 635

C3I (Tactical Communications, Command, Control and Intelligence) 38-40

Caching 421,425,426,537 CAD Database 278

references 635, 636 CAD/CAM 118,209,315-320 passim,

323, 328, 335, 520, 577 and specialized DBMS 277, 231, 232,

246, 252, 256-257 references 594, 630

CADUCEUS 350 CAFS 562 Calculus

differential 165 predicate 18, 20, 23, 189, 206, 226, 238,

490 first order 230, 361 monadic 101, 103 references 621, 631

relational 112, 114, 118, 127, 139, 148, 225

languages 197 reference 593

sentential 102 situational 500

CALLISTO 407,414-417,421, 428, 429-430

architecture 416, 418 reference 635

Capture rule 147,155-164,236,514 bottom-up rules 158 conditions for 156-157

constraints on 161 Henschen-Naqvi rule 158-159, 163 Naish's 159-161 research 163-164 sideways rule 158 top-down systems and 157-158,

159-162 references 592, 636, 638

CASSM 529,562 Causation

linkage, in medical database 439-441 references 597, 621, 633

Cellular automata 563 references 638, 642

CF (see Languages, context-free) Chaining (see Backtracking; Backward

chaining; Forward chaining) Church's Theorem 106 Circuit design 404-405 Class definition 259, 261-262

axioms 493-494 errors in 274--275 refinement 268, 270-277

(see also Relevance) in RML 475, 476-480

Class description 403, 463, 465 Class, most specific 271-274 Classes 473,475,497,502

activity 480-481, 497 assertion 471, 481-486

axioms 496 entity axioms 494-496 event 488 hierarchy 463

reference 595 in knowledge representation 463-464 meta- 463, 475-502 passim meta event- 488 time/event (see RML, time modelling)

Clausal normal forms 64 Clause 134 Closed World Assumption (CWA) xii, II,

21, 34, 56, 73, 74, 75, 125, 128, 129, 197-198, 221-222, 226, 373, 373n, 396

references 624, 627, 630 (see also Generalized Closed World As

sumption; Open World Assumption) Closure 133, 138

axiom 139-140 transitive 149, 166, 177,216,230

generalized (see GTC) (see also Domain, closure)

CML (Conceptual Modelling Languages) 461-469

COBOL 4, 203, 462 CODASYL 147,316,319,320 Codes 447 Communication (see Knowledge-based

system, and interactive communication)

Competence 15 Completion method 130 Computational theory 83-86 Computational tractability/intractability

(see Expressiveness; Tractability) Computer

architecture 529,551-554 (see also Computers, massive memo-

ry; MIMD; SIMD; Supercomputers) configuration (see R1 system) efficiency of 551-553 fixed-topology 530 high-performance 561, 566

(see also Supercomputers) history 551-553 massive memory 535-550, 565 memory cost 536 para- 530 parallel 529-530,535,551-563 topology 557-560, 562, 566 references 631, 641

Concept node 191-192 Conceptual analysis 545 Conceptual dependency 545 Conceptual factoring 184-186 Conceptual Modelling Languages (see

CML) Conceptual models 475

references 598, 627 Concurrency control 47,56,88,210,213,

214, 335, 442, 539, 540 and specialized DBMS 228,245,247,

255, 256 in extensible DBMS 315-326 passim,

328-329 references 595, 600, 601, 602, 634

Concurrent access 570 Configuration

alternate 520 files 455 of knowledge base 454, 459 management 213 (see also Design database, configura

tions) Connection graph 18, 19,64, 133-135,

140-141, 143, 144 references 636, 604, 619, 626

Connection Machine 551, 553-556, 557-563, 565-566

requirements of 557-560 reference 613

CONNIVER 346 Consistency checking 518

Index 647

Constraint 230,446,447,464,468,473, 474, 475, 480, 481, 580

in job-shop scheduling 410 knowledge of 410-413 property range 263 references 625, 634, 635 (see also Binding constraints; Integrity

constraints) Context structures 453-459

references 595 Contextual analysis (see Discourse analy

sis) COOP 382-383, 395-397 Cooperative answer (see Answers, cooper

ative) Cooperative principle, in Natural Lan

guage communication 358-359 Corporate Requirements Analysis 472 Coupled database (see DBMS, architec

ture, coupled approach) CPU (see Processors) Crash recovery

and massive memory 541-542 reference 612

Customized database (see DBMS, architecture, custom approach)

CWA (see Closed World Assumption)

DACOS 256 reference 617

DAPLEX 44, 230, 232-233, 236, 465 and specialized data 243-244, 248-250,

256 reference 633

Data aggregate 81 currency 89 definition 79-80 derived 81

reference 619 deviant (see Exceptions) dictionary 518 errors 259, 278 exceptions (see Exceptions; Constraints;

Schema) image/voice 315, 335 incomplete 436

reference 621 independence 202, 319 integrity 319

648 Index

Data (cont.)

management efficiency 420, 426-427 reference 6 I 9 (see also DBMS; DDBMS)

meta- 229,508,515,517,518 modelling 'requirements 316 periodic/continual 297-298 persistence 570 processing

efficiency 536-537, 582-583 speed 525-526

redundancy 319 scientific 315, 316 security 319, 570 shared 319,407,421-422 statistical 315,316

reference 618 temporal/spatial 331

(see also Data, specialized) volatility 89 vs. knowledge 448-449 (see also Data models; Data, special

ized; Exceptions; Information; Knowledge; Schema; Null values; Proxy values)

Database architecture 507-508

generic 335 references 613, 616

components (see Extensional knowledge; Intensional knowledge)

controller 512,517,518 deductive approach 223-224, 225, 226

reference 593 definition 73, 83-84 design

administration research 216-217 control 513 requirements 201-202 references 621, 629, 641

distributed 6, 38n, 71,113,118-119, 213-217

references 595, 600, 604, 609, 610, 629, 634, 638

dynamic properties 202 error in 80, 81-82 and first-order logic 219-226 history 121-122 internal 50 and knowledge representation

system 447 and knowledge systems 579-585 logical integrity 203

medical 431-444 reference 597

operations in (see Access operations; Merge operations; Query operations; Query optimization; Update operations)

query language 219 relational 64-65, 73, 75, 85, 98, 108,

121, 125-128, 140-143, 147-148, 166, 167, 179-180, 197,219-226, 317,323-324,508,577

and rule bases 524 chaining and triggers in 297-314 model-theoretic approach 224-226 references 633, 637

research, topics in 209-210, 215-218 retrieval operations 179-195 specialized 335 state 112 static properties 202 statistical 315, 316, 321, 322 theory 210, 214

references 610, 627, 638 (see also Database systems; DDBMS;

DBMS; Design database; Knowledge-based systems; KBMS; information systems; individual databases

Database Administrator's Assistant 260, 331

Database and AI, issues xi-xii, 575-578 and AI knowledge bases 71-75

Database systems extensible 322-330 issues 210-215

Data models 333 hierarchical 204-206, 209 network 204-206, 324

reference 594 relational 7, 128, 204, 206-207, 220,

221, 223 semantic 47, 208, 260, 261, 473,

474-475, 513 references 600, 614, 624, 642

traditional 462 Data, specialized 227-257,577

and DBMS 231-232, 243 representation 245-246 research topics 245 storage and retrieval 244-245 types 48 references 597, 621, 630 (see also Data, image/voice)

db form (see Knowledge base, db form)

DBC 562 DBMS 3,63, Ill, 118

advantages of 36 architecture 35-54, 87-90

coupled approach 318,335 custom approach 317-318,335 issues in 57-59 PLiI approach 317,318,335,462 research 209-215 (see also Integrated information pro-

cessing; System organization) as component of KBMS 35-54 extensible 331 history 147-148 and KBMS, comparison 179-181 languages 461 and Natural Language 362-363

reference 617 object models in 293-294 object-oriented 315,323-326 operations, priority 310 and recursion 227-243 specialized 315-330 and specialized data types 231-232 and triggers 298 (see also Data, specialized; Database

systems, extensible; PROBE) DBPL 519 DDBMS (Distributed Database Manage

ment Systems) 212-213 types 214-215 references 600, 620

DDL (Data Definition Language) 203-204 DDM 215 Decision making 78-80

(see also CALLISTO) Decision tree i 83-184 Deductive approach (see Database, deduc-

tive approach) Deep knowledge 432 Default reasoning 105 Default rules 104 Demons 52, 344, 344n, 345, 423, 424, 577 DENDRAL 340-341,342,347

reference 607 Dependencies, domain/key 513 Dependency analysis 346 Dependency thebry 217 Design (see Design database; Objects;

Versioning) Design database 287-295, 333-334,

453-459 configuration 333-334 configurations in 288, 291, 293-294

Index 649

equivalence 288, 292-294, 333-334 versions 333-334

(see also Versioning; Layers; Object) references 611,618,621, 626

Design life cycle (see Versioning, version life cycle)

Design versions (see Versioning) Diagnostic operations 256

references 605, 612 Differential problem formulation 350 DIRECT 321n, 562

reference 605 Discourse

analysis in Natural Language 356, 359

domain 355n model 355n, 361 perspective 397-398 references 599, 610

Disjunction 68,277,343,374,398 Distributed Database Management Sys

tems (see DDBMS) Distributed systems 416-417,422,428

references 603, 606 (see also Computers, parallel; Database,

distributed; DDBMS) DLII 147 DML (Data Manipulation

Language) 203-204 Domain

closure axiom 73, 74, 75, 133 reference 630

data-intensive 140 dependency 112

reference 626 knowledge 87-88 real world 127 specific knowledge 277-278 reference 607 (see also Application domains)

Earley's algorithm 355 Ellipses 446, 545

in Natural Language 356-357 reference 600

EMYCIN 346 ENCOMPASS 213 Entity 494-496, 498, 501-502

sets 323 (see also Object)

Entity-relationship paradigm 497 references 602, 606, 640

Enumeration functions 189

650 Index

Environment 20, 457--458, 459 user-defined 293

Equality axioms 224 Equational theory 103 ESRL 425--426 Exceptions 259-286,331,446--447,467,

503-505, 523-524, 533 accommodation in knowledge

bases 265-267 in knowledge bases 259-286 occurrence 263-265 references 598, 610, 621

EXCUSES 446 Expert system 7,55,56,67,87,217,278,

327, 335, 339n-340n, 347, 367, 453, 454, 554, 571

database 321, 322 references 626, 621, 634, 639

and database coupling 35-54,508,512, 5\3, 521

and retrieval operations 179-181,189, 194, 195

references 602, 604, 637 (see also Diagnostic operations; Knowl

edge-based system (KBS); KBMS) Explanation (see Response) Expression/expressiveness 204, 220, 334,

519, 584 (see also Tractability)

Extensional knowledge 141, 143-144, 223, 229-230, 510, 572

Extrapolation in medical knowledge/ database 441--443

Factored knowledge structure 179, 183-186, 195

Factoring (see Factored knowledge structure)

Fanout tree 560-561 First order languages 499-500

many-sorted 501 First order logic 22,23,30,56,57,64,

67, 68, 100, 148, 166, 198, 208, 498, 571, 584

(see Database, and first order logic; Query language)

First order predicate calculus (see Calculus, predicate)

First order quantification theory (see

Quantification theory) First order representation language 56 First order theory 373

database as 223, 226

Focus, in Natural Language processing 357,361-362

Formula, non-ground 130, 141 ground unit 126, 130, 140, 141

FORTRAN 121, 346, 348n, 531 Forward chaining 297,298,299,301,314,

343, 343n-344n goal-directed 409

Frame 14, 192, 419, 423, 582 axiom 500 defined 341 instantiation 345 matching 345-346 representation 432 theory 344 references 609, 630

Frame-based systems (see Knowledgebased system (KBS»

FRL 346

GALILEO 465 reference 591

GCWA (see Generalized Closed World Assumption)

Generalization 438 empirical, and exceptions 269-277,

284 references 598, 605, 625, 635 (see also Rules, generalization of)

Generalized Closed World Assumption (GCWA) 125, 130, 221-222

Generalized Phrase Structure Grammar (GPSG) 355

Generalized Transition Networks (see

GTN) GKM (Global Knowledge Manager)

49-52 Global optimizer 254-255 Goal nodes/trees (see Rule/goal nodes) Goal-related information (see Information,

goal-related) Goals 343

(see a/so Inference, goal-driven; Rule invocation, goal-driven)

GPSG (see Generalized Phrase Structure Grammar)

Grice's Maxim of Quantity 378,396 GTC (generalized transitive closure)

237-242 GTN (Generalized Transition Net

work) 187-188, 189, 195 GUS 345,385

reference 597

HALO 541 HAM-ANS 383, 388 Hashing 2\1-212,244, 25\, 537, 539

conventional 310 extendable 310, 3 \I hash table 117, 554 hashfiles 437 index 326 records and indexes 311

HCPRVR 425 reference 602

HEARSAY-II 421 reference 606

HEARSAY-III 47 reference 592

HELP 391-392 Henschen-Naovi rule (see Capture rule) Hierarchical data models (see Data,

models, hierarchical) Hierarchical knowledge (see Information,

hierarchical) Hierarchies, search (see R I system) Hierarchies, taxonomic 445

(see also SRL) Horn clause 102, 122, 129, 130, \31, 139,

149, 150,221,222,224,234-235, 236, 242-243, 389, 416

references 60 I, 627 HSRL 416,425

ID/LP (see Immediate Dominance/Linear Precedence grammar)

Image processing 530 Immediate Dominance/Linear Precedence

grammar (ID/LP) 355 Implicature 359, 379, 379n, 399

reference 6 \3 IMS 10,2\3 Inappropriate plans (see Plans, inappro

priate) Indexes 244, 326

references 612, 636 (see also B-tree indexes; Hashing, index)

Inference 67n, 204, 344,407-408, 441-442,580

and databases 74 data-driven 342, 343 engine 235, 426, 577 goal-driven 342-343 and knowledge bases 297, 298 mechanisms II, 508, 511 systems 570-571 references 617, 641

Index 651

Information classes (see Class definition) classification 473 definition 79-80 disjllnctive 220, 221-222, 224, 225-226 distribution of 46 generalization 473 goal-related 385-387 hierarchical 433-434 incomplete 197-198,465,467,475 meta- 423-424, 429 negative 125-145,197-198,220-221,

225-226, 465 null values (see Null values) proxy values (see 'Proxy values) recursive 220, 222, 225-226 security 421, 428 shared 421-422 spatial/dimensional (see Data, special

ized) temporal (see Data, specialized; RML,

time modelling; Versioning) references 597, 600, 622, 629 (see also Data; Exceptions; Knowledge;

Schema) Information base (see Database; DBMS;

information system; Knowledge base; KBMS)

conceptual models of 461-469 definition/ purpose 461-462 design 472,519-521 references 593, 598, 618, 628

Informativeness 375 INGRES 212,299,300,320,321, 321n,

322, 572, 573 references 615,631,636,637

Inheritance 14, 67, 420-421, 433-434, 443, 463

in classes 262 and frame-based systems 345, 345n of properties in RML 479-480 user-defined relations 424

Integrated information processing system 228-229

Integrity checking 149,514-516,521 references 620, 628

Integrity constraints 66n, 68n, 80, 112, 220,223,225,259-286, 33\, 465, 507-521 passim, 524

and exceptions 266-267 generalization 277-278, 284-285 justification 279-284 logic 509 management 512-517

652 Index

Integrity constraints (conI.)

redundant 517 refinement 267, 268, 275-286 semantic 116,202,203,208,211,259,

260 reference 614, 620, 634

references 598, 599, 636 Integrity control 47,228,245,247,258 Integrity maintenance 204, 211 Integrity management 508-509,510,518,

521 references 593, 637 (see also Integrity Constraints)

Intensional knowledge 141, 143-144,223, 229-230,331,373,374,510,572

processing 227 INTERLISP 437,504 INTERNIST-I 346

reference 626 Intractability (see Tractability) IS (see Information systems) ISIS 407, 412-413,421, 426, 429-430, 573

architecture 412-413, 414 ISLISP 425

JAPAN-LISPM 562 Job-shop scheduling (see ISIS) Join operations 211, 242, 529 Joshi's Modified Quality Maxim 378-379 Justification (see Response)

KBCI 426 KBMS (Knowledge Base Management

Systems) ix, 90, 108, 166, 320 architecture 35-54, 87-90, 125, 127-

128, 143 approaches 507-512 issues in 57-59 reference 613

communication between components 41

component adaptability in 41 design issues 503-505 distributed 522 and DMBSs

comparison xi, xii, 3-8 integration 579

and exceptions/ errors 259-286 passim features 3-4, 4n heterogeneous knowledge bases in 40 integrated input/output in 41 knowledge sharing in 41

large-scale 40, 507-522 (see also LSKS)

and Machine Learning 403-406 and massive memory 539

reference 610 multiple data types in 41 and Natural Language Processing 362-

363 negation in 125-145 operations

computer configuration (see RI system)

job-shop scheduling (see ISIS) project management (see CALLISTO)

operators in 412 parallelism in 42 rule-based 315,321

(see also Organization level) and RX system 431-444 self-diagnosis (see CALLISTO) self-understanding in 42 and software development 3 system modularity in 42 (see also Information system; Knowl

edge base; Knowledge-based system)

KBS (see Knowledge-based system) K-D-B trees 251

reference 631 KEE 6 Key dependency 112 KL 30-34

language 56 query and update 33-34 syntax and semantics 31-33

Kleene-Post hierarchy 107 KL-ONE 179-180, 194, 195,230,346,

419,445 taxonomy 191-193 references 599, 600

Knowledge acquisition 507-522

references 612, 613, 616 capacity 582 categorical 431-434 passim, 448 causal 431, 432, 439-439, 448

(see also Causation) vs. data 4, 77-82, 448-449

reference 641 (see also Data)

definition 79 definitional 431, 432, 434-435, 448 engineering 504 extraction 431, 448

incomplete/erroneous/inconsistent 80-82, 422n, 428, 429,465

reference 620 (see a/so Exceptions)

meta- 584 modularity 342 operational 431,432,448 processing 147,582 sharing 507 sources 50 (see also Data; Exceptions; Extensional

Knowledge; Factored knowledge structure; Information; Intensional Knowledge; Schema)

Knowledge base 13, 123 and AI, issues xi-xii, 504, 569-573 closed 131-133 constants in 128-129 consultant systems 403-406 and databases 179-18r, 579-595

comparison 83-84 coupling 89-90 system enhancements 89

data intensive 140-141 db form 64-65, 67 definition 83-84 and exceptions/errors 260, 262-263 interactive 519 key-word indexing 182-183 languages and (see KRYPTON; KL) layered 293-294 management, specialized 315-330 minimal model 130 non-Horn 129-132, 139 operations in (see Access operations;

KRYPTON; KL; Query operations; Update operations)

retrieval operations 179-195 semantics 198 shared 228 versioning in 453-459

Knowledge-based system (KBS) 87-90, 339-351, 365, 394, 401-402

conceptual issues 348-351 and database systems 579-585 and database techniques 407-430 and decision-making 78 definition 339-340 frame-based 339, 344-346, 349 and interactive communication 365-401 rule-based 339, 346, 349 SRL tool 425-426 references 609, 620

KNOWLEDGE CRAFT 423n

Index 653

Knowledge level 14-18,37,43,55-56, 63-64,69, 198,217-218,333,349, 407, 408, 417-418, 429, 447, 517, 576

defined 9-12 references 599, 627

Knowledge representation (KR) ix, 14, 43,44,108,204,229,407,445,471, 519,545,576

and CML 461,465,468 and data representation 431-444 intensional 230 issues in 467-468 and knowledge level 11-12 language 85, 503-505, 523, 526, 580,

584 requirements for 55 references 596, 631

and Natural Language text generation 360

operational 255-256 requirements 5-6 and semantic analysis 361 special-purpose 514 systems, taxonomy 191-195 reference 612 (see a/so Exceptions; Objects; SRL)

KR (see Knowledge representation) KRL 346 KRYPTON 23-30, 56, 260n, 526

query and update in 28-30 syntax and semantics 24-26 references 595, 599

Language context-free (CF) 354-355 frame-based representation 472

reference 597 requirements specification (see RML) (see a/so AI languages; Knowledge rep

resentation language; Natural Languages; Query Languages; individuallanguages)

Large-Scale Knowledge Systems (see

LSKS) Layer(s)

in design databases 293-294 in knowledge bases 457-458, 459 reference 609

Lazy triggers (see Triggers, lazy) LEAP (Learning Apprentice Sys

tems) 404-406 reference 625

654 Index

Least fixpoint 165, 167, 172-73, 176-177, 222, 236-237

references 60 I, 627, 638 Lexicon 354 Lexicon learning system 540

(see also On-line dictionary) LIPS (Logical inferences per sec

ond) 525-526, 582-583 LISP 150,235,341,346,437,504-505,

526,536-537,549,556,560,571, 577

Connection Machine 561 expression/machine 420n, 423-424 reference 635 (see also Symbolic LISP machine)

LISPM 562 Livermore S I Multiprocessor 531 Lock 316, 324, 326, 328, 334-335

granularity 301,311 Lock manager 297,299,300,334

page level 311 persistent 329 record level 311 type-specific 328 reference 606

Log, log-based recovery algorithms 328-329

Logging 316,321,328 techniques, in massive memory 541

Logic programming 524 (see PROLOG) references 591,592,'5%,597,618

Logic simulation 562 Logical data independence 86 Long-term events 465-466 LOOPS 6,458

reference 600 Lossless evaluations 174-175 LRU 329 LSKS (Large-Scale Knowledge Sys

tems) 579, 580-582 LUNAR 183, 188

Machine Learning 260, 271-272, 285, 403-406, 421

reference 624 (see also Exceptions, in knowledge bas

es; Integrity constraints, refinement; Schema, refinement)

MACSYMA 340,341, 347 reference 622

Markov decison chains 162 Massive memory (see Computers, massive

memory; KBMS, massive memory)

MEDIATOR 518 reference 616

Medical applications 577 Medical databases/programs (see CADU

CEUS; EMYCIN; INTERNIST-I; MYCIN; PRESENT ILLNESS)

Memory content-addressable 529 massive vs. virtual 536-539 reference 629 (see also Computers, massive memory)

Merge operations, in database 113-114 MESA 323n

reference 625 Message router 559 Metaclasses (see Classes, meta-) Metadata (see Data, meta-) Meta-schema (see Schema, meta-) MIMD (Multiple Instruction Multiple

Data) 531-532 MIP 582 Misconceptions 381-382, 394-399

reference 623 Misconstrual 399-401 Modal knowledge operator (see KL) Modelling entities in RML 476-480 Model-theoretic approach 98, 109

formalizations/representation 509-511 (see also Database, model-theoretic ap

proach) Modus brevis 390-391

reference 632 Modus ponens 390-391 Monadic predicate calculus (see Calculus,

predicate, monadic) MRS 148, 197

reference 609 MULTIBASE 44, 51n, 215, 254n

references 610, 622 Multiple Instruction Multiple Data (see

MIMD) MYCIN 342-343,346,347,349,439

reference 634

NAIL! 122 Naish's rule (see Capture rule) Naive bottom-up evaluation 166-167, 177 Natural Language xii, 39, 353-363, 380,

524, 577, 580 dictionaries (see On-line dictionaries) generation 354, 359-362

content determination 360 realization 360-361 text planning 360-361

references 603, 623 interaction 353 interfaces 362 interpretation 188-190, 193 query systems 114 text processing ~53-354

understanding systems 445-446 references 617, 622 (see also COOP)

Natural Language Processing (NLP) 228, 353-363, 445

architecture 359 research topics in 361-363 references 592, 604, 638

Negation 73,277,389 reference 603

Negation by failure rule 129 NETL 230, 563

reference 607 Network data models (see Data, models,

network) NIKL 445 NL (see Natural Language) NLP (see Natural Language Processing) Nonmonotonic reasoning 104-105 Normalization 217,505,513 Null values 436, 437

Objects 459, 473, 475, 476 in conceptual modelling 462-463 defined 454, 454n design 288-289 parameters 454 references 594, 621

Object-oriented data/database (see Design database)

Object-oriented framework 523 Obstacle detection 380-383 OMEGA project 6 On-line dictionaries 543-546 Open World Assumption (OWA) 221-222 Operators in KBMS 412 OPS 43, 256, 577 OPS5 314,328,343,346,409,447,549 Organization level 37,407,408,417-419,

428, 429, 430, 447-448, 522 OSRL 425 OWA (see Open World Assumption) OWL 346

Page level locking (see Lock, page level) Parameter binding (see Binding) Parsing 195, 354, 361, 446, 537, 554

Partial descriptions 570 PASCAL 495 Path problems 237-240

restrictions 240-242

Index 655

Path-length algorithm 555-557, 558 Patient-specific model 350 Phantoms 30 I, 311 PIE 457-458 PL/I (see DBMS, architecture, approaches) PLANAR 246 PLANNER 84, 148, 197,299,577

reference 613 Plans

enablement 386-387 generation 386-387 inappropriate 385-387 reference 599

PLEXYS 519 Polytope 162-163 Pragmatics

in Natural Language 357-359, 361-362 plan recognition 357-358 reference 621

Precision 571 PRESENT ILLNESS 346

reference 628 Primitives 318

in KRYPTON 29-30 Priority system (see Triggers, priority) PROBE 227-257,318,324,327,331, 504n Processors 565

fine- vs. coarse-grained 530 high-performance 533 MIPS 539 numeric 532-533 parallel 537-538

reference 593 single vs. multiple 540 special-purpose 232, 244, 252, 253,

525 symbolic 532-533 topology, in Connection Machine 557-

560 references 628, 633 (see also Livermore Si mUltiprocessor;

MIMD; SIMD) Production-system methods 538 Project management (see CALLISTO) Projection operations 211 PROLOG 6n, 89, 102, 115, 121, 129, 148,

149,150,160,161,163,197,230, 231,234-235,238,242,276,298, 334, 346, 388-389, 508, 524, 525-526,549,566,571,577

embedded operations in 182, 186

656 Index

PROLOG (conI.)

factored knowledge systems and 184-188

indexing 317 machines 565

Proof procedures 100-101 Proof tree 389 Proof-theoretic formalizations/

method 511, 517 Property categories (see RML, property

categories in) Property classes (see RML, property

classes in) Proxy values 436 PSL 473

reference 638 PSN 230 PSRL 425

reference 632 PTRANS 421 PUFF 347

reference 591

QBE 225, 235, 242, 256 Quality Maxim (see Joshi's modified quali-

ty maxim) QUALM 376, 378 Quantification theory 98, 103 QUEL 122,299-300,303,321

reference 636 Query

appropriate query assumption 386 closed 225 graphs 514 ground 139 negative 128, 129, 132

reference 627 recursive (see Recursion) unsafe negative 139-140 (see also Question)

Queryevaluation 122-123, 126, 140, 148, 153

failure 518 in databases, techniques 197 recursive 166 references 593, 60 I (see also Query operations; Query pro

cessing) Query language 4, 73, 123, 203-204, 230,

407,413,463 database 332 and recursion 232,235,242,331 relational 121, 297 references 601,615,616,627,638

Query modification 515 references 636, 637

Query operations 179-195,203,209,213 reference 622

Queryoptimization 35,37,47,80,112-118,148-150,210,211,214,253-254, 407, 447, 465, 513-514, 515-516,518,521,524,580

definition of III in extensible DBMS 319,322,325,

327-328 and recursion 232-235, 243 semantic 116,261,269 and semi-naive evaluation 177 and triggers 313 references 601, 615, 616, 618, 638 (see also Transaction optimization)

Query processing 108, 142, 147-164,333, 409, 468, 512, 513-514

global 228,230,231 in extensible DBMS 315,318,319,322 relational query processor 208

Query representation 112, 115 Query-answer system 524 Query-the-User 388-389

reference 633 Question 365-401

categories 368-371 defined 366 rejection of 401 wh-questions 374, 375, 377n references 614, 626, 628, 630, 642

QUIST 80

R*(DDBMS) 215 references 606, 640

RI (system) 343,407,408-410,420,429-430

architecture 410 search techniques 408-409 references 597, 623

RAP (see Relational algebra program; Re-lational Associative Processor)

Reasoning 99, 104-107 Reasoning engine (KBMS) 143-144 Recognizer, in Natural Language

processing 354 Recovery mechanisms 316,318,319,325,

328-329, 335 references 596, 601, 602, 639

Recursion \7,44,48, 125, 127, 143, 150, 159,162,230,272,318,324,331, 577,580

and massive memory 537

equati.ons 236-238 (see also Path problems)

evaluati.on .of relati.ons 165-178 .operati.ons 231, 232-236 views 236 references 593, 60 I, 603, 614, 626 (see also CI.osure, transitive; Inf.orma-

ti.on, recursive; Query languages, and recursi.on; Query .optimizati.on)

Recursi.on-the.oretic hierarchy 107, 119 Recursive transiti.on netw.orks

(RTN) 354-355 Recursively defined relati.ons (see Recur

si.on, evaluati.on .of) Redundancy

in class descripti.on 464 in RML 473

Reiter's The.orem 131 Relati.onal algebra program (RAP) 166-

171,173-178 advantages and drawbacks 167 reference 632

Relati.onal Ass.ociative Process.or (RAP) 529, 562

Relati.onal calculus (see Calculus, relati.onal)

Relational data m.odes (see Data, m.odels, relati.onal)

Relati.onal database (see Database, relati.onal)

Relati.onal M.odel (in databases) 86, 197 Relati.onal query languages (see Query lan

guage, relati.onal) Relati.onal the.ory 511 Relati.ons, evaluati.on 165-178

degenerate case 166 general case 166 (see also Recursi.on, evaluati.on .of rela

ti.ons; Semi-naive evaluati.on relati.ons)

Relevance 275-277 Requirements analysis 519 Requirements m.odelling 471, 473-475

reference 611 Requirements M.odelling Language (see

RML) Requirements specificati.ons 489-490

references 596, 609, 610, 637 Res.oluti.on refinement 64 Res.oluti.on The.orem Provers II

(see also The.orem proving .operati.ons) Resp.onse 365-401

categ.ories and functi.ons 379-401 c.omp.onents 379-380 graphic 393-394

Index 657

justificati.on/explanati.on 387-391 reference 617

RETE alg.orithm 43, 420, 420n, 427 RETINAS 426

reference 611 Rings 530 RISC 562 RML (Requirements M.odelling Lan

guage) 466, 467, 471-502, 523 asserti.on c1asses/.objects in (see Asser-

ti.ons) axi.oms/definiti.ons in 492-496 m.odelling entities in 476-480 property 475n

categ.ories 476-478 classes 476-478, 484, 493-494, 497 inheritance 479-480

requirements.of 472-473 semantics 489-497 s.orts in 501-502 subactivities in 480 time m.odelling in 471, 474, 481n, 485-

489, 490, 497-501 ROBOT xii RTI 321 RTN (see Recursive transiti.on netw.orks) R-trees 251,317, 320, 321

reference 612 Rule 582-583

base 316-317,447 and PROLOG 524 in RI 409

deducti.on 508,516,517,518,521 defined 341,342n derivati.on 332 generalizati.on.of 405 in RX system 431 inference 539 integrity 509-510,517,518 inv.ocati.on

data-driven 341, 342, 343 g.oal-driven 341, 342-343

management 512 meta- 511 pr.ocessing (see Chaining; Triggers) producti.on 342, 539 semantic interpretati.on 189 unique 162-163 update 517,521 references 629, 641

Rule/g.oal graphs 153-155,159-161,163 Rule/g.oal n.odes 150-157 Rule/g.oal trees (see Rule/g.oal n.odes) Rule-based meth.ods 538 Rule-based s.oluti.ons 334

658 Index

Rule-based systems 315,316,317,420 (see also Knowledge-based system

(KBS)) RX 448

knowledge types in 431-432 system 421-444

organization 431-432

SADT 467,473, 473n, 519 Schema 192,202-203,319,413,429,434,

504, 507-508, 512, 521 components 261 definition of 260 hierarchical 206 in SRL 423-429 meta- 423-424 and meta-data 229-230 network 206 purpose 261 refinement 259,268-274,331,404-406

SCHEME 562 reference 635

Schnorr's algorithm 240 SCI (Strategic Computing Initiative) 581,

582 SDD-l (DDBMS) 52,215

references 600, 629 Search efficiency 419-420,427-428,447,

510-511 Search procedures

constraint-directed 410-413 in large databases 507-522 polynomial time 508

Self-knowledge (see KL; KBMS, selfunderstanding)

Semantic analysis, in Natural Language 355, 361

Semantic data models (see Data models, semantic)

Semantic network 562 references 613, 620, 642

Semantic theory 83-86 Semijoin 113,114,117,211 Semi-naive evaluation 166, 176--177 Sentential calculus (see Calculus, senten-

tial) Sequential scans 244 Serializability 210-211, 256, 522, 539 Set difference operator 128 Set inclusion 236 Shadow/versioning mechanism 328 Shallow knowledge 432, 442 SIDS 536, 538 Signal transmission, efficiency 552

SIMD (Single Instruction Multiple Data) 531-532

SIMULA 472 Single Instruction Multiple Data (see

SIMD) SIRIUS-DELTA 215

reference 620 Skolem constants 129 Skolem functions 129 Skolemization 64 Slot 192, 344, 345, 429

definitional 435 in RX system 432-433 in SRL 423-429

SMALL TALK 323n, 324, 472, 473n references 603, 610, 612, 618, 619

Smart Quantifiers 190 Software design/development 7-8, 584-

585 Software engineering 7-8,471,472,503-

505, 523, 584, 577 issues in 466-467

Software, in extensible database system 319

Sparse structures 536 Spatial/temporal information (see Data,

specialized) SQL 113, 235, 524

reference 604 SRL 407, 408, 413, 415, 447, 572

description 423-425 knowledge representation in 426-427 and organization level issues 421-422 search techniques 424-425 and symbol level operations 419-421 reference 609 (see also CALLISTO; ISIS; Rl system)

SRL-OPS 416 Statistical knowledge/operations 431,

440-441,442, 449 (see also Data, statistical; Database, sta

tistical) STEAMER 393n Storage structures 325-326, 580, 582

in RX 437 references 600, 601

Strategic Computing Initiative (see SCI) STROBE 498

reference 634 Subschema 202, 203 Subsumption 75

reference 597 (see also KRYPTON)

Supercomputers 520, 530, 532, 541, 543 reference 632, 633

Symbol level 37,43,63-64,69,217-218, 407, 408, 417-419, 430, 447, 519

Defined 9-12, 55-56, 57 Reference 599 (see also SRL, and symbol level)

Symbolic LISP machine 549 Symbols

n-ary function 501 predicate 50 I

Synchronization 421-422, 428 Syntactic processing (see Parsing) System adaptability 46-47 System design 97-99

reference 618 System engineering level 448, 524

defined 9-10, 12,55-56,57 System organization 45-47

references 613, 618 SYSTEM R 212, 254

references 591, 592 Systolic array 529, 563

reference 618

Tableau(x) 115-116,211,514 Tactical Communication, Command, Con

trol and Intelligence (see C31) TAG (see Tree Adjoining Grammar) TAXIS 466, 473, 498, 519

reference 626 Taxonomies 524, 577 TBox (see KRYPTON) TELL (see KL; Knowledge base, opera

tions in; KRYPTON; Update operations)

TEXPLATE 392 Theorem proving operations 18, 19, 22,

29n, 34, 65, 67, 88-89, 108, 122, 123,197,235,301,312,313,341, 445, 446, 468, 500

Thinking machines 551 Thrashing 536 Time, axioms 492 Time modelling (see RML) Time-Oriented Database system (see TOD) Time-space semantics 580 TOO (Time-Oriented Database sys-

tem) 436-437, 443 Tokens 475, 502 Topologically ordered traversal 240-241 Tractability 7,67, 67n, 88-89, 90, 503-

505,519 reference 597

Transaction operations defined III, 203

optimization 229 processing 407

Index 659

and massive memory 539 references 599, 609, 611

Transducer, in Natural Language processing 354

Tree Adjoining Grammar (TAG) 355 Triggers 255-256,297-314,335

dependent 298 lazy 302-305,314 priority 305-310 reference 607

Truth maintenance 344n, 520 references 606, 623

Truth valuation 21, 26-28, 32-33 Turing machine 60 Type definitions 232, 508

Unary predicates 344 Uniformity, in RML 473 Unique names assumption 74 Universal set inference 377 UNIX 426 UNREACHABLE relation 136-138, 140 Update, granularity of 453, 454, 455 Update operations 17-18, 19n, 22, 180-

181, 203, 209, 298, 301, 333, 512, 514-515

in KL 33-34 and massive memory 541-542 optimization 557 in RML 474-475

Useless free executions 174-177

van Neumann Machines 531, 565 Variable depth quiescence analysis 340 Verification (see Response) Versions/versioning 213, 246, 255, 316,

318, 326, 333-334, 453, 459, 520, 572 alternatives 288, 289-290 derivatives 289-290 effective 457 in design databases 288-295 type-specific 329 version histories 458-459 version life cycles 456, 459 references 595, 618 (see also Alternatives; Shadow/version

ing mechanism) VEXED 404-405 View 202

definition 112,148,230,231,312-313, 508

660 Index

View (cont.)

reference 617 integration 217, 472 processing 68n relational 126

references 607 updates 516

reference 617 references 617, 636 (see also Backward chaining)

VLSI 315-318 passim, 326, 328, 335,404, 454, 536, 565

references 618, 619, 625

von Neumann bottleneck 552, 553 von Neumann machines 558

reference 592

Warshall's algorithm 240 Wff (well-formed formulas) 20n, 223, 225 Wh-questions (see Questions,

wh-questions)

XCON 343, 347 XCON/RI (see RI system)

Date post:	14-Sep-2019
Category:	Documents
Upload:	others
View:	7 times
Download:	0 times

Contributors' Addresses - Springer978-1-4612-4980-1/1.pdf · Contributors' Addresses 589 Hector...

Documents