Programming expert systems in OPS5: an introduction to rule-based programming
Programming expert systems in OPS5: an introduction to rule-based programming
Artificial Intelligence
High-speed implementations of rule-based systems
ACM Transactions on Computer Systems (TOCS)
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Putting the Problem Solver Back in the Driver's Seat: Contextual Control of the AMTS
ECAI '90 Workshop on Truth Maintenance Systems
ARC: An Extended ATMS Based on Directed CAT-Correct Resolution
ECAI '90 Workshop on Truth Maintenance Systems
Scaling up logic-based truth maintenance systems via fact garbage collection
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Possibilistic assumption based truth maintenance system, validation in a data fusion application
UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Expert systems in complex domains require rich knowledge representation formalisms and problem solving paradigms. A typical framework may involve a blackboard architecture and a Reason Maintenance System (RMS) to guarantee the consistency of the links between the blackboard nodes. However, in order to satisfy computational feasibility and become operational, the resulting expert system must often be rewritten using less expressive tools. We propose an architecture integrating efficiently an OPS-like inference engine and an Assumption based Truth Maintenance System (ATMS). These paradigms have been separately investigated and extended. Roles distribution between an ATMS and an inference engine integrated in a single framework is one of the major issues to obtain good overall performance. Two architectures will be studied: loose coupling, where the ATMS and the inference engine are clearly separated, and tight coupling where the ATMS is intimately integrated with the match phase of a RETE-based inference engine. The advantages and drawbacks of both solutions are described in details. Finally, future work is discussed.