Incoherency Problems in a Combination of Description Logics and Rules
نویسندگان
چکیده
منابع مشابه
Distance-based Measures of Inconsistency and Incoherency for Description Logics
Inconsistency and incoherency are two sorts of erroneous information in a DL ontology which have been widely discussed in ontology-based applications. For example, they have been used to detect modeling errors during ontology construction. To provide more informative metrics which can tell the differences between inconsistent ontologies and between incoherent terminologies, there has been some ...
متن کاملThe Datalog Combination of Deduction Rules and Description Logics
JING MEI, HAROLD BOLEY, JIE LI, VIRENDRAKUMAR C. BHAVSAR, ZUOQUAN LIN 1 Department of Information Science, Peking University, Beijing 100871, China {mayyam, lz} AT is.pku.edu.cn Faculty of Computer Science, University of New Brunswick, Fredericton, NB, E3B 5A3, Canada {Jie.Li, bhavsar} AT unb.ca National Research Council of Canada, Fredericton, NB, E3B 9W4, Canada {Harold.Boley, Jie.Li} AT nrc....
متن کاملCombining Description Logics, Description Graphs, and Rules
Make information on the Web machine-processable Develop a vocabulary of a domain—an ontology Annotate information by ontology terms BENEFITS Implicit meaning in the data is made explicit Formal semantics of the ontology language can be used to explicate implicit information
متن کاملCombining Existential Rules and Description Logics
Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [Baget et al., 2010; 2011a]. Query answering is also decidable for description logics [Baader, 2003], which further allow disjunction and functionality constraints (assert that certain relations are ...
متن کاملIntegrating Rules and Description Logics by Circumscription
We present a new approach to characterizing the semantics for the integration of rules and first-order logic in general, and description logics in particular, based on a circumscription characterization of answer set programming, introduced earlier by Lin and Zhou. We show that both Rosati’s semantics based on NM-models and Lukasiewicz’s answer set semantics can be characterized by circumscript...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/604753