Seman excellent goodntic formations will always laid out with regards to a particular lay out-of datatypes, denoted by the DTS

A semantic structure, I, is a tuple of the form

• a related place, called the worthy of space, and you will
• an effective mapping about lexical space of the icon area to help you the value place, named lexical-to-value-place mapping. ?

During the a tangible dialect, DTS constantly is sold with the brand new datatypes supported by that dialect. All the RIF languages need secure the datatypes that are checklisted in Point Datatypes away from [RIF-DTB]. Its value places in addition to lexical-to-value-area mappings for these datatypes try demonstrated in identical part.

Although the lexical and the value spaces might sometimes look similar, one should not confuse them. Lexical spaces define the syntax of the constant symbols in the RIF language. Value spaces define the meaning of the constants. The lexical and the value spaces are often not even isomorphic. For example, step step 1.2^^xs:quantitative and step 1.20^^xs:quantitative are two legal — and distinct — constants in RIF because step one.2 and step 1.20 belong to the lexical space of xs:quantitative. However, these two constants are interpreted by the same element of the value space of the xs:decimal type. Therefore, step 1.2^^xs:quantitative = step 1.20^^xs:quantitative is a RIF tautology. Likewise, RIF semantics for datatypes implies certain inequalities. For instance, abc^^xs:sequence ? abcd^^xs:sequence is a tautology, since the lexical-to-value-space mapping of the xs:string type maps these two constants into distinct elements in the value space of xs:sequence.

step three.4 Semantic Formations

This new central step up indicating a product-theoretical semantics to own a reason-depending words is determining the notion of a great semantic body typework. Semantic structures are acclimatized to assign realities philosophy so you can RIF-FLD formulas.

Definition (Semantic structure). _C, I_V, I_F, I_NF, I_list, I_tail, I_frame, I_sub, I_isa, I₌, I_external, I_conjunctive, I_truth>. Here D is a non-empty set of elements called the domain of I. We will continue to use Const to refer to the set of all constant symbols and Var to refer to the set of all variable symbols. TV denotes the set of truth values that the semantic structure uses and DTS is a set of identifiers for datatypes.

A semantic structure, I, is a tuple of the form

• Each pair <s,v> ? ArgNames ? D represents an argument/value pair instead of just a value in the case of a positional term.
• The new dispute so you’re able to a term which have named objections are a limited wallet of dispute/well worth pairs as opposed to a limited bought series out of effortless aspects.
• Bags are used here because the order of the argument/value pairs in a term with named arguments is immaterial and the pairs may repeat: p(a->b a beneficial->b). (However, p(a->b good->b) is not equivalent to p(a->b), as we shall see later.)

To see why such repetition can occur, note that argument names may repeat: p(a->b a->c). This can be understood as treating a as a bag-valued argument. Identical argument/value pairs can then arise as a result of a substitution. For instance, p(a->?An excellent an effective->?B) becomes p(a->b a good->b) if the variables ?An effective and ?B are both instantiated with the symbol b.

A semantic structure, I, is a tuple of the form

• I_list : D * > D
• I_tail : D + ?D > D

A semantic structure, I, is a tuple of the form

• The function I_list is injective (one-to-one).
• The set I_list(D * ), henceforth denoted D_list , is disjoint from the value spaces of all data types in DTS.
• I_tail(a₁, . a_k, I_list(a_{k+step one}, bristlr. a_k+m)) = I_list(a₁, . a_k, a_{k+step one}, . a_k+yards).

Note that the last condition above restricts I_tail only when its last argument is in D_list. If the last argument of I_tail is not in D_list, then the list is a general open one and there are no restrictions on the value of I_tail except that it must be in D.