Improving Termination Analysis of Active Rules with Priorities

This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here a refinement of these works, exploiting the priorities defined between rules.

• Type: Conference
• Year: 2003
• Where: CAISE
• Authors: Alain Couchot
• Keywords: Active Rules Termination, CAISE 2003, Termination Static Analysis, Undecidable Problem