Compositional design of systems on chip from preverified components helps to achieve shorter design cycles and time to market. However, the design process is affected by the issue of protocol mismatches, where two components fail to communicate with each other due to protocol differences. Convertibility verification, which involves the automatic generation of a converter to facilitate communica...

Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In this paper, we introduce the basic notions of DLs and the techniques that realize subsumption—the fundamental reasoning service of DL systems. We discuss two reasoning methods for this service: the tableau method for ex...

Ontology authoring is a sophisticated task and requires domain as well as some amount of background knowledge in formal logic. In fact, it is not only novice users that are commonly faced with comprehension problems with respect to the influence of complex or nested ontological axioms on reasoning. We provide practical insights into the development of tableau-based methods for explaining the ke...

A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept ...

We present a decidable extension of the Description Logic SROIQ that supports defeasible reasoning in the KLM tradition, and extends it through the introduction of defeasible roles. The semantics of the resulting DL dSROIQ extends the classical semantics with a parameterised preference order on binary relations in a domain of interpretation. This allows for the use of defeasible roles in comple...

Exercise 8.1. Transform the following concepts into negation normal form: (a) ¬(A u ∀r.B) (b) ¬∀r.∃s.(¬B t ∃r.A) (c) ¬((¬A u ∃r.>) t> 3 s.(A t ¬B)) Exercise 8.2. Apply the tableau algorithm in order to check if the axiom A v B is a logical consequence of the TBox {¬C v B,A u C v ⊥}. Exercise 8.3. Aply the tableau algorithm in order to check satisfiability of the concept A u ∀r.B w.r.t. the TBox...

This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...

In this paper, we consider a natural extension of several results related to Krall-type polynomials introducing a modification of a q-classical linear functional via the addition of one or two mass points. The limit relations between the q-Krall type modification of big q-Jacobi, little q-Jacobi, big q-Laguerre, and other families of the q-Hahn tableau are established.