← Indietro
EsameEsame completoTesto d’esame

25 09 14 1

Esame completo di Knowledge Engineering per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Knowledge EngineeringEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Knowledge Engineering per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Qualità dell’importazione: il testo è stato estratto direttamente dal documento originale.

Contenuti estratti dal documento

Passaggi rappresentativi riconosciuti nelle diverse parti del materiale. Il testo completo resta presente nella pagina per la ricerca, mentre l’anteprima compatta rende più semplice la lettura.

Pagina 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.…

Anteprima

Prima pagina del documento.

Prima pagina: 25 09 14 1