[75]                               home                            [77]

On the separation of syntax and semantics and the issue of (real time) pragmatics  ŕ

 

 

Wednesday, August 18, 2004

 

The BCNGroup Beadgames

 

 

 

Substructural Semantics

Is one of the differences between the Semantic Web and the Anticipatory Web

 

 

Charles Steward Peirce treated entailment more fully than most whom were in the field of logic in the early part of the 1900s.  One of the Peircean scholars, Robert Burch, characterized Peircean logics as having a specific theme.  Burch called this theme the “Unified Logical Vision” of Peirce, and stated this ULV as:

 

“A concept is like a chemical compound, it is composed of atoms”.

 

The modern day computer science, with it massive funding streams from government and industry does not have anything that is even remotely consistent with the ULV. 

 

Why is that?  Is that good or does it matter? 

 

Stratified theory suggests that anticipatory mechanisms can be developed that depends on a separation of the analysis of data invariance from the imposition of an interpretation of the meaning of the data invariance. 

 

We are proposing to use the PriMentia data encoding patent to build an Ontology referential base (Orb) that allows very fast and very scalable data mining processes to run on massive, or small, data sources.  If the data sources are in dysfunction databases designed to not allow others to look at the data, then the PriMentia technology can import and clean the data and discard the proprietary database while preserving the data. 

 

We need no long ask permission from the original vendor to set aside dysfunctional database software.  We can acquire the information that is not the vendor’s but is ours. 

 

So our system can be shown, in a matter of an hour in a demonstration with any source of data, to produce clean data that is encoded into a discrete Hilbert space where the location of data can be found with computational complexity zero if one has the ASCII string representation of the data.  Retrieval is then very fast. 

 

This clean data is then stripped of the software that makes the data non-accessable.

 

This clean data is available for very fast data mining processes of any type.  One type of data mining process would be link analysis and co-occurrence studies.  These types of data mining process can be demonstrated in new data with our software within an hour.

 

The data mining can be equipped with non-stratified ontology services, as in standard OWL (Ontology Web Language) or stratified ontology as in the Readware technology.

 

What stands between this capability and its deployment?