Method for automatically reconciling entries on copies of electronic calendars in a data processing system

Abstract: An electronic calendaring method for use in a data processing system in which calendar entries that have been made for the same time span independently on two different copies of the calendar can be automatically and interactively reconciled. A method permits a calendar owner to obtain a machine readable transportable copy of his calendar on a diskette, to update that copy when the master copy is not available to him because of a business trip, for example, and upon his return to automatically and interactively reconcile the updated entries that have been made to both copies so that at least one of them reflects the correct status of calendered events for that owner.

Description: This invention relates in general to electronic calendaring methods, for use in data processing systems and in particular to a calendaring method in which a calendar owner can automatically and interactively reconcile independent entries made within a designated time span on two different copies of his calendar. The prior art has disclosed a number and variety of interactive electronic calendaring systems and method. The objective of all of these systems is primarily to assist the person who, for a number of different reasons, maintains a calendar of future events containing various information about the event at entry points on the calendar which relate to the time of the event. The increase of personal computers and intelligent workstations in recent years has made it possible for calendar owners to establish and maintain their calendars on these interactive type data processing systems. Two general types of interactive electronic calendaring systems have thus evolved in the art. In one type of calendaring system, the owner of the calendar is generally also the user of the workstation and that workstation is generally not a part of a larger network. Generally, in these types of systems, the calendar functions involve presenting a screen to the user representing a day calendar divided into a number of time periods or time slots. Each period is capable of displaying a limited amount of text that the user enters. In some systems, the day calendar can scroll vertically to present more time periods to the user or horizontally to present longer text entries. The operator can generally "page" forward or backward and, in most arrangements, can display a requested date. These calendaring methods generally do not limit the type of event that is calendared nor the terminology employed at any of the entry points and, to that extent, function in the same manner as conventional manual calendars or appointment books. The electronic calendaring method and systems do have an advantage over the prior art manual calendaring of events in that the user generally has the ability to scan a time span involving a large number of days and identify calendared events quite rapidly. The other type of calendaring arrangement that has developed in the prior art involves multi-user environments having a large number of terminals or workstations which are generally part of a larger communication network. Usually these networks have been established to permit the users to interact with each other and with data maintained on the system. In this environment, a user at a terminal or workstation can send a message to one or more of the other users on the network concurrently, and is notified when the addressees have received and read the message. In most of these environments, each user generally maintains a calendar, and in many of these environments the reason for having a network in which users interact, quite often involves user interaction that requires reference to the respective electronic calendars of the users. A considerable amount of time is therefore spent by calendar users in many organizations, with people checking and rearranging their calendars to accommodate various events such as meetings and presentations. Calendar systems have progressed to the point where a person who is calling a meeting can at least view the calendars of a number of users that he intends to invite to a meeting, in order to determine a common available time for the meeting. In this prior art system, a screen is presented to the meeting originator which requests the data necessary for the system to determine times that all potential attendees would be available. The data requested includes, for example, the length of the meeting, a time period during which the meeting should be conducted, the Ðlace of the meeting and the names of the attendees. Based on this data, the method returns a screen of available times after inspecting each attendee's day calendar during the time period for free time slots or periods. The originator then selects the beginning time and end time of the meeting, including the time and date, and invitations are automatically sent to all the attendees, requesting their attendance at the scheduled meeting. While such an automatic system saves time in finding a convenient meeting time, relative to the manual process, the process is limited to the scheduling of meetings based on "free time" as represented by the absence of a calendar entry on each of the inspected calendars. This approach does not recognize that some calendar entries are less important than others and, in practice, it is often impossible to find a common period of "free time" for a meeting that involves a large group of people or a meeting involving a number of people whose work requires a large number of meetings. Most workstations which are connected to a large system allow a calendar owner to make a copy of his calendar in machine readable form so that he can review and modify that copy at another terminal which may be at home or another location. Many individuals therefore make a machine readable copy of their calendar on a diskette which they carry with them when they are away from the office. If these individuals have portable type personal computers then it is a simple matter to update that copy as the need arises when they are away from the office. While an individual is away from his office there are generally a number of entries that are made, if only an a tentative basis, to the system copy of the calendar. These may be made by an assistant or automatically or both depending on what the calendar owner has arranged to do when he is away from the system. The problem arises that on return to the office the entries on each copy must be reconciled on a manual basis by the calendar owner or an assistant which can sometimes result in a time consuming, error prone, tedious endeavor. The present invention avoids this problem by providing at automatic interactive reconciliation process. According to the invention, there is provided, an electronic calendaring method for use in a data processing system having at least one interactive type workstation for maintaining an electronic calendar comprising a plurality of data structures each of which individually defines a calendar entry and which collectively define a copy of at least one persons' calendar, said workstation including a diskette drive for transferring data, including said copy, between said system and a removable diskette to permit said calendar owner to create a personal copy resulting in two separate calendar copies, each of which may be updated independently with different entries as the need arises and which are periodically reconciled so that at least one of said copies reflects the correct set of calendar entries at the appropriate time slots after the reconciling process, and in which entries which are assigned non-conflicting time slots are reconciled automatically by transferring calendar event data from one copy to the other and conflicting entries which are assigned the same time slot are resolved interactively by the calendar owner during the reconciliation process, said method comprising the steps of; a) establishing a field in one said data structure for storing a unique identifier for the calendared event represented by said each entry; b) comparing the entries in each said copy at corresponding time slots to determine if a conflict exists; c) transferring said entry representing a calendared event to said at least one copy from the other copy when no conflict exists; d) presenting to said calendar owner any said calendar entries that conflict; and e) selecting, responsive to data entered into said workstation one of said presented conflicting entries to be entered on said at least one copy. In the preferred embodiment to be described in detail hereinafter calendar entries for the electronic calendaring system have predefined categories. In making a calendar entry on the system an owner is presented with a screen which assists in the creation of a calendar entry by requesting certain information which is stored by the system in established data structures. Each entry is assigned a unique ID number and is also time stamped with the time at which the entry is made. The time stamp of an entry should not be confused with the time slot in the calendar where the entry is placed. In reconciling the entries between the host copy and the personal copy the owner designates one of the copies as the master which will, at the end of the reconciling process, represent that owners current calendar. Generally the host copy is designated the master. The owner must also specify the time span over which the reconciling process should take place. Generally the time span will start at the time the personal copy was made which is recorded on the personal copy and end about the time the reconciling process is started. The reconcile process takes into consideration the various actions that can be taken relative to the master copy and the personal copy. The following actions are permitted by the electronic calendaring method: 1. Create a new calendar entry on either copy 2. Delete an existing calendar entry on either copy 3. Change the time slot to which a calendar entry is assigned 4. Modify the content of an entry but not the ID The logic of the reconciling process is to first identify the old entries and the new entries. Old entries by definition are entries having a time stamp prior to the time the personal copy was made. New entries by definition are entries made after the time the copy was made and therefore have time stamps which are subsequent to the time the personal copy was made. Old entries that have not been altered in any manner are identified since these will not be changed on the master copy. Each remaining pair of old entries therefore has had one entry on one of the copies either modified or deleted. If an old entry has been deleted on the personal copy it can be assumed that it was intentionally deleted by the owner and therefore that entry is deleted on the system copy. In order for an entry to be deleted from the system copy, the originator of the entry must initiate it, which in the case of meeting type entries may be some other calendar owner on the system. If that is the case, then the reconciling process assumes that it has been correctly deleted and the entry on the personal copy is ignored. The calendar owner is given the option at the time he requests the reconciling operation as to whether entries that are under his control and that were deleted by an assistant should be presented to him for review or should be permanently deleted. The last set of old entries to be considered are those entries which were modified. By definition a modified old entry pair will have the same IDs and time slots on each copy but the time stamps of the entries will be different. Only two conditions can exist. The first is that one time stamp is prior to the time the copy was made. The second condition is that both time stamps are subsequent to the time the copy was made but since the IDs and time slots were the same the entries were correctly identified as old entries. In the first condition the entry with the time stamp that is subsequent to the copy time prevails and is transferred to the master copy if it is not on the master copy. The second condition in which both entries have been modified is taken care of by doing a comparison of the various data in each entry to insure that a conflict really exists since it is possible that both entries were updated with the same information at different times in which case there is really no need to take any action on the master copy. If the comparison operation on the data indicates that there are differences but they are not necessarily inconsistent then the data is combined in the entry on the master calendar. An example of a difference that could be considered as not being inconsistent is data in a comment field of a data structure associated with one entry and not in the other entry. In the event a valid inconsistency is detected both entries are flagged for presentation to the owner for conflict resolution. The new entries on each copy within the specified time span will by definition have a unique time stamp which is subsequent to the time the copy of the calendar was made. Each new entry on the personal copy is therefore transferred to the master copy at the corresponding time slot. If the time slot is taken by another entry a conflict exists and the entries are flagged for presentation to the calendar owner. New entries on each copy which were modified present no problem since only one copy of the modified entry exists and it is treated basically as an unmodified new entry. A new entry on the personal copy that was deleted is ignored since it is assumed it was deleted intentionally by the owner. New entries on the master copy that were deleted are treated in the same manner that old deleted entries were treated. Deleted entries under control of other calendar owners are assumed to have been deleted correctly. Deleted entries under the control of the calendar owner are either treated as deleted or presented to the owner, at his option, to ratify or veto the prior deletion. The preferred embodiment will now be described, by way of example, with reference to the accompanying drawings, in which: Fig. 1 illustrates an interactive workstation in which the method of the present invention may be advantageously employed; Fig. 2 illustrates a network of interactive workstations of the type shown in Fig. 1; Figs. 3a-3c illustrate screens which are employed by the users in calendaring an event; Fig. 4 illustrates a screen which is employed by a calendar owner to assist in reconciling two different copies of the same calendar for a given time period; and Fig. 5 is a flow chart, illustrating the detailed steps of the method of the present invention. Fig. 1 illustrates the functional components of an interactive type data processing terminal on which the electronic calendaring method of the present invention may be advantageously employed. The terminal comprises a processing unit 11 which includes a microprocessor block 12, a semiconductor memory 13, and a control block 14 which functions to control input/output operations in addition to the interaction between the micro processor block 12 and the memory unit 13. The terminal further includes a group of conventional peripheral units including a display device 16, a keyboard 17, a printer 18, a disk storage unit 19, and a modem 20. Since the details of the above described functional blocks form no part of the present invention and can be found in the prior art, only a brief functional description of each block is set forth, along with a description of their interactions, sufficient to provide a person of ordinary skill in the art with a basis of understanding the electronic calendaring method. Processing unit 11 corresponds to the "system unit" of a personal computer system such as the IBM XT or IBM AT type systems. Unit 11 is provided with an operating system program which may be one of the many versions of DOS (Disk Operating System) which is normally employed to run the systems. The operating system program is stored in memory 13 along with one or more application programs that the user has selected to run. Depending on the capacity of memory 13 and the size of the application programs, portions of these programs, as needed, may be transferred to memory 13 from the disk storage unit 19 which includes a diskette drive and may include, for example, a 30 megabyte hard disk drive. The basic function of the disk storage unit is to store programs and data that are employed by the system and which may readily be transferred to the memory unit 13 when needed. The function of the diskette drive is to provide a removable storage function for entering programs and data into the system, and a vehicle for storing data in a form that is readily transportable for use on other terminals or systems. Display device 16 and keyboard 17 together provide for the interactive nature of the terminal, in that in normal operation, the interpretation that the system gives to a specific keystroke by the operator depends, in substantially all situations, on what is being displayed to the operator at that point in time. In some situations, the operator, by entering commands into the system, causes the system to perform a certain function. In other situations, the system requests the entry of certain data, generally by displaying a prompt type of menu/message screen. The depth of the interaction between the operator and the system varies by the type of operating system and the application program, but is a necessary characteristic of terminals on which the method of the present invention may be employed. The terminal shown in Fig. 1 further includes a printer 18, which functions to provide hard copy output of data developed or stored in the terminal. Lastly, the modem 20 functions to transfer data from the terminal of Fig. 1 to a host system through one or more communication links which may be a commercial type link or a dedicated communication link. Fig. 2 illustrates a network 21 of interactive type workstations of the type shown in Fig. 1. As illustrated, the network includes a plurality of terminals which are interconnected with each other and to a host central processing unit 23, which in turn is connected via communication link 24 to a second host processing unit 25, which also connects to another network 26 of interactive workstations. Functionally, the system operates to allow one terminal to communicate to one or more other terminals using established communication protocols, so that the various serially connected communication links are transparent to the operator. Such systems are well known in the art, and are currently in extensive commercial use. Since these communication links per se are not part of the present invention, only those details that are necessary for an understanding of the calendaring method of the present invention will be described. It should therefore be assumed in the following description, that each workstation on the network has a system node address and a "post office" address, and that to simplify the description, there is only one individual assigned to each node on the network. It should further be assumed that conventional communication services are provided by the system, such as directory listings of individual calendar owners and shareable resources such as meeting rooms, etc., which require scheduling. The system shown in Fig. 2 processes information as various types of data objects such as text data objects, graphic data objects, and calendar data objects. Each of these data objects are represented by a datastream which comprises a series of structured fields. A calendar object datastream has the following sequence of structures. The format of the datastream for other type data objects contain the begin document, begin page, end page, and end document data structures. Structured fields corresponding to those listed above for a calendar object are also employed for other type objects. A structured field is a self-describing entity which contains related groupings of parameter values and triplets. The structure field, as shown below, has two parts: the Structured Field Introducer and the Structured Field Content. The structured field begins with a Structured Field Introducer. The syntax and semantics of the Structured Field Introducer are defined by the architecture which governs the datastream in which the structured field is found. The Structured Field Introducer contains as the first two bytes a parameter which defines the length of the structured field. It also contains an identification code which uniquely identifies the structured field. The Structure Content portion of each structured field contains structures and triplets, which give the structured field its meaning. Parameters in the triplets define the attributes of the Calendar Object. Every parameter has a value either explicitly appearing in a triplet, inherited from a control structure in the datastream's hierarchy, or implicitly defined as a default. This default may also be the alternate action value. Every structure is either required or optional. A required structure appears in the object because the function of that structure is required and for proper performance of the function an value is necessary. An optional structure need not appear in the object either because the function of that structure is not required or because the function is required, but default values are acceptable for all parameters. As shown above, a calendar data (CAD) structured field (SF) precedes the actual calendar data. A calendar data descriptor (CDD) SF can precede the CAD SF to provide formatting information for the data that follows. Calendar data comprises named data structures and named triplets which are composed of parameters. A parameter is a variable to which a value is assigned. Parameters can be optional or required. Parameters are also classified as terminal or non-terminal. A terminal parameter is merely the last parameter in a string of parameters. A parameter can have one of three types of values assigned. 1. NUM - This is a number or a numerical value. 2. COD - This is a code assigned a specific meaning. 3. BST - This is a bit string of binary elements, each of which is usually independent of the other. In the following discussion it will be assumed that a byte comprises 8 bit positions numbered 0-7 from left to right, with position 0 being the high order position. Bit position 0 represents 2**7 (2 to the 7th power), while bit 7 represents 2**0 (2 to the 0 power). The various calendar structured fields and calendar triplets are defined by the following type of table. In the figure: BYTES refers to the position, indexed on zero. NAME is the name by which reference is made to the parameter. TYPE denotes the syntax of the parameter by "type," The architected types NUM, COD, and BST were described earlier. LGTH denotes the length of the field in terms of the exact number of bytes or the maximum number of bytes permitted. OPT refers to the optionality of the parameter's appearance in the structure or triplet: O means that the parameter is optional. R means that the parameter's appearance is required. If a required parameter is missing, an exception condition exists. The alternate action is to ignore the structure, self-defining field, or triplet to which the missing parameter belongs. Syntactically descriptive material below the figure indicates what additional restrictions apply to the structure or triplet defined by the figure. Calendar structures and calendar triplets employed for the various event types which are calendared and other structures which are relevant to the present invention will be described using the above-described format. After the structures are described, the display screens that are presented to calendar owners by the system in order to solicit information when a calendar owner wants to perform a calendaring function will be described. A flow chart setting forth the detailed steps of the method of the present invention will then be described. In the preferred embodiment, calendar entries are classified into a number of different types. Since the invention contemplates interchanging calendar data throughout the system, including terminals that are remotely connected, such as those shown in Fig. 2, entry types and presentation language are controlled by a defined architecture. While the same display screen may be employed to solicit the data for a number of different event types, the data structures and triplets, required or optional, will vary by event type. While some of the structures to be described and the triplets associated with these structures are not directly involved in the present invention, they have been described in order to provide background for the reader. The various calendar object data structures to be described are preceded by a calendar data structure shown below. The Calendar Data SF (CAD) identifies the data as calendar data and specifies the length of the calendar data. The Calendar Data SF contains, for example, up to 32767 bytes of calendar structures and calendar triplets (called "Calendar Data"). Calendar data varies with the function employed by the generator of the object. MAJOR CALENDAR STRUCTURES DESCRIPTION This section describes the major structures that are involved in the present invention. The structures consist of a mixture of calendar triplets. The triplets are described in the Calendar Triplets Description section that follows this section. The calendar structures are preceded by the Calendar Data structured field (CAD). Parameter values specified by the system can be overridden by parameters specified in calendar data. For example, the Code Page of Symbols for Displaying and Printing Data. In the structure description, bits are consecutively numbered from left to right starting with zero. The format for all of the structures is the same. The format is shown below. where; LENGTH = A two-byte value of the number of bytes in this structure including byte zero. TYPE = A two-byte binary number that designates a specific structure function. TRPLT1 TO TRPLTn = Calendar Structure Triplets. The length of structures can vary depending on the number of triplets included. If the length excludes all or part of an optional parameter in a triplet, then the value for that parameter and any parameters that follow are not changed; that is, the LENGTH field is used as specified. If a structure is invalid or unsupported, an exception is raised. If the length field excludes a required parameter or triplet, an exception is raised. If a structure contains an invalid or unsupported parameter or triplet, an exception is raised. APPOINTMENT (APP) STRUCTURE The appointment structure is shown below. The APP structure provides the fields necessary to interchange appointment information, the scheduling of appointments and requests for appointment information. CALENDAR COMMENTS (CMT) STRUCTURE The calendar comment structure is shown below. The CMT structure provides the fields necessary to interchange calendar comments. The structure supports calendar comments associated with a date and time and calendar comments not associated with a date and time. ENTRY SELECT (ENS) STRUCTURE The calendar comment structure is shown below. The ENS structure supports interchange for entries VACATION, HOLIDAY, OFFSITE and NOT NORMAL WORK HOURS calendar comments. MEETING (MTG) STRUCTURE The meeting structure is shown below. The MTG structure provides the fields necessary to interchange meeting information, the scheduling of meetings and requests for meeting information. It also provides a specific search classification to allow building a composite calendar for a specified list of calendar owners. NAMES LIST (NML) DATA STRUCTURE The names list data structure is shown below. The NML structure provides the fields to support a name, associated addresses and status. The NML may contain a list of items, such as an invitee's list, by concatenating Name (NME), Address (ADR) and User Status (UST) sequences. The list may include one or more than one name and associated information. TRIGGER (TGR) STRUCTURE The Trigger structure is shown below. The TGR structure specifies a time that a notification will occur and or a process will begin. VIEW SELECT (VSL) DATA STRUCTURE The View Select data structure is shown below. The VSL structure provides a way to request calendar views for specific category(s) and timespan(s). CALENDAR PROFILE (CPL) DATA STRUCTURE The Calendar Profile data structure is shown below. The CPL structure provides the fields necessary to interchange calendar profile information. The calendar Profile contains information that describes the associated calendar. DATE AND TIME MAP (DTM) DATA STRUCTURE The Date and Time Map data structure is shown below. The DTM structure provides an efficient way to pass date and time slot usage between calendar users. It is used to build a combination (composite) calendar from Date and Time Map responses from several users. It supports the selection of calendar entry category(s) and timespan(s) for the Date and Time Map requests and responses. AUTO RESPONSE (ARS) DATA STRUCTURE The Auto Response data structure is shown below. The ARS structure provides the fields necessary to interchange automatic response information. It allows the use of a network address(NAD), A Meeting or Appointment Structure ID (SID), A Priority (UDF) or a User Defined Field (UDF) specification to initiate an automatic response. CONFERENCE ROOM (CRM) DATA STRUCTURE The Conference Room data structure is shown below. The CRM structure provides the fields necessary to interchange conference room information. It contains information describing a conference room. CALENDAR TRIPLETS DETAIL DESCRIPTION This section describes in detail the set of calendar triplets that are the building blocks designed to be used by the Calendar Structures of the system including those described in the previous section. In the triplet descriptions, bits are consecutively numbered from left to right starting with zero. The format for all of the triplets is the same and is shown below. where LENGTH = A one-byte value of the number of bytes in this triplet including byte zero. KEYWORD = a one-byte binary number that designates a specific triplet function. PARM1 to PARMn = Parameters containing the triplet settings. The length of some triplets can vary depending on the number of parameters specified. If the length excludes an optional parameter or part of an optional parameter, then the value for that parameter and any parameters that follow are not changed; that is, the LENGTH field is used as specified. If a triplet is received in which the length exceeds the maximum value required to include all parameters, an exception is raised since the additional values are considered to be unsupported parameters. Also, if the length field excludes a required parameter, an exception is raised. Since bytes 1 and 2 of all the triplets are identical, they are not shown for each triplet. Only bytes 2 through n will be described. CAPACITY (CPC) TRIPLET DATA STRUCTURE The CPC DS is shown below The CPC triplet specifies the capacity for an associated identified facility. CPC Parameters CAPACITY - Specifies the number of persons accommodated. Values 1 - 255 CONFERENCE ROOM EQUIPMENT (CEQ) TRIPLET DATA STRUCTURE The CEQ data structure is shown below. The CEQ triplet specifies the equipment in the conference room. CEQ Parameter Equipment - Specifies a specific piece of equipment in the conference room. Bit 0 = Overhead Projector 1 = Projection Screen 2 = Movie Projector 3 = Slide Projector 4 = Video Recorder 5 = Television 6 = Flip Chart Paper 7 = Flip Chart Easel 8 = Display Terminal 9 = Conference Telephone 10 = Telephone 11 = Writing Board 12 - 31 Reserved CALENDAR SCOPE (CSC) TRIPLET DATA STRUCTURE The CSC DS is shown below. The CSC triplet defines the timespan supported by the calendar. CSC Parameters CALENDAR BEGIN DAY - The day of the year that the calendar timespan begins. CALENDAR BEGIN YEAR - This is the begin year for the timespan supported in the calendar. CALENDAR END DAY - The day of the year that the calendar timespan ends. CALENDAR END YEAR - This is the end year for the timespan supported in the calendar. CALENDAR TYPE (CTP) TRIPLET DATA STRUCTURE The CTP DS is shown below The CTP triplet specifies the calendar type. It is only valid when used in the Calendar Profile. It defines how to present an entire calendar. CTP Parameters TYPE - Specifies the calendar type such as Gregorian, Julian, Muhammadan, Jewish, Lunar, Shop. DATE AND TIME (DTT) TRIPLET DATA STRUCTURES The DTT DS is shown below. The DTT triplet specifies the dates and times for the associated triplets in the calendar structure. DTT Parameters DAYLIGHT SAVINGS INDICATOR - Specifies Daylight Savings Time is active. This parameter, in conjunction with the Time Zone, identifies the time zone and allows the correct time zone label (i.e., CST or CDT) to be applied to the time. TIME ZONE INDICATOR - The Time Zone Indicator is the displacement from Greenwich Mean Time (GMT) for the time specified. Values are specified in half hours from GMT to handle half-hour zones. BEGIN DATE DAY - The day of the year when the event begins. BEGIN DATE YEAR - The year the event begins. BEGIN TIME - Begin Time specifies the event start time in seconds. END DATE DAY - The day of the year when the event ends. END DATE YEAR - The year the event ends. END TIME - End Time specifies the event stop time in seconds. Date is specified as a combination of two, two byte parameters (day of the year and year). Time is local time in seconds beginning at midnight. One Begin Date and Begin Time is required in each DTT triplet. The Begin and End, Date and Time sequence may be repeated if additional begin and end date and begin and end times are needed. If more dates and times then can be sent in one DTT triplet are needed, additional DTT triplets can be included in the Calendar Structure. The only restriction is the byte structure length. DETAIL (DTL) DATA STRUCTURE The DTL DS is as follows. The DTL triplet contains character data in the active or selected code page. DTL Parameters CHARACTER STRING - Text information associated with a calendar entry. If the CGCSGID (SCG) is changed in a character string, the DTL triplet must be ended and another one built. ENTRY CATEGORY (ECT) DATA STRUCTURE The ECT DS is shown below. The ECT triplet provides a specific category for unavailable time and for open time on a calendar. The ECT triplet is used to specify calendar entry category(s) in requests and replies for both the Date and Time Map (DTM) and the View Select (VSL) structures. ECT Parameter CATEGORY - A four byte, bit encoded value. Combinations of more than one category bit are allowed. The categories provide both request and response categories for both Date and Time Map (DTM) and View Select (VSL) calendar structures. Bits 0 through 20 may be used for both DTM and VSL categories. Bits 21 through 24 are used in View Select only. If they are used in a Date and Time Map, they are ignored. BIT SIGNIFICANCE ENCODING 0 = Holiday (General) - The owner will work on this holiday. 1 = Holiday (Confirmed) - A confirmed calendar owner holiday. 2 = Holiday (Tentative) - A tentative calendar owner holiday. 3 = Vacation (Confirmed) - Confirmed calendar owner vacation. 4 = Vacation (Tentative) - Tentative calendar owner vacation. 5 = Offsite (Confirmed) - The calendar owner will not be at the normal work location and will not be available. 6 = Offsite (Tentative) - The calendar owner has tentatively scheduled an activity away from the normal work location. 7 = Not Normal Work Hours - Categorizes hours that are not normally worked. 8 = Confirmed Meetings (Not Attended) - The calendar owner will not attend. 9 = Confirmed Meetings (Attended) - The calendar owner will attend. 10 = Confirmed Meetings (May Attend) - The calendar owner's status for this meeting is tentative. 11 = Tentative Meetings (Not Attended) - The calendar owner will not attend. 12 = Tentative Meetings (Attended) - The calendar owner will attend this meeting if it becomes confirmed. 13 = Tentative Meetings (May Attend) - The calendar owner's status for this meeting is tentative. 14 = Confirmed Appointments (Not Attended) - The calendar owner will not attend. 15 = Confirmed Appointments (Attended) - The calendar owner will attend. 16 = Confirmed Appointments (May Attend) - The calendar owner's status for this appointment is tentative. 17 = Tentative Appointments (Not Attended) - The calendar owner will not attend. 18 = Tentative Appointments (Attended) - The calendar owner will attend this appointment if it becomes confirmed. 19 = Tentative Appointments (May Attend) - The calendar owner's status for this appointment is tentative. 20 = Non-Scheduled Time - Identifies open time on the calendar. This category is most effective if used alone. 21 = Date and Time Only (VIEW SELECT ONLY) - Selects date and time for all categories not specifically requested in a View Select. 22 = Private Entry (VIEW SELECT ONLY) - Only date and time may be provided in the response to a calendar View Select request. 23 = Calendar Comments (VIEW SELECT ONLY) - Character data entries. 24 = Triggers (VIEW SELECT ONLY) - Entries that start a process and/or notify. 25 - 31 = Reserved If all Category bits are set to one in a request for a Date and Time Map, the information returned is meaningless because it includes both scheduled and non-scheduled time. The "NonScheduled Time" bit should be used carefully if it is used with other bits to obtain meaningful data. The "Not Normal Work Hours" bit should also be used carefully for similar reasons. ENTRY CLASSIFICATION (ENC) DATA STRUCTURES The ENC DS is as follows The ENC triplet provides a specific Classification code for a calendar entry that occupies a block of time. ENC Parameters CLASSIFICATION - A two byte bit encoded value. Combinations of more than one Classification Bit are not allowed. BIT SIGNIFICANCE ENCODING 0 = Holiday - (General) The owner will work on this holiday. 1 = Holiday - (Confirmed) A confirmed calendar owner holiday. 2 = Holiday - (Tentative) A tentative calendar owner holiday. 3 = Vacation - (Confirmed) Confirmed calendar owner vacation. 4 = Vacation - (Tentative) Tentative calendar owner vacation. 5 = Offsite - (Confirmed) The calendar owner will not be at the normal work location and will not be unavailable. 6 = Offsite - (Tentative) The calendar owner has tentatively scheduled an activity away from the normal work location. 7 = Not Normal Work Hours - Identifies times that the calendar owner is normally not at work. ENTRY SECURITY LEVEL (ESL) STRUCTURE The ESL DS is as follows The ESL triplet controls the view access for calendar entries. It is supplied by the calendar owner. ESL Parameter SECURITY - A one byte value from 0 to 2. 0 = Public (DEFAULT) The calendar may be viewed by any calendar user 1 = Shared - The calendar may be shared by a selected group. 2 = Private - Date and Time can be viewed but not associated calendar data. ERROR ACTION (EAC) DATA STRUCTURE The EAC DS is as follows. The EAC triplet specifies the action required when an exception is processed. EAC Parameter ACTION - The error action specification. BIT SIGNIFICANCE ENCODING BIT 0 = 0 - (DEFAULT) Report the exception, take the specified alternate action and continue. 0 1 - Ignore the exception, take the specified alternate action and continue. 1 - 7 Reserved. EVENT STATUS (EVS) DATA STRUCTURE The EVS DS is as follows. The EVS triplet provides status for an event such as an appointment or meeting. EVS Parameter EVENT STATUS - The status of an event. BIT SIGNIFICANCE ENCODING 0 = Confirmed (the meeting time has been established) 1 = Tentative (the meeting is tentative) 2 = Cancelled (the meeting was cancelled) 3 = Postponed (the new date and time are not set) 4 = Rescheduled (the meeting has been rescheduled) 5 = Marked for Archive (entry will be saved for reference) NAME (NME) DATA STRUCTURE The NME DS is as follows. The NME triplet specifies a name of either a person or a calendar. NME Parameters NAME TYPE - Specifies the name type. Bits 1 and 2 are mutually exclusive. Only one of these bits may be set to 1. BIT SIGNIFICANCE ENCODING 0 = (0- Name is a personal name). (1- Name is a calendar name). 1 = 1- Name is a primitive name not unique in a network 2 = 1- Name is a descriptive name unique in a network). 3 - 7= Reserved ASSOCIATED TRIPLETS - Bits set to 1 specify that User Status (UST), Network Address (NAD) and Postal Address (PAD) triplets may follow the NME triplet in any order. 0 = A User Status (UST) triplet follows that specifies the named items role and status. 1 = An Network Address (NAD) triplet follows that specifies the named item's network address(s). 2 = A Postal Address (PAD) triplet follows that specifies the named item's postal address(s) ITEM NAME - Specifies the name of a person or calendar. Values are valid characters in the active or selected code page. The maximum name size is 251 bytes. The item named by the NME triplet may be further identified using the User Status (UST),the Postal Address (PAD) and the Network Address (NAD) triplets. The NME triplet must be preceded with an SCG triplet if the characters used are not on the active code page. NAMES LIST TYPE (NLT) DATA STRUCTURE The NLT DS is as follows. The NLT triplet specifies the type of data contained in a list. NLT Parameter LIST TYPE - Specifies the list type. Combinations of bits are allowed. and/or mail addresses. BIT SIGNIFICANCE ENCODING 0 = The list contains names and associated Network Addresses. 1 = The list contains Nicknames and associated network addresses. 2 - 15 Reserved. The lists may optionally contain postal addresses and user status. The NLT triplet describes the list contents for specific list types. Lists containing the NLT are constrained to the specified contents. If the NLT is omitted the lists may contain any valid combination of names, user status and addresses. NETWORK ADDRESS (NAD) TRIPLET DATA STRUCTURE The NAD triplet data structure is shown below. The NAD triplet provides the Network Address for the item named in the (NME) triplet. The NAD Parameters include, NETWORK ADDRESS - This is the person's Network Address. Bytes 2 through 9 = USER ID BYTES 10 through 17 = NODE ID PLACE (PLC) DATA STRUCTURE The PLC DS is as follows: The PLC triplet specifies a location for an event such as a meeting or appointment. The location is described using text characters. The maximum location length is limited to 253 text bytes. PLC Parameters LOCATION - Location specifies the event location. POSTAL ADDRESS (PAD) TRIPLET DATA STRUCTURE The PAD triplet data structure is shown below. The PAD triplet provides the Postal Address for the item named in the (NME) triplet. The NAD Parameters include, POSTAL ADDRESS - This is the person's Postal Address. Valid values are valid characters in the active or selected code page. PROCESS ID (PRD) TRIPLET DATA STRUCTURE The PRD triplet data structure is shown below. The PRD triplet specifies the ID of a process such as a computer program. PRD Parameter PROCESS - A 1 to 16 byte identifier. Valid values are valid characters in the active or selected code page. RESPONSE (RSP) DATA STRUCTURE The RSP DS is as follows: The RSP triplet establishes a response that will be sent automatically as part of the AUTO RESPONSE data structure. RSP Parameter RESPONSE- Specifies what response will be sent. The Alternate indication may use any other bit BIT SIGNIFICANCE ENCODING 0 = No Action - Auto response is deactivated. 1 = Confirmed - The invitee will attend. 2 = Tentative - The invitee may attend. 3 = Not Attending - The invitee will not attend. 4 = User Acknowledge - The schedule request was received. 5 = Alternate - The response is from the invitee's alternate. RSVP (RVP) DATA STRUCTURE The RVP DS is as follows: The RVP triplet indicates that an attendance response is required. RVP Parameter RSVP - Specifies the need for a response to a meeting schedule request. BIT SIGNIFICANCE ENCODING 0 = No attendance response is required. 1 = An attendance response is required using the NML structure. SET CODED GRAPHIC CHARACTER SET GLOBAL ID (SCG) DATA STRUCTURE The SCG DS is as follows: The SCG triplet specifies the coded graphic character set global identification that is used to map subsequent text into presentable graphics. The CGCSGID that is specified by the system selects the active Character Set and Code Page. If the CGCSGID is not specified the default Character Set and Code Page specified are used. SCG Parameters CGCSGID - Coded Graphic Character Set Global ID; a concatenation of 2 two-byte numbers. The first two bytes identify the Graphic Character Set Global ID (GCSGID) expressed as a binary value. The second two bytes identify the Code Page Global ID (CPGID) expressed as a binary value. GCSGID - Graphic Character Set Global ID. CPGID - Code Page Global ID. GCSGID and CPGID are used to determine how coded text characters are translated to the graphic characters to be presented. The SCG will only select a code page for the triplet that immediately follows it. If structures containing text characters on a code page that is different from the default code page are concatenated, a separate SCG is required preceding each structure. The SCG has no affect on the NETWORK ADDRESS in the UDF triplet and the USER CODE in the UDF triplet. STRUCTURE ID (SID) DATA STRUCTURE The SID DS is as follows: The SID triplet provides an identifier for calendar structures. SID Parameters ID TYPE - Specifies the ID type BIT SIGNIFICANCE ENCODING 0 = Entry ID - Identifies a calendar entry 1 = Names List ID - Identifies a list of names 2 = Trigger ID - Identifies a trigger 3 = Profile ID - Identifies a calendar profile 4 = Auto Response - Identifies an automatic response IDENTIFIER - 1 to 44 character identifier. The SID provides a correlation ID to accomplish calendar updates from an intelligent workstation to a host, to correlate responses to a meeting notice with the meeting names list and to correlate notification of a list of people associated with a meeting or a list. SUBJECT (SBJ) DATA STRUCTURE The SBJ DS is as follows: The SBJ triplet specifies the subject for an event. The subject is described using text character. SBJ Parameters EVENT SUBJECT - This parameter specifies the event subject. Trigger Type (TTP)DATA STRUCTURE The TTP DS is as follows: The TTP triplet provides a trigger type for use in the Trigger (TGR) structure. The type may be used to activate the correct support program when a trigger structure is processed. TTP Parameters TYPE - This parameter specifies whether the type is a message, audio tone process or a combination trigger. Bit 0 = Message Trigger (Default) 1 = Audio Trigger 2 = Process Trigger - The process is identified by the Process ID will be started. 3 - 7 = Reserved TIME MAP (TMA) DATA STRUCTURE The TMA DS is as follows: The TMA triplet provides the time scale and the bit map representation of the selected time scale. The TMA is used in the DATE and TIME MAP data structure. TMA Parameters Time Scale - The time scale is the time increment represented by each bit in the Time Byte(s). Values allowed are 1 to 86400 seconds. Time Byte(s) - Each bit location in the Time Byte represents a time span equal to the Time Scale. Bit zero represents the timespan beginning at the Begin Time. TIME STAMP (TMS) DATA STRUCTURE The TMS DS is as follows. The TMS triplet specifies an entry's time zone, creation date and time and the entry creator's network address. TMS Parameters DAYLIGHT SAVINGS INDICATOR - Specifies Daylight Savings Time is active. This parameter, in conjunction with the Time Zone, identifies the time zone and allows the correct time zone label (i.e.,. CST or CDT) to be applied to the time. TIME ZONE INDICATOR - The Time Zone Indicator is the displacement from Greenwich Mean Time (GMT) for the time specified. Values are specified in half hours from GMT to handle half hour zones. BEGIN DATE YEAR - The year the event begins. BEGIN TIME - Begin Time specifies the event start time. NETWORK ADDRESS LENGTH - The Network Address length NETWORK ADDRESS - System address Bytes 12 thru 19 = USER ID - valid characters in CP256, CS930. Bytes 20 thru 27 = NODE ID - valid characters in CP256, CS930. Bytes 28 thru 139 = Reserved to support additional address. USER STATUS (UST) DATA STRUCTURE The UST DS is as follows: The UST triplet provides information regarding the person named in the Name (NME) triplet. It provides the named persons Role and Personal Status. UST Parameters ROLE - Specifies the persons role regarding the event. VALUES 0 = Caller - Person has called the event. 1 = Arranger - Person is arranging the event. 2 = Invitee (Default) - Person has been invited to the event. 3 = Mandatory Invitee - Person who must attend the meeting. 4 = Alternate - Person replacing an invitee for attendance consideration on a temporary basis. 5 = Additional Attendee - Person who is adding themselves to the distribution list associated with a group meeting. 6 = Receives Copy - Person who receives event information. 7 = Receives Blind Copy - Person who receives event information only, whose name will not appear on the distribution list. 8 = Permanent Alternate - Person replacing the invitee for attendance on a permanent basis. PERSONAL STATUS - The status associated with the name. VALUES 0 = No Action (no status has been received) 1 = Confirmed (the person will attend) 2 = Tentative (the person might attend) 3 = Not Attending (the person will not attend) 4 = User Acknowledge (received the invitation) 5 = Alternate (the invitee will not attend, but an alternate may) USER DEFINED FIELD (UDF) DATA STRUCTURE The UDF DS is as follows: The UDF triplet provides a priority and user defined field that is assigned by the calendar owner. The assigned code provides additional entry categories. UDF Parameters PRIORITY - A one byte field that specifies a priority value for a calendar entry. 1 is the highest and 10 is the lowest priority. USER CODE - An eight byte user defined code. WORK TIMES (WTM) DATA STRUCTURE The WTM DS is as follows: The WTM triplet specifies the work times for an associated calendar. Time is local time in seconds beginning at midnight. WTM Parameters DAYLIGHT SAVINGS INDICATOR - Specifies Daylight Savings Time is active. This parameter, in conjunction with the Time Zone, identifies the time zone and allows the correct time zone label (i.e., CST or CDT) to be applied to the time. TIME ZONE INDICATOR - The Time Zone Indicator is the displacement from Greenwich Mean Time (GMT) for the time specified. Values are specified in half hours from GMT to handle half hour zones. BEGIN TIME - Begin Time specifies the time block begin in seconds. END TIME - End Time specifies the time block end in seconds. One Begin Time and End Time is required in each WTM triplet. The Begin and End Time sequence may be repeated if additional begin and end times are needed. WORK WEEK PATTERN (WWP) DATA STRUCTURE The WWP Data Structure is as follows The WWP triplet specifies which days of the week are work days. Each bit that is on specifies that the day is a work day. WWP Parameters PATTERN - This parameter specifies days of the week. 0 = Sunday 1 = Monday 2 = Tuesday 3 = Wednesday 4 = Thursday 5 = Friday 6 = Saturday 7 = Reserved Table 1 on the next page summarizes the relationships of the triplets to the major Data structures. In the table the letter O' indicates that the triplet is optional for that data structure, the letter R' indicates that the triplet is Required for the data structure and the designation -' indicates that the triplet in not applicable to the data structure. THE PROCESS OF CALENDARING EVENT Fig. 3b is a screen that is displayed to the operator/calendar owner in response to the operator indicating to the system that he wants to calendar an event. This can be accomplished, for example, by selecting item 1 from the master menu shown in Fig. 3a. Assume that a meeting is scheduled at 10 a.m. on Thursday, October 7, 1986, and that the notice for the meeting is to be issued through the electronic calendaring system. The owner then enters the information into the system, employing the screens of Figs. 3b and 3c. To identify the event type after selecting option 1 on screen 3b, the operator merely presses the enter key since the cursor has automatically been positioned at the event e.g., "Meeting" on the screen of Fig. 3b. The next data entry as shown involves assigning a priority to this event. The valued to be entered is a value from 1-10 as indicated on the line following the blank for the value. The function of the priority number is to establish the relative importance of this event when viewed with regard to other commitments which are either planned or anticipated. This entry of a priority value is optional since the system will establish a default priority for the event according to some predetermined criteria which has been established for all calendar owners or alternately which gives a unique default for each specific individual. The assignment of a priority value to a calendar event either explicitly by the calendar owner or implicitly by the system is a necessary step in the view select process.The user defined field, as shown in Fig. 3b is not used in the present example. Its function is to provide a field which the user or the user community can employ for some predefined purpose. The event identifier is the official name of the meeting. The date and time of the meeting are entered next. The next entry on the screen is the names list. All the persons that are invited to attend the meeting have been listed in a names list along with their user ID, network and/or postal addresses and that list is assigned a name. The information is stored in the Names List data structure described earlier so that in the case of regularly scheduled meetings, the meeting caller only needs to identify the name of the names list. The next entry is for the name of the person calling the meeting. The last two entries are to identify the subject of the meeting and its physical location, such as a conference room. Fig. 3c is the last screen employed in calendaring an event. This screen allows an event to be assigned a security classification and to indicate if the meeting is tentative or confirmed. The remaining portion of the screen shown in Fig. 3c is for establishing a trigger reminder for the event. After all the data is entered defining the event, the calendar owner advises the system to send the meeting information that has just been entered to each of the individuals listed in the names lists. This is done in the example shown by keying the program function key PF5. The data defining the meeting particulars that were entered into the system is stored in the appropriate data structures and triplets described earlier. These data structures are transmitted to each invitee on the system in accordance with the protocols established for the calendaring system and the inter-system communication protocols that can accommodate data interchange between two different calendaring systems. The invitee calendar owner is required to respond to the meeting notice since every meeting notice contains an RVP triplet indicating that a response is required. If the invitee/owner has not established an automatic response for this notice, then the response must be entered manually. Any of the prior art methods for manually responding to a meeting notice by the invitee may be employed. For example, the screen employed for calendaring an event or one similar to that screen, may be presented to the invitee with the program function key programmed to enter the invitees' response. Alternately a special screen can be presented providing a response field for the event. The response that is entered is stored in the Personal Status field of the User Status triplet that is associated with the invitees' name in the names list. That data structure is returned to the meeting caller and stored in the names list data structure for the identified meeting. Other calendar entries are entered in a similar manner with the appropriate screens being presented to the owner in response to one of the event types being selected on screen 3b. The data that is entered into the system is stored in the corresponding data structures discussed earlier. It can be assumed in the following description that a calendar owner has an electronic calendar that is resident on the host CPU of the system of Fig. 2 and that the host is always online even though the the terminals may not be. The calendar of the owner is therefore available to other calendar owners on the system, some of who may be permitted by the owner to actually schedule confirmed meeting and appointments. It can also be assumed that the owner has made a copy of his calendar covering the next two months on a diskette and has just returned from a two week business trip during which he updated the machine readable diskette copy with a number of events by means of his portable personal computer. This copy of his calendar will be referred to as his Personal copy. It contains a Copy Time Stamp indicating the date and hour that the copy was actually made. The copy of the calendar on the system will be referred to as the Host copy. Calendar entries that are time stamped prior to the Copy Time Stamp are called old entries. Entries that are made to either copy after the Copy Time Stamp are called New entries. It should also be assumed that in his absence the Host copy of his electronic calendar was also updated. The term update is intended to include the creation of new events, the modification of existing events, the deletion of existing events, and the moving of an event from one time slot to another which is a combined deletion and creation operation. The process of reconciling the entries on the two calendars will now be explained with reference to the user interface screen of Fig. 4 and the flow chart of Fig. 5. With reference to Fig. 4, which illustrates the screen that is presented to the owner in response to the selection of option 5 on the master menu of Fig. 3a. The operator is asked to identify the names of the calendars that will be involved in the reconciliation process. The Permanent Calendar's name is the calendar that will reflect the owners current calendar at the end of the reconciliation process. In most situations this will be the copy that is on the system. The Temporary Calendar's name will be the name of the calendar that has been the Personal copy. The operator is also asked to specify the time span over which the entries are to reconciled. The beginning time span can be read from the personal copy and entered automatically or if some other beginning time is desired the owner can over write the time entered by the system. The ending time including the date must also be specified or the default period that is defined at installation time will be employed. The owner is given two options in connection with how he wants certain entries to be handled by the system. These options are designated DELETE ENTRIES' and REPLACE ENTRIES' and will be explained in detail at the appropriate time. The reconciling process first identifies Old entries that have not been changed or modified in any way in order to identify Old entries that have been, a) Deleted on one of the copies, or b) Been moved to a different time slot on one of the copies, or c) Been modified on either copy or both in a manner to provide a time stamp that is subsequent to the Copy Time stamp. Old entries that have not been changed in any way will be in the identical time slots on both copies, will have the same Structure ID and the same Time Stamp. The Old entries that were deleted on the Personal copy could, under the previous assumptions, only have been deleted by the owner. Old entries on the Host copy were deleted either by the owner's agent or in the case where the event was owned by another calendar owner such as a meeting, by the other calendar owner. If the DELETE ENTRIES option on the Reconcile screen was marked YES' then the entries on the Personal copy that were previously deleted are also deleted on the Host copy. If that option had been marked NO' then the old entries on the Host copy that were deleted are flagged to be presented to the owner for ratification or veto. A list referred to as the Old List ' is developed by identifying entry pairs which have the same Ids and which are assigned to different Time Slots on the copies where one entry has a Time Stamp prior to the Copy Time' stamp. These entries represent Old entries which have been modified in the manner in the manner indicated in sub-paragraphs b) or c) above. The OLD'' entries that have been deleted appear on an OLD DELETE' list that is developed by identifying an entry that has been deleted on one copy but not on the other copy. The OLD entries that have been moved to a different time slot are processed so the entry with a time stamp later than the Copy Time Stamp prevails, i.e. if that entry is on the Host copy it remains; if it is on the Personal copy it is transferred to the Host copy. The OLD entries that have been modified but not moved from their original time slots will have Time Stamps subsequent to the Copy Time stamp. If only one entry has a new Time Stamp that entry prevails. If both entries have new Time Stamps the entries are compared in detail to determine if the respective modifications have created a conflict situation. If the comparison indicates a conflict then the entries are flagged for later presentation to the owner. If the comparison indicates no conflict the the data from both entries is combined on the Host copy. The New entries present a more straight forward processing approach. A New entry will appear on only one copy of the calendar. A list of entries having time stamps that are later than the Copy Time stamp where each entry has a unique Structure ID will account for all new entries except entries which have been deleted. This list is called the NEW LIST'. All new entries will be placed on the Host calendar at the Time Slot indicated for the entry. New entries from the Personal Copy which are transferred to the Host copy may cause a conflict if the Time Slot is already occupied. If this occurs both entries are flagged for presentation and resolution of the conflict by the calendar owner. Entries that are deleted on either copy are deleted on both the Host copy and Personal copy if the Deletion option is selected or are presented for a view and manual edit operation by the user. There are no modified New entries since they appear as unmodified New entries and are treated accordingly. The above described operation is summarized in the flow chart of Fig. 5.

Claims: An electronic calendaring method for use in a data processing system having at least one interactive type workstation for maintaining an electronic calendar comprising a plurality of data structures each of which individually defines a calendar entry and which collectively define a copy of at least one persons' calendar, said workstation including a diskette drive for transferring data, including said copy, between said system and a removable diskette to permit said calendar owner to create a personal copy resulting in two separate calendar copies, each of which may be updated independently with different entries as the need arises and which are periodically reconciled so that at least one of said copies reflects the correct set of calendar entries at the appropriate time slots after the reconciling process, and in which entries which are assigned non-conflicting time slots are reconciled automatically by transferring calendar event data from one copy to the other and conflicting entries which are assigned the same time slot are resolved interactively by the calendar owner during the reconciliation process, said method comprising the steps of: a) establishing a field in one said data structure for storing a unique identifier for the calendared event represented by said each entry; b) comparing the entries in each said copy at corresponding time slots to determine if a conflict exists; c) transferring said entry representing a calendared event to said at least one copy from the other copy when no conflict exists; d) presenting to said calendar owner any said calendar entries that conflict; and e) selecting, responsive to data entered into said workstation, one of said presented conflicting entries to be entered on said at least one copy. A method according to Claim 1 in which said personal copy has the time recorded thereon that said personal copy was made and each said entry has a time stamp indicating the time said entry was made further including the step of identifying time slots on said copies having old entries that have not been modified or deleted. A method according to Claim 2, in which said step of identifying includes the step of comparing said identifiers of said entries in corresponding said time slots and said time stamps of said entries in said corresponding time slots and identifying said entries as old unmodified entries if both said time stamps are identical and both said IDs are identical. A method according to Claim 3 further including the step of identifying said entries in corresponding time slots as old entries at least one of which has been modified if both said identifiers are identical but said time stamps of said entries are different. A method according to Claim 3 or Claim 4 further including the step of comparing said time stamp of each said entry at said corresponding time slots against the time said copy was made and identifying each said entry as a new entry if the identifiers are not identical and each said time stamp is subsequent to said time of said copy. A method according to any one of Claims 3 to 5 further including the steps of identifying one of the two entries at said corresponding time slots when said identifiers are not identical and one time stamp is prior to said time of said copy as a time slot conflict and flagging said entries for subsequent presentation. A method according to any one of Claims 2 to 6 further including the step of identifying one said entry on one said copy as a new entry that is not in conflict when the corresponding time slot on said other copy is vacant. A method according to Claim 7 further including the step of identifying each remaining entry on said other copy that does not have an entry at the corresponding time slot on said one copy as a new entry. A method according to any one of Claims 1 to 8 in which said interactive workstation includes a display and a keyboard and said step of presenting includes the step of displaying said entries that are in conflict. A method according to Claim 4, further including the steps of comparing all the other details of said entries and flagging said entries for later presentation if said step of comparing said details identifies said entries as inconsistent, and combining said entries on said host copy if said entries are not inconsistent.

Inventors: CREE CHARLES MALCOLM NAPIER, LANDRY GRADY JAMES, SCULLY KEITH JAMES, SINGH HARINDER S, CREE, CHARLES MALCOLM NAPIER, LANDRY, GRADY JAMES, SCULLY, KEITH JAMES, SINGH, HARINDER S.
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1987
Main classification: G06F15
IPC codes: G09D3, G06F12, G06Q10