| Carl's profileWindows Live spaceBlogListsSkyDrive |  Tools  Help |
Windows Live spaceCarl Hewitt (http://carlhewitt.info) |
|||||
|
March 02 ORGs (Organizations of Restricted Generality): Strong Paraconsistency and Participatory Behavioral Model CheckingOrganizations of Restricted Generality (ORGs) raise important issues for commitment, norms, strong paraconsistency and model checking that require extensions and revisions of previous foundational work. For example, extension and revision is required of the fundamental assumption of the Event Calculus: Time-varying properties hold at particular time-points if they have been initiated by an action at some earlier time-point, and not terminated by another action in the meantime. The fundamental assumption of the Event Calculus is overly simplistic when it comes to organizations in which time-varying properties have to be actively maintained and managed in order to continue to hold and termination by another action is not required for a property to no longer hold. I.e., if active measures are not taken then things will go haywire by default. Consequently the Event Calculus approach must evolve into a strongly paraconsistent system structured around participations in space-time. Similarly extension and revision is required for Model Checking properties of systems. Previously Model Checking as been performed using the model of nondeterministic automata based on states determined by time-points. These nondeterministic automata are not suitable for organizations, which are highly structured and operate asynchronously with only loosely bounded nondeterminism. Consequently Model Checking needs to evolve in the direction of verifying participatory behavior in Organizations. PDF copy of the paper can be downloaded at: ORGs (Organizations of Restricted Generality): Strong Paraconsistency and Participatory Behavioral Model Checking February 07 History of Logic ProgrammingThe history of Logic Programming has been a controversial topic (see Carl Hewitt's Censorship and Harassment by the Wikipedia). The term "Logic Programming" was popularized by Robert Kowalski beginning
in the 1970's. However, he never provided an adequate definition. I
proposed that Logic Programming be characterized as "the logical deduction of computational steps".
Using this characterization, my colleagues and I were able to prove
that Logic Programming is not computationally universal. In other
words, there are some concurrent computations that cannot be
implemented using Logic Programming. Logic Programming was used as the foundation of the Japanese Fifth Generation Computing Project (ICOT) and was a principle cause of the failure of the project. A historical account of the above events can be found in the article History of Logic Programming that was censored from the Wikipedia at the instigation of Kowalski.
|
|||||
|
|
