Sciweavers

191 search results - page 26 / 39
» Adapting Mathematical Domain Reasoners
Sort
View
KES
2004
Springer
14 years 1 months ago
Epistemic Logic and Planning
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
Shahin Maghsoudi, Ian Watson
STACS
1993
Springer
14 years 1 days ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
ICCBR
2005
Springer
14 years 1 months ago
Identifying Facts for TCBR
This paper explores a method to algorithmically distinguish case-specific facts from potentially reusable or adaptable elements of cases in a textual case-based reasoning (TCBR) sy...
Jason M. Proctor, Ilya Waldstein, Rosina Weber
ICCBR
1997
Springer
14 years 3 days ago
Merge Strategies for Multiple Case Plan Replay
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulationa...
Manuela M. Veloso
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
14 years 9 days ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund