17 07 14

Page 1

School of Industrial and Information Engineering Knowledge Engineering 2013–14 Test 2 – 17th July 2014 1 5 pt. Explain the concept of reasoning service. Classify and briefly describe all main reasoning services. Specify to which reasoning service all other reasoning services can be reduced and show how the reduction can be concretely achieved using a service of your choice as an example. Lecture Notes, Sections 6.3 and 6.4. 2 15 pt. Please read before starting:  read the requirements 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 this is not explicitly requested  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., in terms of the axioms involved in the proof). Requirements: An ontology of linear lists: 1. Every node belongs to exactly one list; lists and nodes are disjoint. 2. Every node has at most one node as its successor, and is the successor of at most one node. 3. If a node belongs to a list, then its successor (if any) belongs to the same list. 4. A node cannot be the successor of itself. 5. A head is a node that is not a successor, and a terminal is a node without any successor. 6. Exactly the following nodes belong to list l1: n0 (head), n1 (successor of n0) and n2 (successor of n1). DL queries: 7. Can a head be a list? 8.…