Sciweavers

1225 search results - page 1 / 245
» Maximal Consistent Subsets
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
FUIN
2006
113views more  FUIN 2006»
13 years 5 months ago
Adaptive Merging of Prioritized Knowledge Bases
Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these ...
Weiru Liu, Guilin Qi, David A. Bell
JANCL
2002
121views more  JANCL 2002»
13 years 5 months ago
Approximate coherence-based reasoning
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
Frédéric Koriche
IJCAI
1989
13 years 6 months ago
Preferred Subtheories: An Extended Logical Framework for Default Reasoning
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
Gerhard Brewka