Applying DLs for Retrieval in Case-Based Reasoning
نویسندگان
چکیده
منابع مشابه
Expressive Description Logics for Agent-Based Information Retrieval
In this contribution we investigate the use of description logics (DLs) for information retrieval in a multiagent scenario. We first describe two advanced DLs and present the relevant reasoning services provided for information retrieval, in particular instance retrieval, instance checking and example-based instance retrieval. Complete and sound algorithms exist for each of these tasks in both ...
متن کاملThe Use of Description Logics in the Condorcet Conceptual Information Retrieval System
This position paper will describe the intended use of De. scription Logics (DLs) in a particular conceptual information retrieval system, the Condorcet system. First the Condorcet system is introduced, focusing on knowledge representational and reasoning aspects and criteria. Second, based on these requirements, we will argue that DLs are particularly promising candidates for knowledge represen...
متن کاملA Sequent Calculus for Reasoning in Four-Valued Description Logics
Description Logics (DLs, for short) provide a logical reconstruction of the so-called frame-based knowledge representation languages. Originally, four-valued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, four-valued DLs have been proposed as a model for (multimedia) document retrieval. In this context, the main reasoning ta...
متن کاملApplying Case Retrieval Nets to DiagnosticTasks in Technical
This paper presents Objectdirected Case Retrieval Nets, a memory model developed for an application of Case-Based Reasoning to the task of technical diagnosis. The key idea is to store cases, i.e. observed symptoms and diagnoses, in a network and to enhance this network with an object model encoding knowledge about the devices in the application domain.
متن کاملRough EL Classification
Rough Description Logics (DLs) have been studied as a means for representing and reasoning with imprecise knowledge. It has been shown that reasoning in rough DLs can be reduced to reasoning in a classical DL that allows value restrictions, and transitive and inverse roles. This shows that for propositionally closed DLs, the complexity of reasoning is not increased by the inclusion of rough con...
متن کامل