conflict resolution mechanism and determinism guarantee for the notification-oriented paradigm (pon)

摘要

CONFLICT RESOLUTION MECHANISM AND GUARANTEE OF DETERMINISM FOR THE NOTICE-ORIENTED PARADIGM (SOP). This paper presents a new mechanism for Conflict Identification / Resolution and Determinism Assurance for the computer programming paradigm entitled Notification Oriented Paradigm (PON). PON itself solves problems of current paradigms, such as inappropriate syntax, structural and temporal redundancies, and particularly the tight coupling of computational entities as it utilizes an alternative process of causal assessment (or inference) made by computational entities. small, (re) active and decoupled collaborating through timely notifications. In PON, causal expressions and data structures are effective entities called Rules and FactBases that together collaboratively perform inference cycles through notifications from you and auxiliary entities. These entities are the FactBase Attributes that notify the Conditions Conditions Premises, which (if approved) activate their Actions which, in turn, activate their Instigations and, consequently, the FactBases Methods allowing the inference cycle for notifications. It should be noted that the logical-causal part of these entities and the connections for notifications / instigations are automatically created from knowledge of causal rules. These causal rules contain knowledge regarding the intended application and may also contain additional knowledge concerning issues such as conflict treatment and determinism. In this context, the present invention constitutes a Mechanism with two PON synergistic objectives which are implicitly Identify / Resolve Conflicts and implicitly Guarantee Determinism. Identification and Conflict Resolution of the elements involved occurs by counter-notifications of Conditions approved for exclusive Premises (relating to conflicting FactBases) that identify a conflict if there is more than one counter notification, resolve this conflict deterministically (using one of the as distinct priorities from Conditions / Rules) and confirm the approval of the elected Condition only. Implicit determinism, in turn, is first guaranteed by establishing counter notifications of Conditions to Premises and Premises to Attributes, each counter notification being confirmation of the prior notification received, and subsequently guaranteed by the final notification of Attributes to Conditions. This ensures that all elements involved in the inference process have equal opportunity for evaluation as well as deterministic developments. In short, this dual mechanism is presented, which occurs through additional collaborations of existing entities in the PON, and such collaborations are also notification oriented, normally applied synergistically and potentially / normally handled through inheritance mechanisms. Finally, a new mechanism is presented that improves the capabilities of inferences determined by PON, useful to various software classes, facilitating its use since the mechanism also emerges implicitly from the 'knowledge' of the rules.