IJCAI
1997
13 years 5 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
IJCAI
1997
13 years 5 months ago
1997
The creation of a complex web site is a thorny problem in user interface design. First, di erent visitors have distinct goals. Second, even a single visitor may have di erent need...
IJCAI
1997
13 years 5 months ago
1997
The paper addresses the concept of cognition starting from the role of a sensor basis in the design of robots. The field of robotics forces the discussion to be pragmatic which is...
IJCAI
1997
13 years 5 months ago
1997
The New Millennium Remote Agent (NMRA) will be the rst on-board AI system to control an actual spacecraft. The spacecraft domain raises a number of challenges for planning and exe...
IJCAI
1997
13 years 5 months ago
1997
Understanding three simultaneous speeches is proposed as a challenge problem to foster artificial intelligence, speech and sound understanding or recognition, and computational au...
IJCAI
1997
13 years 5 months ago
1997
This paper describes an evolvable hardware (EHW) system for generalized neural network learning. We have developed an ASIC VLSI chip, which is a building block to configure a scal...
IJCAI
1997
13 years 5 months ago
1997
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
IJCAI
1997
13 years 5 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
IJCAI
1997
13 years 5 months ago
1997
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
IJCAI
1997
13 years 5 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...