Multiple disorders are a daily problem in medical diagnosis and treatment, while most expert systems make an implicit assumption that only single disorder occurs in a single patient. In our paper, we show the need for...
详细信息
In this paper, we propose a logical framework for reasoning about uncertain belief fusion. the framework is a combination of multi-agent epistemic logic and possibilistic logic. We use graded epistemic operators to re...
详细信息
this paper introduces rule-based reasoning (RBR) Expert System for network fault and security diagnosis and a mechanism for optimization. In this system, we use agent collaboration mechanism which is the process that ...
详细信息
Description logics (DLs) are a family of class (concept) based knowledge representation formalisms. they are characterised by the use of various constructors to build complex concepts from simpler ones, an emphasis on...
详细信息
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate...
详细信息
It has now been clear for some time that for many qualitative spatial or temporal calculi, for instance the well-known RCC8 calculus, the operation of composition of relations which is used is actually only weak compo...
详细信息
ISBN:
(纸本)3540292381
It has now been clear for some time that for many qualitative spatial or temporal calculi, for instance the well-known RCC8 calculus, the operation of composition of relations which is used is actually only weak composition, which is defined as the strongest relation in the calculus that contains the real composition. An immediate consequence for qualitative calculi where weak composition is not equivalent to composition is that the well-known concept of path-consistency is not applicable anymore. In these cases we can only use algebraic closure which corresponds to applying the path-consistency algorithm with weak composition instead of composition. In this paper we analyse the effects of having weak compositions. Starting with atomic CSPs, we show under which conditions algebraic closure can be used to decide consistency in a qualitative calculus, how weak consistency affects different important techniques for analysing qualitative calculi and under which conditions these techniques can be applied. For our analysis we introduce a new concept for qualitative relations, the "closure under constraints". It turns out that the most important property of a qualitative calculus is not whether weak composition is equivalent to composition, but whether the relations are closed under constraints. All our results are general and can be applied to all existing and future qualitative spatial and temporal calculi. We close our paper with a road map of how qualitative calculi should be analysed. As a side effect it turns out that some results in the literature have to be reconsidered.
In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive logicprogramming (ILP). We propose a general method for constructing...
详细信息
暂无评论