- Full text PDF available (3)
- This year (0)
- Last five years (0)
Forward-chaining rule systems must test each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We introduce an algorithm for finding the matching predicates that is more efficient than the standard algorithm… (More)
A problem that arises in computational geometry, pattern matching, and other applications is the need to quickly determine which of a collection of intervals overlap a query point. A data structure speciicly designed to handle these queries eeciently called the interval binary search tree (IBS-tree) is introduced here. The IBS-tree is dynamic | intervals… (More)
<italic>In this paper, we propose a data structure, the Point-Range Tree (PR-Tree), specifically designed for indexing intervals. With the PR-Tree, a point data can be queried against a set of intervals to determine which of those intervals overlap the point. The PR-tree allows dynamic insertions and deletions while it maintains itself balanced. A balanced… (More)
In this paper, we propose a design for the integration of a production rule system into an object-oriented database system. We put an emphasis on the rule system, and propose a pattern matching algorithm based on a discrimination network. A detail methodology for constructing a discrimination network for different types of rule conditions is presented.
Capstone courses are expected to prepare students for the " real world " by putting them into a microcosm of the real world. In these courses, students are given a problem of some complexity, and are expected to exercise and develop problem-solving skills as they address the problem. Within our Computer Science and Engineering program we have, over the past… (More)