Version space algorithms on hierarchies with exceptions

Grigoris Antoniou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


In this paper, we present version space algorithms working on hierarchies with exceptions, exceptions meaning that some nodes may not be covered by some of their predecessors. Such representations are known from nonmonotonic reasoning. We give formal definitions and correctness results for the algorithms. Then we discuss what happens when the background knowledge is slightly modified by introduction of a new exception. Here lies the major advantage of our approach: when the knowledge is dynamically (nonmonotonically) modified, it is still possible to save almost all of the learned information instead of having to restart the version space learning method from scratch. Finally, we discuss the version space method in case several hierarchy trees (with or without exceptions) are combined to form a conjunctive concept.

Original languageEnglish
Title of host publicationProgress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings
EditorsMiguel Filgueiras, Luis Damas
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540572879
Publication statusPublished - 1 Jan 1993
Externally publishedYes
Event6th Portuguese Conference on Artificial Intelligence - Porto, Portugal
Duration: 6 Oct 19938 Oct 1993
Conference number: 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume727 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th Portuguese Conference on Artificial Intelligence
Abbreviated titleEPIA 1993


Dive into the research topics of 'Version space algorithms on hierarchies with exceptions'. Together they form a unique fingerprint.

Cite this