Processes
A process can be defined in Exalt script language by text or by
BPMN (Business Process Modeling Notation) drawing.
A text example of a high level project plan could look something
like the example below:
! 1 Project X
! 1:1 {workflow} Milestone 1
! 1:1:1 {workflow} Activity 1
! 1:1:1:1 {workflow} Task 1
! 1:1:1:2 {workflow} Task 2
! 1:1:2 {workflow} Activity 2
! 1:2 {workflow} Milestone 2
! 1:3 {workflow} Milestone X(n)
Implior Exalt Process & Knowledge is based on a patent pending
theoretical integration between logic calculus and process calculus.
Rules are used to determine branches (one or more) and within
process elements.
Rules
Assume the following facts:
- link(a,b)
- link(b,c)
- reachable(a)
Making the conclusion that there is a path from a to c can be
done by forward chaining or backward chaining.
Forward chaining:
- reachable(From) and link(From,To) => reachable(To);
- Adding conclusion: reachable(c)
Backward chaining:
- trip(From,From,Path) --> Path(From):
- trip(From,To,Path) --> link(From,X) and trip(X,To,Y) and
Path=[From|Y];
- answer(Path):=trip(a,c,Path)
- Path=[a,b,c]
A human being immediately makes the conclusion that there is a
path from a to c but even such a simple conclusion is impossible for
almost all existing software products of today. Just a few lines in
a rule engine can change this.