Document information
- University
- Politecnico di Milano
- Degree programme
- Computer Engineering
- Subject
- Knowledge Engineering
- Academic year
- 2013-2014
- Classification
- Exam · Full exam
- Content
- Exam paper only
- Original format
- Text
- Searchable text
Full exam for Knowledge Engineering in the Computer Engineering degree programme at Politecnico di Milano. The document covers: School of Industrial and Information Engineering Knowledge Engineering 2014–15 Test 4 – 24th September 2015 Part I 2 15 pt. Please read carefully before starting: a. read the requirements below very carefully and represent them in SROIQ(D) using the DL notation; if a requirement
Full exam for Knowledge Engineering in the Computer Engineering degree programme at Politecnico di Milano. The document covers: School of Industrial and Information Engineering Knowledge Engineering 2014–15 Test 4 – 24th September 2015 Part I 2 15 pt. Please read carefully before starting: a. read the requirements below very carefully and represent them in SROIQ(D) using the DL notation; if a requirement
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
School of Industrial and Information Engineering Knowledge Engineering 2014–15 Test 4 – 24th September 2015 Part I 2 15 pt. Please read carefully before starting: a. read the requirements below very carefully and represent them in SROIQ(D) using the DL notation; if a requirement cannot be specified in SROIQ(D) explain why, and if possible provide a SROIQ(D) approximation b. domain and ranges can be specified in any of the forms presented in the lecture notes c. use ABox assertions when possible, adding different individuals assertions whenever this is reasonable even if such requirement is not explicitly stated d. for every DL query: (i), say which reasoning service is invoked; (ii), give the answer that would be derived from your ontology, inclusive of the ABox assertions that you have specified; and (iii), provide a justification for the answer (e.g., by listing the axioms involved in the proof when this is possible, otherwise by giving an informal justification). Requirements: 1. Every country has exactly one flag; every flag is the flag of at most one country and has at least one colour. Countries, flags, and colours are mutually disjoint. (Note: objects that are not countries may also have flag, and objects that are not flags may also have colours; it is therefore advisable to leave unspecified the class of all objects that may have flags and the class of all objects that may have colours.) 2. Two colours are “friends” if they appear together in at least one flag (i.e., if both of them are among the colours of the same flag). 3. The flag of Italy is green, white and red; the flag of Italy and the flag of Hungary have exactly the same colours. (Note: to simplify the representation it is advisable to introduce individuals denoting specific flags.) 4. There are some…
First page of the document.