{"id":399521,"date":"2024-10-20T04:43:23","date_gmt":"2024-10-20T04:43:23","guid":{"rendered":"https:\/\/pdfstandards.shop\/product\/uncategorized\/ieee-1900-5-1-2020\/"},"modified":"2024-10-26T08:31:44","modified_gmt":"2024-10-26T08:31:44","slug":"ieee-1900-5-1-2020","status":"publish","type":"product","link":"https:\/\/pdfstandards.shop\/product\/publishers\/ieee\/ieee-1900-5-1-2020\/","title":{"rendered":"IEEE 1900.5.1-2020"},"content":{"rendered":"
New IEEE Standard – Active. A vendor-independent policy language for managing the functionality and behavior of dynamic spectrum access networks based on the language requirements defined in IEEE Std 1900.5\u2122, IEEE Standard Policy Language Requirements and System Architectures for Dynamic Spectrum Access Systems, is defined in this standard.<\/p>\n
PDF Pages<\/th>\n | PDF Title<\/th>\n<\/tr>\n | ||||||
---|---|---|---|---|---|---|---|
1<\/td>\n | 1900.5.1\u2122-2020 Front Cover <\/td>\n<\/tr>\n | ||||||
2<\/td>\n | Title Page <\/td>\n<\/tr>\n | ||||||
3<\/td>\n | Abstract\/Keywords <\/td>\n<\/tr>\n | ||||||
4<\/td>\n | Notice and Disclaimer of Liability Concerning the Use of IEEE Standards Documents <\/td>\n<\/tr>\n | ||||||
7<\/td>\n | Participants <\/td>\n<\/tr>\n | ||||||
8<\/td>\n | Introduction <\/td>\n<\/tr>\n | ||||||
10<\/td>\n | Contents <\/td>\n<\/tr>\n | ||||||
13<\/td>\n | 1. Overview 1.1 Introductory prevailing conditions 1.2 Scope <\/td>\n<\/tr>\n | ||||||
14<\/td>\n | 1.3 Purpose 1.4 Word usage <\/td>\n<\/tr>\n | ||||||
15<\/td>\n | 1.5 Notion of \u201cpolicy\u201d in its various uses 1.5.1 Current state 1.5.2 Cognitive radio environment <\/td>\n<\/tr>\n | ||||||
16<\/td>\n | 1.5.3 Underlying concepts <\/td>\n<\/tr>\n | ||||||
37<\/td>\n | 1.6 Related work 1.6.1 IEEE Std 1900.5-2011 2. Normative references 3. Definitions, acronyms, and abbreviations 3.1 Definitions 3.2 Acronyms and abbreviations <\/td>\n<\/tr>\n | ||||||
38<\/td>\n | 4. Policy Language syntax representation 4.1 Logical structure <\/td>\n<\/tr>\n | ||||||
39<\/td>\n | 4.1.1 OWL 2 syntax\u2014General definitions and OWL 2 constructs <\/td>\n<\/tr>\n | ||||||
52<\/td>\n | 4.1.2 RIF syntax\u2014General definitions and RIF constructs <\/td>\n<\/tr>\n | ||||||
54<\/td>\n | 4.1.3 DSA Policy Language syntax presentation and syntactical constraints <\/td>\n<\/tr>\n | ||||||
63<\/td>\n | 4.1.4 RIF-DSA safeness criteria <\/td>\n<\/tr>\n | ||||||
70<\/td>\n | 4.2 Physical structure 4.2.1 OWL 2 RL serialization 4.2.2 RIF-DSA and plain XML document <\/td>\n<\/tr>\n | ||||||
75<\/td>\n | 4.2.3 RIF and RDF\/RDFS document 4.2.4 RIF and OWL 2 Document <\/td>\n<\/tr>\n | ||||||
76<\/td>\n | 4.2.5 Importing XML data and XML schemas into RIF <\/td>\n<\/tr>\n | ||||||
77<\/td>\n | 4.2.6 Importing RDF and OWL in RIF <\/td>\n<\/tr>\n | ||||||
79<\/td>\n | 4.3 Conformance 4.4 Extensibility 5. Policy Language semantics 5.1 Semantics <\/td>\n<\/tr>\n | ||||||
80<\/td>\n | 5.2 Purpose of policy reasoner <\/td>\n<\/tr>\n | ||||||
81<\/td>\n | 5.3 Predicate logic as a programming language 5.3.1 Orders of logical systems <\/td>\n<\/tr>\n | ||||||
89<\/td>\n | 5.4 DSA Policy Language\u2014RIF-DSA logics 5.4.1 Horn notation\u2014Definite programs 5.4.2 Horn notation\u2014Normal programs 5.4.3 Horn notation\u2014Unit and goal clauses <\/td>\n<\/tr>\n | ||||||
90<\/td>\n | 5.4.4 RIF-DSA versus Horn notation 5.5 Expressivity of computable functions in DSA Policy Language 5.5.1 Primitive recursive functions <\/td>\n<\/tr>\n | ||||||
92<\/td>\n | 5.5.2 Minimalization\u2014\u03bc-Operator 5.5.3 Characteristic functions <\/td>\n<\/tr>\n | ||||||
94<\/td>\n | 5.5.4 Transformation into horn-based predicates <\/td>\n<\/tr>\n | ||||||
96<\/td>\n | 5.5.5 Examples <\/td>\n<\/tr>\n | ||||||
99<\/td>\n | 5.5.6 Mapping of computable functions into DSA clauses <\/td>\n<\/tr>\n | ||||||
100<\/td>\n | 5.6 Negation 5.6.1 Elimination of negation by new predicate introduction <\/td>\n<\/tr>\n | ||||||
102<\/td>\n | 5.6.2 Negation by NAF <\/td>\n<\/tr>\n | ||||||
106<\/td>\n | 5.7 Reasoning in DSA Policy Language 5.7.1 Unification 5.7.2 Recursion <\/td>\n<\/tr>\n | ||||||
108<\/td>\n | 5.7.3 General first order language interpretations <\/td>\n<\/tr>\n | ||||||
109<\/td>\n | 5.7.4 DSA Policy Language interpretation specifics <\/td>\n<\/tr>\n | ||||||
113<\/td>\n | 5.7.5 Distinguishing slots in object-oriented languages and RIF <\/td>\n<\/tr>\n | ||||||
114<\/td>\n | 5.7.6 OWL 2 compatible RIF reasoning <\/td>\n<\/tr>\n | ||||||
115<\/td>\n | 5.8 Definite program execution <\/td>\n<\/tr>\n | ||||||
118<\/td>\n | 5.9 General program execution <\/td>\n<\/tr>\n | ||||||
119<\/td>\n | 5.10 Object model representation <\/td>\n<\/tr>\n | ||||||
120<\/td>\n | 5.11 Entity capability and state model representation 5.12 Condition, decision tree, classification tree, table, and\/or rule model <\/td>\n<\/tr>\n | ||||||
125<\/td>\n | 5.13 Extensibility 6. Runtime environment 6.1 Runtime environment for sensing and perceiving 6.2 Procedural attachments 7. Case-based language analysis 7.1 Applicability of deontic logic for policy language <\/td>\n<\/tr>\n | ||||||
126<\/td>\n | 7.1.1 Policy model using deontic logic 7.1.2 Functional view of cognitive radio modeling using Upper Ontology Nuvio <\/td>\n<\/tr>\n | ||||||
130<\/td>\n | 7.1.3 Custom domain model\/ontology <\/td>\n<\/tr>\n | ||||||
132<\/td>\n | 7.2 IEEE Std 1900.5-2011 Use Case 1 7.2.1 Programmatic XSD-based schema transform into OWL 2 ontology <\/td>\n<\/tr>\n | ||||||
136<\/td>\n | 7.2.2 Sample XSLT style sheet to transform SCM schema into OWL 2 ontology <\/td>\n<\/tr>\n | ||||||
146<\/td>\n | 7.3 IEEE Std 1900.5-2011 Use Case 2 <\/td>\n<\/tr>\n | ||||||
153<\/td>\n | 8. Origins and relationship to other standards <\/td>\n<\/tr>\n | ||||||
154<\/td>\n | Annex A (informative) Requirements from IEEE Std 1900.5-2011 A.1 Requirements and objectives <\/td>\n<\/tr>\n | ||||||
160<\/td>\n | Annex B (informative) Listing of used CRO knobs and meters, schematic diagrams B.1 Cognitive radio ontology: classes (232) <\/td>\n<\/tr>\n | ||||||
162<\/td>\n | B.2 SDROntology: objectproperties (156) <\/td>\n<\/tr>\n | ||||||
164<\/td>\n | B.3 SDROntology: dataproperties (39) B.4 SDROntology: individuals (19) <\/td>\n<\/tr>\n | ||||||
165<\/td>\n | B.5 SDROntology: datatypes (5) <\/td>\n<\/tr>\n | ||||||
167<\/td>\n | Annex C (informative) NUVIO upper ontology class <\/td>\n<\/tr>\n | ||||||
168<\/td>\n | Annex D (informative) OWL 2 and RIF syntax components D.1 RIF-DSA D.1.1 RIF-DSA\u2014Specialization of RIF-FLD D.1.1.1 Presentation syntax <\/td>\n<\/tr>\n | ||||||
172<\/td>\n | D.1.1.2 Semantics D.1.1.3 XML serialization D.1.1.4 Conformance <\/td>\n<\/tr>\n | ||||||
173<\/td>\n | D.1.2 RIF-DSA\u2014Constructive description D.1.2.1 Alphabet of RIF-DSA <\/td>\n<\/tr>\n | ||||||
175<\/td>\n | D.1.2.2 Symbol spaces of RIF-DSA <\/td>\n<\/tr>\n | ||||||
176<\/td>\n | D.1.2.3 Terms of RIF-DSA <\/td>\n<\/tr>\n | ||||||
178<\/td>\n | D.1.2.4 Schemas for externally defined terms <\/td>\n<\/tr>\n | ||||||
180<\/td>\n | D.1.2.5 Well-formed formulas <\/td>\n<\/tr>\n | ||||||
181<\/td>\n | D.1.2.5.1 Well-formed formulas formal definition <\/td>\n<\/tr>\n | ||||||
183<\/td>\n | D.2 OWL 2 D.2.1 OWL 2 Syntax Presentation\u2014General definitions <\/td>\n<\/tr>\n | ||||||
184<\/td>\n | D.2.2 OWL 2 Syntax Presentation\u2014Definitions of OWL 2 constructs <\/td>\n<\/tr>\n | ||||||
185<\/td>\n | D.2.3 OWL 2 RL syntactical constraints D.2.3.1 OWL 2 RL supported datatypes <\/td>\n<\/tr>\n | ||||||
186<\/td>\n | D.2.3.2 OWL 2 RL class expressions D.2.3.3 OWL 2 RL data range D.2.3.4 OWL 2 RL axioms <\/td>\n<\/tr>\n | ||||||
187<\/td>\n | D.3 XPath 2.0 EBNF grammar <\/td>\n<\/tr>\n | ||||||
188<\/td>\n | Annex E (informative) Examples of automated generation, deployment, conformance, and enforcement E.1 Type-handling in RIF+XML documents <\/td>\n<\/tr>\n | ||||||
190<\/td>\n | Annex F (informative) NAF semantics\u2014Handling nonmonotonic semantics F.1 Semantics of a definite program <\/td>\n<\/tr>\n | ||||||
191<\/td>\n | F.2 Semantics of a normal program <\/td>\n<\/tr>\n | ||||||
192<\/td>\n | F.3 Formal definition <\/td>\n<\/tr>\n | ||||||
193<\/td>\n | F.4 Least fixpoint lfp versus greatest fixpoint gfp <\/td>\n<\/tr>\n | ||||||
194<\/td>\n | F.5 Resolution with graph-theoretic procedure <\/td>\n<\/tr>\n | ||||||
196<\/td>\n | Annex G (informative) Algorithims G.1 Property chain strict order algorithm G.2 Algorithm to check for RIA regularity <\/td>\n<\/tr>\n | ||||||
200<\/td>\n | Annex H (informative) Bibliography <\/td>\n<\/tr>\n | ||||||
204<\/td>\n | Back Cover <\/td>\n<\/tr>\n<\/table>\n","protected":false},"excerpt":{"rendered":" IEEE Standard for Policy Language for Dynamic Spectrum Access Systems<\/b><\/p>\n |