Evaluating reasoning heuristics in the context of multi-level marketing structures

  • Authors:

  • John A. van der Poll;Paula Kotzé

  • Affiliations:

  • School of Computing, University of South Africa, P O Box 392, UNISA, 0003, South Africa;School of Computing, University of South Africa, P O Box 392, UNISA, 0003, South Africa

  • Venue:
  • SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A reduced specification of a multi-level marketing business modelled by mathematical forests and trees is presented in the Z specification language. A number of proof obligations arising from operations on the state is identified. Since Z is based on first-order logic and a strongly typed fragment of Zermelo-Fraenkel set theory, the utility of a number of heuristics for reasoning about set-theoretic constructs is investigated to discharge the identified proof obligations. Using the resolution-based theorem-proving program OTTER, we illustrate how these proof obligations may successfully be discharged using a set of well-chosen heuristics.