IEEE P1900.5.1:2020 Edition

$30.33

IEEE Draft Standard Policy Language for Dynamic Spectrum Access Systems

Published By	Publication Date	Number of Pages
IEEE	2020

Guaranteed Safe Checkout

Category: IEEE

If you have any questions, feel free to reach out to our online customer service team by clicking on the bottom right corner. We’re here to assist you 24/7.
Email:[email protected]

Description

New IEEE Standard – Active – Draft.

PDF Catalog

PDF Pages	PDF Title
1	1900.5.1™-2020 Front Cover
2	Title Page
3	Abstract/Keywords
4	Notice and Disclaimer of Liability Concerning the Use of IEEE Standards Documents
7	Participants
8	Introduction
10	Contents
13	1. Overview 1.1 Introductory prevailing conditions 1.2 Scope
14	1.3 Purpose 1.4 Word usage
15	1.5 Notion of “policy” in its various uses 1.5.1 Current state 1.5.2 Cognitive radio environment
16	1.5.3 Underlying concepts
37	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
38	4. Policy Language syntax representation 4.1 Logical structure
39	4.1.1 OWL 2 syntax—General definitions and OWL 2 constructs
52	4.1.2 RIF syntax—General definitions and RIF constructs
54	4.1.3 DSA Policy Language syntax presentation and syntactical constraints
63	4.1.4 RIF-DSA safeness criteria
70	4.2 Physical structure 4.2.1 OWL 2 RL serialization 4.2.2 RIF-DSA and plain XML document
75	4.2.3 RIF and RDF/RDFS document 4.2.4 RIF and OWL 2 Document
76	4.2.5 Importing XML data and XML schemas into RIF
77	4.2.6 Importing RDF and OWL in RIF
79	4.3 Conformance 4.4 Extensibility 5. Policy Language semantics 5.1 Semantics
80	5.2 Purpose of policy reasoner
81	5.3 Predicate logic as a programming language 5.3.1 Orders of logical systems
89	5.4 DSA Policy Language—RIF-DSA logics 5.4.1 Horn notation—Definite programs 5.4.2 Horn notation—Normal programs 5.4.3 Horn notation—Unit and goal clauses
90	5.4.4 RIF-DSA versus Horn notation 5.5 Expressivity of computable functions in DSA Policy Language 5.5.1 Primitive recursive functions
92	5.5.2 Minimalization—μ-Operator 5.5.3 Characteristic functions
94	5.5.4 Transformation into horn-based predicates
96	5.5.5 Examples
99	5.5.6 Mapping of computable functions into DSA clauses
100	5.6 Negation 5.6.1 Elimination of negation by new predicate introduction
102	5.6.2 Negation by NAF
106	5.7 Reasoning in DSA Policy Language 5.7.1 Unification 5.7.2 Recursion
108	5.7.3 General first order language interpretations
109	5.7.4 DSA Policy Language interpretation specifics
113	5.7.5 Distinguishing slots in object-oriented languages and RIF
114	5.7.6 OWL 2 compatible RIF reasoning
115	5.8 Definite program execution
118	5.9 General program execution
119	5.10 Object model representation
120	5.11 Entity capability and state model representation 5.12 Condition, decision tree, classification tree, table, and/or rule model
125	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
126	7.1.1 Policy model using deontic logic 7.1.2 Functional view of cognitive radio modeling using Upper Ontology Nuvio
130	7.1.3 Custom domain model/ontology
132	7.2 IEEE Std 1900.5-2011 Use Case 1 7.2.1 Programmatic XSD-based schema transform into OWL 2 ontology
136	7.2.2 Sample XSLT style sheet to transform SCM schema into OWL 2 ontology
146	7.3 IEEE Std 1900.5-2011 Use Case 2
153	8. Origins and relationship to other standards
154	Annex A (informative) Requirements from IEEE Std 1900.5-2011 A.1 Requirements and objectives
160	Annex B (informative) Listing of used CRO knobs and meters, schematic diagrams B.1 Cognitive radio ontology: classes (232)
162	B.2 SDROntology: objectproperties (156)
164	B.3 SDROntology: dataproperties (39) B.4 SDROntology: individuals (19)
165	B.5 SDROntology: datatypes (5)
167	Annex C (informative) NUVIO upper ontology class
168	Annex D (informative) OWL 2 and RIF syntax components D.1 RIF-DSA D.1.1 RIF-DSA—Specialization of RIF-FLD D.1.1.1 Presentation syntax
172	D.1.1.2 Semantics D.1.1.3 XML serialization D.1.1.4 Conformance
173	D.1.2 RIF-DSA—Constructive description D.1.2.1 Alphabet of RIF-DSA
175	D.1.2.2 Symbol spaces of RIF-DSA
176	D.1.2.3 Terms of RIF-DSA
178	D.1.2.4 Schemas for externally defined terms
180	D.1.2.5 Well-formed formulas
181	D.1.2.5.1 Well-formed formulas formal definition
183	D.2 OWL 2 D.2.1 OWL 2 Syntax Presentation—General definitions
184	D.2.2 OWL 2 Syntax Presentation—Definitions of OWL 2 constructs
185	D.2.3 OWL 2 RL syntactical constraints D.2.3.1 OWL 2 RL supported datatypes
186	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
187	D.3 XPath 2.0 EBNF grammar
188	Annex E (informative) Examples of automated generation, deployment, conformance, and enforcement E.1 Type-handling in RIF+XML documents
190	Annex F (informative) NAF semantics—Handling nonmonotonic semantics F.1 Semantics of a definite program
191	F.2 Semantics of a normal program
192	F.3 Formal definition
193	F.4 Least fixpoint lfp versus greatest fixpoint gfp
194	F.5 Resolution with graph-theoretic procedure
196	Annex G (informative) Algorithims G.1 Property chain strict order algorithm G.2 Algorithm to check for RIA regularity
200	Annex H (informative) Bibliography
204	Back Cover