skip to main content
10.1145/15433.15857acmconferencesArticle/Chapter ViewAbstractPublication PagesgroupConference Proceedingsconference-collections
Article
Free Access

Handling shared resources in a temporal data base management system

Published:01 December 1986Publication History

ABSTRACT

An important component of planning involves keeping track of what various agents intend to do and recognizing situations in which certain planned-for activities are likely to interfere with one another. In planning situations involving several agents participating in a cooperative endeavor, this process can be automated to a high degree thereby facilitating coordination between agents. The more difficult aspects of planning, how to choose what activities to perform and what to do when those choices lead to problems, are left to the agents themselves. This paper demonstrates how the use of an interactive temporal data base management system can direct the inter-agent communication necessary to coordinate the use of shared resources and deal with complex scheduling problems. It is argued that much of the paper work normally associated with routine office transactions can be eliminated through the use of this temporal data base.

References

  1. 1.Barber, G., Supporting organizational problem solving with a work station, A CM Transactions on Oj~ee Information Systems, I (1983), pp. 45-67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Clocksin, W.F. and Mellish, C.S., Programming in Prolog, (Springer*Verlag, 1984). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Croft, W. B. and Lefkowitz~ L. S., Task Support In an Office System, A CM Transactions on Office Information Systems, 2 (1984), pp. 197-212. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Dean, Thomas, Planning and Temporal Reasoning under Uncertainty, Proceedings iEEE Workshop on Principles of Knowledge-Based Systems, IEEE, 1984.Google ScholarGoogle Scholar
  5. 5.Dean, Thomas, Temporal Imagery: An Approach to Reasoning about Time for Planning and Problem Solving, Technical Report 433, Yale University Computer Science Department, 1985.Google ScholarGoogle Scholar
  6. 6.Dean, Thomas, Handling Shared Resources in a Temporal Data Base Management System, Decision Support Systems, (1986). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Doyle, Jon, A truth maintenance system, Artificial Intelligence, 2 (1979), pp. 231-272.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8.Hewitt, Carl, PLANNER: A Language for Proving Theorems in Robots, Proceedings IJCAI 1, Washington, D. C., IJCAI, 1969.Google ScholarGoogle Scholar
  9. 9.McDermott, Drew V., A temporal logic for reasoning about processes and plans, Cognitive Science, 6 (1982), pp. 101-155.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.McDermott, Drew V., The DUCK Manual, Technical Report 399, Yale University Computer Science Department, 1985.Google ScholarGoogle Scholar
  11. 11.Wiest, J. D. and Levy, F. K., A Management Guide to PERT/CPM (Prentice-Hall, New Jersey, 1969).Google ScholarGoogle Scholar

Index Terms

  1. Handling shared resources in a temporal data base management system

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          COCS '86: Proceedings of the third ACM-SIGOIS conference on Office information systems
          December 1986
          122 pages
          ISBN:0897912101
          DOI:10.1145/15433

          Copyright © 1986 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 December 1986

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article
        • Article Metrics

          • Downloads (Last 12 months)22
          • Downloads (Last 6 weeks)5

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader