Patent Document ID: 9323742
Application ID: 14299620

Base Claim:
1. A method of providing a semantic data architecture, comprising: providing a data model layer in the semantic data architecture, wherein the data model layer is formed by at least one processor, at least one storage device, at least one memory, and at least one communication interface in combination with a data model application program stored in the at least one storage device, wherein the at least one processor, in conjunction with running the data model application program, is configured to use the at least one storage device, the at least one memory, and the at least one communication interface to selectively receive source data from a source device, process the source data received from the source device based at least in part on pre-defined data types and filtering terms to form semantic data arranged in one or more binary tree structures, and store the semantic data in the at least one storage device; and providing a data filtering layer in the semantic data architecture, wherein the data filtering layer is formed by the at least one processor, the at least one storage device, the at least one memory, and the at least one communication interface in combination with a data filtering application program stored in the at least one storage device, wherein the at least one processor, in conjunction running the data filtering application program, is configured to use the at least one storage device, the at least one memory, and the at least one communication interface to selectively receive at least a portion of the semantic data from the data model layer, process the semantic data received from the data model layer using a reflexive matching operation based at least in part on the filtering terms to filter data through substitution to form filtered data, and store the filtered data in the at least one storage device.

---

Claim 5:
5. The method of claim 1 wherein the reflexive matching operation associated with the data filtering layer includes an asymmetric matching function defined by at least one of the following expressions: 
 match( v,v )={ }, 
 match( v,?:τ )={ } if vετ, 
 match( v,?x:τ )={? x:τ t } if v has type τ, 
 match( t,?x )={? x t}, 
 match( t ,?){ }, 
 match(( t 1 t 2 ),( t′ 1 t′ 2 ))=φ 1 ∪φ 2 , 
 if match( t 1 ,t′ 2 )=φ 1 match(φ 1 ( t 2 ), t′ 2 )=φ 2 , 
 match( f,? (n+1) x )={? (n+1) x f } if fε{? n y,? n ,? n y:τ,? n :τ} for a, 
 variable y 
 match(? n y:τ,? (n+1) x :τ)={? (n+1) x:τ ? n y :τ}, and 
 match( f,? (n+1) )={ } if f ε{? n y,? n ,? n y:τ,? n :τ} for the variable y, where v represents a value of data type, τ represents a type, (x,y) are symbols, t and t′ represent binary trees, Φ represents a substitution, n a positive integer, and f represents a terminal filtering term.