[PDF] Top 20 Conservative rewritability of description logic TBoxes: First results
Has 10000 "Conservative rewritability of description logic TBoxes: First results" found on our website. Below are the top 20 most common "Conservative rewritability of description logic TBoxes: First results".
Conservative rewritability of description logic TBoxes: First results
... L-conservative rewritability can be transparently char- acterized, effectively decided, and for which rewriting algorithms can be de- ...ALCQ TBoxes, we show that model- conservative ... See full document
12
PP 2018 12: A Parameterized Complexity View on Description Logic Reasoning
... of description logic reasoning problems—when one takes a pro- gressive and forward-looking view on parameterized complex- ity ...The first case study is about the problem of con- cept satisfiability ... See full document
10
Query inseparability for description logic knowledge bases
... our results to resolve two important open prob- lems. First, we show that the membership problem for uni- versal UCQ-solutions in knowledge exchange for KBs in DL-Lite H core is E XP T IME -complete for ... See full document
22
When are description logic knowledge bases indistinguishable?
... complexity results for a large variety of DLs (see be- low), the introduction of new DLs for which query answer- ing is tractable for data complexity [Hustadt et ... See full document
8
Exact Learning of Lightweight Description Logic Ontologies
... them. Description logics (DLs) are a prominent family of ontology languages with a long history that goes back to Brachman’s famous knowledge representation system KL-ONE in the early 1980s (Brachman and Schmolze, ... See full document
63
Searching contexts in paraconsistent rough description logic
... a ∈ I | ∀ b ∈ I , ( a, b ) ∈ R I → b ∈ C I . For the approximation of concepts, we will have: • ( C ) I = a ∈ I | ∃ b ( a, b ) ∈ R ∼ ∧ b ∈ C I , • ( C ) I = a ∈ I | ∀ b ( a, b ) ∈ R ∼ → b ∈ C I . One of the advantages of ... See full document
13
Interval temporal description logics
... tractable description logics with interval temporal operators is motivated by possible applications in ontology-based data access (OBDA) [12] to temporal ... See full document
6
Link prediction using a probabilistic description logic
... Mohammad and Mohammed [18] survey representative link prediction methods, classifying them into three groups. In the first group, feature-based methods construct pairwise features to use in classification. The ... See full document
13
Digital Systems
... (Programmable Logic devices), FPGAs (Field Programmable Gate Arrays) and ASICs (Application Specific Integrated Circuits), the very nature of digital systems is continuously ... See full document
675
Implementation of Reversible Sequential Circuits Using Conservative Logic Gates
... In the test mode, to make the design testable with all 0s input vectors for any stuck-at-1 fault, the values of the controls signals will be mC1=0 and mC2=0, sC1=0 and sC2=0. This will make the outputs mT1 and sT1 as 0 ... See full document
6
Integration of Weighted Terminological Concepts and Vague Knowledge in Ontologies for Decision Making
... the description logic represents the models of the TBox completely through terminological concepts, roles and is-a ...a first a posteriori preference order can be derived for each expert choice (see ... See full document
7
Temporalising OWL 2 QL
... show rewritability we will use the notion of boundedness of ...between first-order definability and boundedness is well known from the datalog and logic literature, where boundedness has been ... See full document
13
Information in Reality: Logic and Metaphysics
... LIR proposes a “missing ingredient” of dynamic opposition or antagonism that reinforces this pic- ture of information for the evolution of living systems, without violating any principle of physical closure. It provides ... See full document
10
The First-Order Logic of Hyperproperties
... Another major open problem is to find a temporal logic that is expressively equivalent to F O[<, E]. In Section 4, we have shown that HyperLTL is less expressive than F O[<, E], by arguing that HyperLTL ... See full document
14
A custom made guide wire positioning device for Hip Surface Replacement Arthroplasty: description and first results
... strated that a varus position of the femoral implant results in a higher complication rate [16]. Varus position- ing of the femoral component and notching of the infe- rior femoral cortex during preparation of the ... See full document
7
Version Control in Online Software Repositories
... Reusing existing ontologies as far as possible is important because defining a new ontology does not help in shared understanding across domains; by lever- aging existing work, the semantic content of our sys- tem is ... See full document
7
Experimental Results of Thermal Scheduling of...
... fuzzy logic gives feasible and economical cost for power system ...environment. Results indicating comparison of the cost solutions using the FL, LA have been presented in this ... See full document
7
Schema.org as a Description Logic
... We start with the observation that evaluating OMQs is in- tractable in general, namely Π p 2 -complete in combined com- plexity and CO NP-complete in data complexity. In the main part of the paper, we therefore have two ... See full document
21
Rough Description Logic Programs
... the first time, and then advanced a rough DL ...rough description logic with concrete domain RSHOIQ(D), which combines DL RSHOIQ with rough set theory and concrete domain ... See full document
7
From National Service to Global Player: Transforming organizational logics in a public broadcaster
... While this study has made some headway in resolving some problems in institutional theory through its use of discourse analysis, it has also opened up a series of questions for further investigation. First, we ... See full document
41
Related subjects