Sciweavers

1917 search results - page 166 / 384
» Experimenting with Nonmonotonic Reasoning
Sort
View
178
Voted
ICCBR
1995
Springer
15 years 10 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
RTA
1995
Springer
15 years 10 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
EWCBR
2008
Springer
15 years 8 months ago
Forgetting Reinforced Cases
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
Houcine Romdhane, Luc Lamontagne
SCAI
2008
15 years 8 months ago
Towards Automatic Model Generation by Optimization
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
Per Nyblom, Patrick Doherty
183
Voted
AAAI
2006
15 years 8 months ago
An Investigation into the Feasibility of the Semantic Web
This report is an expanded version of a paper in AAAI-2006 proceedings. In this report, we investigate the challenges that must be addressed for the Semantic Web to become a feasi...
Zhengxiang Pan, Abir Qasem, Jeff Heflin