Sciweavers

670 search results - page 19 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
KR
2004
Springer
14 years 1 months ago
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontolog...
Patrick Doherty, Andrzej Szalas, Witold Lukaszewic...
AAAI
2007
13 years 10 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
EWCBR
2004
Springer
14 years 1 months ago
Maintaining Case-Based Reasoning Systems: A Machine Learning Approach
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
Niloofar Arshadi, Igor Jurisica
AAAI
2010
13 years 9 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
WWW
2008
ACM
14 years 8 months ago
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
Masaya Eki, Tadachika Ozono, Toramatsu Shintani