Sciweavers

Share
DEXA
2000
Springer

Semantic Verification of Rule-Based Systems with Arithmetic Constraints

12 years 6 months ago
Semantic Verification of Rule-Based Systems with Arithmetic Constraints
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a rule-based system (RBS). A semantic inconsistency is defined by an integrity constraint. A RBS verified by this method contains a set of production rules, and each production rule comprises a list of arithmetic constraints in its antecedent and a list of actions in its consequent. An arithmetic constraint is a linear equation defined in the real domain that includes attributes, and an action is an assignment that changes an attribute value. As rules are allowed to include actions of this kind, the behaviour of the verified RBS is non-monotonic. The method is able to give a specification of all the initial fact bases (FB), and the rules from these initial FB that would have to be executed (in the right order) to cause an integrity constraint (IC) to be violated. So, the method builds an ATMS-like theory. Moreover, the treatment of arithmetic constraints is inspired by con...
Jaime Ramírez, Angélica de Antonio
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where DEXA
Authors Jaime Ramírez, Angélica de Antonio
Comments (0)
books