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
← Back
ExamFull examExam paper only
25 09 14 1
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 2013–14 Test 4 – 25th September 2014 Part I
Knowledge EngineeringFull exam
Document information
What's included in this study material
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 2013–14 Test 4 – 25th September 2014 Part I
Import quality: text was extracted directly from the original document.
Extracted content from the 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.
Page 1
School of Industrial and Information Engineering Knowledge Engineering 2013–14 Test 4 – 25th September 2014 Part I 1!!!!5!pt.!Explain!the!concept!of!reasoning!service.!Classify!and!briefly!describe!all!the!main!reasoning!services.!Specify!to!which!reasoning!service!all!other!reasoning!services!can!be!reduced!and!show!how!this!reduction!can!be!achieved!using!a!service!of!your!choice!as!an!example.!!!Lecture!notes,!Sections!6.2!and!6.3.!2!!!!15!pt.!Please(read(before(starting:!• 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!• domain!and!ranges!can!be!specified!in!any!of!the!forms!presented!in!the!lecture!notes!• use!ABox!assertions!if!possible,!adding(different(individuals(assertions(whenever(this(is(reasonable!even!if!such!requirement!is!not!explicitly!stated!• 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(that(you(have(specified(but(without(any(further(addition;!and!(iii),!provide!a!justification!for!the!answer!(e.g.,!listing!the!axioms!involved!in!the!proof).!Requirements:!!!1. Every!pack!of!playing!cards!has!exactly!52!cards;!every!card!belongs!to!exactly!one!pack;!packs!and!cards!are!disjoint.!2. Every!card!has:!exactly!one!suit,!which!can!be!♣!(clubs),!♦!(diamonds),!♥!(hearts),!or!♠!(spades);!and!exactly!one!value,!which!can!be!ace!(A),!a!number!from!2!to!10!inclusive,!Jack!(J),!Queen!(Q),!or!King!(K).!3. Every!card!is!either!black!or!red;!cards!of!clubs!and!spades!are!the!only!black!cards.!4.…
Preview
First page of the document.