Sciweavers

48 search results - page 3 / 10
» On Anytime Coherence-Based Reasoning
Sort
View
PRICAI
2004
Springer
13 years 11 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
AAAI
2007
13 years 8 months ago
Anytime Optimal Coalition Structure Generation
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 7 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 ...
SEMWEB
2009
Springer
14 years 18 days ago
A Reasoning Broker Framework for OWL
Abstract. Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from expli...
Jürgen Bock, Tuvshintur Tserendorj, Yongchun ...
CSL
2001
Springer
13 years 10 months 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