Formalization of Tradeoff Rules and Other Techniques for Comprehending Complex Rule-Based Models
Expert InsightsPublished 1987
Expert InsightsPublished 1987
This paper describes techniques used in a large and complex knowledge-based simulation with thousands of qualitative rules organized hierarchically, which requires recursive combining rules. By formalizing the concepts otherwise implicit in combining rules, the authors have been able to speed model development, communicate results, improve the quality of the rules, and make it easier to recognize when different types of combination rules are needed. The paper's discussion is merely illustrative, but, in the long run, there should be implications for rule algebras in formal modeling and new syntaxes in programming languages. The objective should be to state combining rules at a high level of abstraction.
This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.