Answered: Consider the description logic ALC −∃…

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

See similar textbooks

Related questions

Question

Consider the description logic ALC −∃ which is ALC without existential restrictions (∃). Now modify algorithm consistent in Algorithm consistent() Input: a normalised ALC ABox A if expand(A) 6= ∅ then return “consistent” else return “inconsistent” Algorithm expand() Input: a normalised ALC ABox A if A is not complete then select a rule R that is applicable to A and an assertion or pair of assertions α in A to which R is applicable if there is A0 ∈ exp(A, R, α) with expand(A0 ) 6= ∅ then return expand(A0 ) else return ∅ else if A contains a clash then return ∅ else return A . Is the modified algorithm sound for ALC −∃ knowledge base consistency checking? Is it complete? Is the algorithm guaranteed to terminate? Explain your answers (you don’t need to prove it).

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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