[PDF] Top 20 Rough Description Logic Programs

... with description logics for the semantic ...coupled rough description logic programs (or simply rough dl-programs) under the answer set semantics, which can model ... See full document

... 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

... and logic literature where boundedness has been investigated ex- tensively [Gaifman et ...datalog programs on linear orders; the results are different from ours since the linear order is the only predicate ... See full document

... From a technical point of view, the description logic represents the models of the TBox completely through terminological concepts, roles and is-a relations. The elements of the ABox are terminological ... See full document

... The software relies on an FTP Geoves area where data is sent autonomously by the control units at fixed times and are available in standard text format with fields separated by commas (CSV format). The data is therefore ... See full document

... probabilistic description logic programs under the answer set semantics as a language for representing and reasoning with un- certain and possibly inconsistent ontology ...disjunctive logic ... See full document

... possibilistic description logic program KB   {   ,   |  , L  IKB and   L } ...possibility description logic program knowledge bases that are compatible with ... See full document

... of rough set methods is whether the whole set of attributes (concepts) is necessary and, if not, how to determine the simplified and still sufficient subset of attributes that preserves the distinguishability ... See full document

... Logic behind the risk per protected and unprotected dental procedure for all-at-risk patients calculation Description of estimate Estimate Calculation Description of calculation Protecte[r] ... See full document

... [r] ... See full document

... Inspired by [Boyer and Moore, 1972], NeMuS is a shared multi-space representation for a portion of first-order logic designed for use with machine learning and neural network methods. Such a structure contains ... See full document

... Logic behind the risk per protected and unprotected dental procedure for all-at-risk patients calculation Description of estimate Estimate Calculation Description of calculation Protecte[r] ... See full document

... All three applications have in common that one wants to search the knowledge base for concepts having a certain (not completely specified) form. This “form” can be expressed with the help of so-called concept patterns, ... See full document

... This paper studies some basic concepts of the I-rough topological spaces. I rough topological spaces are the generalization of topological spaces in to a rough universe. The paper mainly focuses on ... See full document

... In this section, we present an algorithm that com- putes the descriptions discussed in sect.3. A GRE algorithm should have the following behaviour: if an entity is distinguishable from all the others, the algorithm ... See full document

... Conceiving DL systems by adapting of first-order logic (FOL) ones is, unfortunately, not a trivial task. The traps and pitfalls along the way, together with the subtleties involved, like the risk of non- ... See full document

... gether with qualitative or quantitative evolution, turned out to be undecidable (as well as TDLs with unrestricted role inclusions), the complexity of the remaining ten logics ranges between NL OG S PACE and PS PACE . We ... See full document

... For KB versioning, it is often not su ffi cient to learn that two KBs give di ff erent answers to some CQs in the signature ( Σ , Γ ). In addition, a description of the relevant di ff erences between the KBs ... See full document

... *The courses in the sections marked with an asterisk are all general education courses that are part of the Arkansas Course Transfer System (ACTS). Students are guaranteed the transfer of applicable credits for these ... See full document

... fuzzy logic as classifier, an automatically generated rules will be applied to the ...fuzzy logic using Mamdani ...using rough set ...on rough set rules obtains 89% whereas expert rules ... See full document