Sets as anti-chains

Carl A. Gunter; Teow Hin Ngair; Devika Subramanian

Sets as anti-chains

Carl A. Gunter, Teow Hin Ngair, Devika Subramanian

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings
Editors	Joxan Jaffar, Roland H. C. Yap
Publisher	Springer-Verlag
Pages	116-128
Number of pages	13
ISBN (Print)	3540620311, 9783540620310
State	Published - Jan 1 1996
Externally published	Yes
Event	2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996 - Singapore, Singapore Duration: Dec 2 1996 → Dec 5 1996

Publication series

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

Other

Other	2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996
Country	Singapore
City	Singapore
Period	12/2/96 → 12/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

Gunter, C. A., Ngair, T. H., & Subramanian, D. (1996). Sets as anti-chains. In J. Jaffar, & R. H. C. Yap (Eds.), Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings (pp. 116-128). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1179). Springer-Verlag.

Sets as anti-chains. / Gunter, Carl A.; Ngair, Teow Hin; Subramanian, Devika.

Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings. ed. / Joxan Jaffar; Roland H. C. Yap. Springer-Verlag, 1996. p. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1179).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gunter, CA, Ngair, TH & Subramanian, D 1996, Sets as anti-chains. in J Jaffar & RHC Yap (eds), Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1179, Springer-Verlag, pp. 116-128, 2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996, Singapore, Singapore, 12/2/96.

Gunter CA, Ngair TH, Subramanian D. Sets as anti-chains. In Jaffar J, Yap RHC, editors, Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings. Springer-Verlag. 1996. p. 116-128. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Gunter, Carl A. ; Ngair, Teow Hin ; Subramanian, Devika. / Sets as anti-chains. Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings. editor / Joxan Jaffar ; Roland H. C. Yap. Springer-Verlag, 1996. pp. 116-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1cdf629ad8784f2ba4ef2b765982287a,

title = "Sets as anti-chains",

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.",

author = "Gunter, {Carl A.} and Ngair, {Teow Hin} and Devika Subramanian",

year = "1996",

month = jan,

day = "1",

language = "English (US)",

isbn = "3540620311",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "116--128",

editor = "Joxan Jaffar and Yap, {Roland H. C.}",

booktitle = "Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings",

note = "2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996 ; Conference date: 02-12-1996 Through 05-12-1996",

}

TY - GEN

T1 - Sets as anti-chains

AU - Gunter, Carl A.

AU - Ngair, Teow Hin

AU - Subramanian, Devika

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947908947&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947908947&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947908947

SN - 3540620311

SN - 9783540620310

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 116

EP - 128

BT - Concurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings

A2 - Jaffar, Joxan

A2 - Yap, Roland H. C.

PB - Springer-Verlag

T2 - 2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996

Y2 - 2 December 1996 through 5 December 1996

ER -