System for creating, editing, displaying, and executing rules-based programming language rules having action part subsets for both true and false evaluation of the conditional part

• US 5,596,752 A
• Filed: 03/11/1993
• Issued: 01/21/1997
• Est. Priority Date: 09/01/1989
• Status: Expired due to Term

• Current Assignee: Objectstar International Ltd. (Cloud Software Group)
• Original Assignee: Amdahl Corporation (Fujitsu Limited)
• Inventors: Robertson, Michael, Chong, Daniel T., Knudsen, Helge, Plazak, Zbigniew, Yaffe, John, Taugher, James E.
• Primary Examiner(s): Kriess, Kevin A.
• Assistant Examiner(s): BACKENSTOSE, JONATHAN
• Application Number:
  US08/029,700
• Time in Patent Office: 1,412 Days
• Field of Search: 395/600, 395/700, 395/50, 395/51, 395/53, 364/DIG. 1, 364/DIG. 2, 364/274, 364/274.5, 364/280, 364/280.7, 364/282.1
• US Class Current: 717/117
• CPC Class Codes: G06F 16/902 using more than one table in sequence, i.e. systems with three or more layers
• CPC Class Codes: G06F 8/31 Programming languages or programming paradigms
• CPC Class Codes: G06F 8/41 Compilation
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing

Abstract

A programmable computer which operates by executing rules, each including a rule name, and optionally: input parameters, a set of conditions, a set of actions associated with each condition, and a set of exception handlers. A condition is a logical expression which evaluates to a true or false boolean value, while an action is an executable statement. An exception handler contains executable statements.

The computer includes text entry and display means for programming of rules. A rule is displayed with each condition and each action having a row of text. The computer generates a yes/no quadrant into which a programmer may enter sequence numbers, to associate ordered sets of actions with individual conditions. Sequence numbers may be entered not associated with any condition, to define a set of default actions.

Upon entering a rule, the computer sequentially evaluates the rule'"'"'s conditions. Upon a condition evaluating to true, the computer executes the set of actions associated with that condition, then exits the rule. If the rule contains no conditions or none evaluates to true, the set of default actions will be executed, and the rule exited.

If, during execution of the rule, the computer detects an exception event, such as a missing datum or other execution error, the computer passes to the rule the name of the detected exception event. If the rule contains an exception handler bearing the same name, the computer will execute the statements within that exception handler.

Claims

1. A programmable computer for use in creating, editing, displaying and executing programs in a rules-based programming language, said computer comprising:

means for displaying;

means for storing a set of actions in the form of executable statements and a plurality of rule means each of said rule means comprising;

i) a rule name,

ii) a set of parameters through which the computer provides input data to said rule means,

iii) a set of conditions in the form of logical expressions, each evaluating to a boolean result, said boolean result comprising one of a true state and a false state,

iv) a first ordered subset of actions from said set of actions to be executed when said result of said condition is evaluated as said true state, and

v) a second ordered subset of actions from said set of action to be executed when said result of said condition is evaluated as said false state;

wherein each action in said first and second subsets of actions has a sequence number indicating the order in which said actions in each said first and second subset of actions are to be executed; and

rule execution means for executing a rule means comprising;

means, coupled to said means for storing, for sequentially evaluating said condition of said set of conditions for a rule means being executed by said rule execution means and for generating an evaluation signal representing a first boolean value when said condition is in said true state and a second boolean value when said condition is in said false state; and

means, responsively coupled to said means for evaluating, for executing, in response to said evaluation signal for said condition presently being evaluated by said evaluation means for said rule means presently being executed by said execution means in order, said first subset of actions in response to said evaluation signal representing said first boolean value and in order said second subset of actions in response to said evaluation signal representing said second boolean value.

2. The computer of claim 1 wherein:

said means for storing further stores a set of exceptions, each exception of said set of exceptions including an exception name and a set of exception actions coupled with each said exception name and each said rule name comprises;

vi) a subset of exceptions from said set of exception identified by said exception'"'"'s names; and

said rule execution means further comprises;

means, coupled to said means for executing, for detecting exception events during execution of said rule name and for returning, responsive to detection of a given exception event, an exception name identifying the given exception event; and

means, coupled to said means for storing and responsive to return of a said exception name by said means for detecting, for executing the set of exception actions coupled to said exception name, when said exception name is the name of an exception in said set of exceptions for the rule name presently being executed by said rule execution means.

3. The computer of claim 1 further including:

text entry means for inputting text for a rule name indicating said rule name, set of parameters, set of conditions, and set of actions;

display means, coupled to said text entry means, for displaying,

i) said text indicating said rule name and set of parameters as a row of text,

ii) text indicating each condition from said set of conditions as a row of condition text and the respective rows of condition text as a column, and

iii) text indicating each action from said set of actions as a row of action text and the respective rows of action text as a column;

means, coupled to said text entry mean, for generating and displaying a yes/no quadrant of boolean indicators arranged in yes/no rows each uniquely associated with one row of condition text and the corresponding condition, and in yes/no columns each including exactly one indicator of said first boolean value, said exactly one indicator being in a yes/no row uniquely coupling one of said conditions with the given yes/no column such that each condition is uniquely coupled with exactly one yes/no column; and

means, coupled to said means for generating and displaying, for accepting and displaying action sequence numbers in an action quadrant arranged in action rows each uniquely associated with one row of action text and its action, and in action columns each uniquely associated with one yes/no column and the condition coupled with that one yes/no column, each given action sequence number associating, through its action row and action column, a given action with a given condition, the action sequence numbers within each action column defining the subset of actions associated with the given condition, and the order of execution of the subset of actions being defined by the relative magnitudes of the action sequence numbers in the given action column.

4. The computer of claim 3 further comprising:

said text entry means being further for inputting text for a rule indicating a subset of exception names;

said display means further displaying;

iv) text of said set of exceptions names.

5. The computer of claim 1, wherein said conditions and actions includes object coded rule instructions where:

each condition, which has associated actions, including a series of instances of a first instruction (@ACALL), execution of each of which causes execution to jump to a given action associated with the current condition;

each action which terminates in a second instruction (@ARETURN), execution of which causes execution to return from execution of the given action to a point at which the given action was invoked.

6. The computer of claim 5 wherein said object coded rule instructions further include:

a third instruction (@AEND), which is not executed, but which separates said set of conditions from said set of actions.

7. The computer of claim 2, wherein said conditions, actions and exceptions includes object coded rule instructions where:

each condition, which has associated actions, including a series of instances of a first instruction (@ACALL), execution of each of which causes execution to jump to a given action associated with the current condition;

each action which terminates in a second instruction (@ARETURN), execution of which causes execution to return from execution of the given action to a point at which the given action was invoked; and

said means for detecting exception events causes said computer to execute a fifth instruction (@SIGNAL), execution of which creates an exception event and specifies a name of the created exception event.

8. The computer of claim 5, wherein said means for executing first and second subsets of actions further includes:

means for operating a virtual stack which holds data including a first datum (D1) and a second datum (D2), and executes object coded arithmetic instructions upon data in said virtual stack, said arithmetic instructions comprising;

a sixth instruction (@ADD), execution of which pops two data from said virtual stack, performs addition upon said two data, and pushes the sum onto said virtual stack (D2+D1);

a seventh instruction (@SUB), execution of which pops two data from said virtual stack, performs subtraction upon said two data, and pushes the difference onto said virtual stack (D2-D1);

an eighth instruction (@MULT), execution of which pops two data from said virtual stack, performs multiplication upon said two data, and pushes the product onto said virtual stack (D2*D1);

a ninth instruction (@DIV), execution of which pops two data from said virtual suck, performs division upon said two data, and pushes the quotient onto said virtual stack (D2/D1);

a tenth instruction (@EXP), execution of which pops two data from said virtual stack, performs exponentiation upon said two data, and pushes the result onto said virtual suck (D2↑

D1);

an eleventh instruction (@UNM), execution of which pops one data from said virtual stack, and pushes the unary negative of said one data onto said virtual suck (-(D1)); and

a twelfth instruction (@CAT), execution of which pops two data from said virtual suck, performs concatenation upon said two data, and pushes the concatenated result onto said virtual stack (D1D2).

9. The computer of claim 5, wherein said means for executing first and second subsets of actions further includes:

means for operating a virtual stack which holds data, and executes object coded relational instructions upon dam in said virtual stack, where said means for executing in executing a relational instruction pops a first datum (D1) and a second datum (D2) from said virtual stack and compares said first datum to said second datum according to a relation specified by said relational instruction, and pushes onto said virtual stack a boolean indicator of the result of the comparison, said relational instructions comprising;

a thirteenth instruction (@EQ) comparing said second datum to said first datum for equality (D2=D1);

a fourteenth instruction (@NE) comparing said second datum to said first datum for inequality (D2-=D1);

a fifteenth instruction (@LT) comparing whether said second datum is less than said fast datum (D2<

D1);

a sixteenth instruction (@LE) comparing whether said second datum is not greater than said first datum (D2<

=D1);

a seventeenth instruction (@GT) comparing whether said second datum is greater than said first datum (D2>

D1);

an eighteenth instruction (@GE) comparing whether said second datum is not less than said first datum (D2>

=D1).

10. The computer of claim 5, wherein said means for executing first and second subsets of actions further includes:

means for operating a virtual stack which holds data including a first datum (D1) and a second datum (D2), and further executes object coded logical instructions upon data in said stack, said logical instructions comprising;

a nineteenth instruction (@AND), execution of which pops first and second data from said virtual stack, and pushes onto said virtual stack a boolean indication of whether both first and second data have values of true (D2 &

D1);

a twentieth instruction (@OR), execution of which pops first and second data from said virtual stack, and pushes onto said virtual stack a boolean indication of whether either first or second data, or both, has a value of true (D2 v D1);

a twenty-first instruction (@NOT), execution of which pops a first datum from said virtual stack, and pushes onto said virtual stack the boolean inverse of said first datum (HD1).

11. The computer of claim 5, wherein said means for executing first and second subsets of actions further includes:

means for operating a virtual stack and maintains a database having tables where each table has a table name, and accesses tables by a table access method (TAM) which accesses a table by the table named in a TAM parameter list, and further executing object coded table control instructions upon said database, said table control instructions comprising;

a twenty-second instruction (@WFIELD) identifying a given field within a given table, execution of which pushes said given field of said given table onto said virtual stack;

a twenty-third instruction (@RFIELD) identifying a given field within a given table, execution of which,

i) pushes said given field of said given table onto said virtual stack if contents of said given field contain an assigned value, but

ii) causes an exception event to occur, if contents of said given field contain no assigned value, signalling said computer that although said given field has no assigned value an attempt was made to use the contents of said field;

a twenty-fourth instruction (@SET) identifying a given field within a given table and specifying a value, execution of which assigns said value to said given field of said given table;

a twenty-fifth instruction (@ABN) giving a field name and a value, execution of which assigns said given value to each field having the given name, in all tables which include a field having the given name;

a twenty-sixth instruction (@TAM) specifying a table access request, execution of which calls the table access method to perform the specified table access request;

a twenty-seventh instruction (@TAMP) specifying a reference parameter, execution of which inserts the specified reference parameter into the TAM parameter list; and

a twenty-eighth instruction (@TAMN) specifying a table name, execution of which inserts the specified table name into said TAM parameter list.