michael@tadam.UUCP (Michael Beetz) (04/28/87)
We are currently developing a production rule interpreter that processes
explicit and declarative representations of control knowledge. Therefore,
we are interested to get contact to people working at the same topics.
Our interpreter processes rules like rules in OPS5, meta rules
like the rules of the TEIRESIAS system. Rules are partitioned in rule
sets and the user can specify phase sequences describing the order
in which rule sets are applied within an interpretation process. Or
the user can specify conflict resolution rules if more than one rule set
is applicable (with each rule set a precondition is associated).
We are working at the following topics:
1. Extending the RETE algorithm such that
- it can process objects (inheritance!)
- it can increase the efficiency of matching by exploiting the
partitioning of rule bases in rule sets
- can match meta rules (rules that contain patterns of object rules
in their condition part)
2. languages for specifying meta-level architectures for rule-based
systems.
3. Efficient implementations of RETE algorithms on a SYMBOLICS LISP
machine Genera 7.0.
Thanks in advance
Michael
Michael Beetz
c/o Gerhard Kraetzschmar
Schweppermannstr 5
8500 Nuernberg 10
Federal Republic of Germany