The Common Order-Theoretic Structure of Version Spaces and ATMS’s (Extended Abstract)

Carl A. Gunter, Teow-Hin Ngair, Prakash Panangaden, Devika Subramanian

This paper arose out of the observation that the version space algorithm and the ATMS label-update algorithms operate on very similar structures. The version space algorithm learns concept descriptions from examples. Central to this algorithm is the notion of all concept descriptions consistent with a given set of positive and negative examples. The assumption-based truth maintenance system for recording dependencies during reasoning maintains labels for a proposition which encode all environments in which that proposition is true.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.