(Ex. 1 in Ch9 of the book KRR) In this chapter, we considered the semantics of a description logic language that includes concept-forming operators such as FILLS and EXISTS but no role-forming operators. In this question, we extend the language with new concept-forming operators and role-forming operators. (a) Present a formal semantics in the style of Section 9.3.1 for the following concept-forming operators: [SOME r] Role existence. Something with at least 1 r. [AT-MOST n r] Maximum role cardinality. Something with at most n r's. (b) Do the same for the following role-forming operators: [INVERSE r] Role inverse. So the Child role could be defined as [INVERSE :Parent]. ● ● ● • [COMPOSE r₁ Tn-1 rn] Role composition. The rn's of the rn-1's... of the ri's. So [ALL [COMPOSE :Parent: Brother In Law] Rich] would mean something all of whose uncles are rich (where an uncle is a brother-in-law of a parent). (c) Use this semantic specification to show that for any roles r, s, and t, the concept [ALL [COMPOSE r s ][SOME t]] subsumes the concept [ALL r [AND [ALL s [EXISTS 2 t ]][ALL s [AT-MOST 2 t]]]] by showing that the extension of the latter concept is always a subset of the extension of the former.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

 (Ex.1 in Ch9 of the book KRR) In this chapter, we considered the semantics
of a description logic language that includes concept-forming operators such as FILLS and
EXISTS but no role-forming operators. In this question, we extend the language with new
concept-forming operators and role-forming operators.

(a) Present a formal semantics in the style of Section 9.3.1 for the following concept-forming
operators:
ˆ [SOME r] Role existence. Something with at least 1 r.
ˆ [AT-MOST n r] Maximum role cardinality. Something with at most n r’s.

(b) Do the same for the following role-forming operators:
ˆ [INVERSE r] Role inverse. So the :Child role could be defined as
[INVERSE :Parent].
ˆ [COMPOSE r1 ... rn−1 rn ] Role composition. The rn’s of the rn−1’s . . . of the
r1’s. So
[ALL[COMPOSE :Parent:BrotherInLaw]Rich]
would mean something all of whose uncles are rich (where an uncle is a brother-in-law
of a parent).

(c) Use this semantic specification to show that for any roles r, s, and t, the concept
[ALL[COMPOSE r s ][SOME t]]
subsumes the concept
[ALL r [AND[ALL s [EXISTS 2 t ]][ALL s [AT-MOST 2 t]]]]
by showing that the extension of the latter concept is always a subset of the extension of
the former. 

(Ex.1 in Ch9 of the book KRR) In this chapter, we considered the semantics
of a description logic language that includes concept-forming operators such as FILLS and
EXISTS but no role-forming operators. In this question, we extend the language with new
concept-forming operators and role-forming operators.
(a) Present a formal semantics in the style of Section 9.3.1 for the following concept-forming
operators:
[SOME r] Role existence. Something with at least 1 r.
• [AT-MOST n r] Maximum role cardinality. Something with at most n r's.
(b) Do the same for the following role-forming operators:
• [INVERSE r] Role inverse. So the Child role could be defined as
[INVERSE :Parent].
• [COMPOSE r₁ ... Tn-1 rn ] Role composition. The rn's of the rn-1's... of the
ri's. So
[ALL [COMPOSE :Parent: Brother In Law] Rich]
would mean something all of whose uncles are rich (where an uncle is a brother-in-law
of a parent).
(c) Use this semantic specification to show that for any roles r, s, and t, the concept
[ALL [COMPOSE r s ][SOME t]]
subsumes the concept
[ALL r [AND[ALL s [EXISTS 2 t ]][ALL s [AT-MOST 2 t]]]]
by showing that the extension of the latter concept is always a subset of the extension of
the former.
Transcribed Image Text:(Ex.1 in Ch9 of the book KRR) In this chapter, we considered the semantics of a description logic language that includes concept-forming operators such as FILLS and EXISTS but no role-forming operators. In this question, we extend the language with new concept-forming operators and role-forming operators. (a) Present a formal semantics in the style of Section 9.3.1 for the following concept-forming operators: [SOME r] Role existence. Something with at least 1 r. • [AT-MOST n r] Maximum role cardinality. Something with at most n r's. (b) Do the same for the following role-forming operators: • [INVERSE r] Role inverse. So the Child role could be defined as [INVERSE :Parent]. • [COMPOSE r₁ ... Tn-1 rn ] Role composition. The rn's of the rn-1's... of the ri's. So [ALL [COMPOSE :Parent: Brother In Law] Rich] would mean something all of whose uncles are rich (where an uncle is a brother-in-law of a parent). (c) Use this semantic specification to show that for any roles r, s, and t, the concept [ALL [COMPOSE r s ][SOME t]] subsumes the concept [ALL r [AND[ALL s [EXISTS 2 t ]][ALL s [AT-MOST 2 t]]]] by showing that the extension of the latter concept is always a subset of the extension of the former.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Inference
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education