Sets as anti-chains

Carl A. Gunter, Teow Hin Ngair, Devika Subramanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we present a theory of anti-chains as data representations for sets in circumstances where sets of interest satisfy properties such as being upward-closed or convex relative to a partial ordering. Our goal is to provide an interface for supplying an implementation of the necessary primitives in a reusable manner and a theory that will facilitate algebraic reasoning about correctness. We present an algebra of anti-chains and illustrate its use in programming and reasoning about a machine learning algorithm.

Original languageEnglish (US)
Title of host publicationConcurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings
EditorsJoxan Jaffar, Roland H. C. Yap
PublisherSpringer-Verlag
Pages116-128
Number of pages13
ISBN (Print)3540620311, 9783540620310
StatePublished - Jan 1 1996
Externally publishedYes
Event2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996 - Singapore, Singapore
Duration: Dec 2 1996Dec 5 1996

Publication series

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

Other

Other2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996
CountrySingapore
CitySingapore
Period12/2/9612/5/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Sets as anti-chains'. Together they form a unique fingerprint.

Cite this