compiled information in a non-recursive IDDB. Further, we have indicated
how simple recursive axioms might be handled in a recursive IDDB. Finally,
we have shown how conjunction and disjunction can be handled.
Work beyond that described in this paper is needed to implement the actual
compilation as follows:
1.
Develop the actual algorithms to generate just the right resolvents in an
effective way incorporating NH-reduction and NH-inheritance rules.
2.
Develop a more general methodology to handle more complex recursive
axioms in an IDDB.
3.
Develop the evaluation theorems to handle more complex queries con-
taining negativ ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.