On heuristic reasoning, reactivity, and search

Authors:
Susan L. Epstein
Affiliations:
Department of Computer Science, Hunter College and The Graduate School of The City University of New York, New York, NY
Venue:
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Year:
1995

Citing 5
Cited 2

Real-time heuristic search

Artificial Intelligence
Integrated architecture for learning, planning, and reacting based on approximating dynamic programming

Proceedings of the seventh international conference (1990) on Machine learning
Intelligence without representation

Artificial Intelligence
Prioritized Sweeping: Reinforcement Learning with Less Data and Less Time

Machine Learning
Introduction

Machine Learning - Special issue on case-based reasoning

Collaborative Learning for Constraint Solving

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Adaptive Constraint Engine

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the relationships among reactivity, heuristic reasoning, and search. It describes a hybrid, hierarchical reasoner that first has the opportunity to react correctly. If no ready reaction is computed, the reasoner activates a set of reactive triggers for time-limited search procedures. If they too fail to produce a response, the reasoner resorts to collaboration among a set of heuristic rationales. In a series of experiments, this hybrid reasoner is shown to be effective and efficient. The data also show how each of the three processes (correct reactions, time-limited search with reactive trigger, and heuristic rationales) plays an important role in problem solving. Reactivity is demonstrably enhanced by brief, knowledge-based, intelligent searches to generate solution fragments.