NEITHER is a propositional theory refinement system that will modify a incomplete or incorrect rule base so as to make it consistent with a set of input training examples. NEITHER has been extended to revise both Horn clauses and M-of-N rules. An iterative greedy method is used to efficiently compute repairs.

NEITHER has also been used as part of separate system, ASSERT, which performs student modeling. ASSERT (Acquiring Stereotypical Student Errors using Refinement of Theories) is an intelligent tutoring system which inputs a knowledge base describing a domain and a set of student errors on that domain and outputs a tutoring program tailored to fit student needs. Student behavior on the domain is modeled by collecting any refinements to the knowledge base (made by NEITHER) that were necessary to account for the student's behavior. These models are then used to generated feedback which should help raise student peformance on that domain.

The complete NEITHER Software System is available via anonymous ftp. This software contains the following items:

  1. The ASSERT Tutoring System
  2. The CPP System - The specifics of a C++ Tutorial
  3. The NEITHER System
  4. PFOIL - a propositional FOIL induction system
  5. A system introduction and breakdown, including compilation instructions and execution traces.
A more detailed description of this system can be found in the following publications:

  1. Paul Baffes, "Automatic Student Modeling and Bug Library Construction using Theory Refinement," Ph.D. Thesis, Department of Computer Sciences, University of Texas at Austin, December, 1994.
  2. Paul Baffes and Raymond Mooney, "Extending Theory Refinement to M-of-N Rules," Informatica, 17 (1993), pp. 387-397.
Poniters to these and other related papers can be found on our Theory Refinement research page.