The Common Order-Theoretic Structure of Version Spaces and ATMS's

Loading...
Thumbnail Image
Penn collection
Technical Reports (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Gunter, Carl A.
Ngair, Teow-Hin
Panangaden, Prakash
Subramanian, Devika
Contributor
Abstract

This paper exposes the common order-theoretic properties of the structures manipulated by the version space algorithm [Mit78]and the assumption-based truth maintenance systems (ATMS) [dk86a,dk86b] by recasting them in the framework of convex spaces. Our analysis of version spaces in this framework reveals necessary and sufficient conditions for ensuring the preservation of an essential finite representability property in version space merging. This analysis is used to formulate several sufficient conditions for when a language will allow version spaces to be represented by finite sets of concepts (even when the universe of concepts may be infinite). We provide a new convex space based formulation of computation performs by an ATMS which extends the expressiveness of disjunctions in the systems. This approach obviates the need for hyper-resolution in dealing with disjunction and results in simpler label-update algorithms.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1990-11-01
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-86.
Recommended citation
Collection