Sciweavers

17 search results - page 2 / 4
» Anytime Approximate Modal Reasoning
Sort
View
ECSQARU
2001
Springer
14 years 4 days ago
On Anytime Coherence-Based Reasoning
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
Frédéric Koriche
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 9 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
AIIA
1991
Springer
13 years 11 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
CSL
2001
Springer
14 years 4 days ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
LMCS
2006
98views more  LMCS 2006»
13 years 7 months ago
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden