On propagation of equational constraints in CAD-based quantifier elimination

S. McCallum

doi:10.1145/384101.384132

On propagation of equational constraints in CAD-based quantifier elimination

S. McCallum^*

^*Corresponding author for this work

School of Computing

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

40 Citations (Scopus)

Abstract

Collins [4] observed that quantifier elimination problems often have equational constraints, and he asserted that such constraints can be used to reduce the projection sets required for cylindrical algebraic decomposition (cad) based quantifier elimination. This paper follows on from [11], and validates the use of a semi-restricted equational projection scheme throughout the projection phase of cad. The fully restricted projection scheme as originally proposed in [4] is proved valid for four variable problems under certain conditions.

Original language	English
Title of host publication	Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
Place of Publication	New York, NY
Publisher	Association for Computing Machinery (ACM)
Pages	223-230
Number of pages	8
ISBN (Print)	1581134177
DOIs	https://doi.org/10.1145/384101.384132
Publication status	Published - Jul 2001
Event	Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001) - London, Ont., Canada Duration: 22 Jul 2001 → 25 Jul 2001

Other

Other	Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001)
Country/Territory	Canada
City	London, Ont.
Period	22/07/01 → 25/07/01

Access to Document

10.1145/384101.384132

Cite this

@inproceedings{ce8901381fd9416bae0e43678fc66dc3,

title = "On propagation of equational constraints in CAD-based quantifier elimination",

abstract = "Collins [4] observed that quantifier elimination problems often have equational constraints, and he asserted that such constraints can be used to reduce the projection sets required for cylindrical algebraic decomposition (cad) based quantifier elimination. This paper follows on from [11], and validates the use of a semi-restricted equational projection scheme throughout the projection phase of cad. The fully restricted projection scheme as originally proposed in [4] is proved valid for four variable problems under certain conditions.",

author = "S. McCallum",

year = "2001",

month = jul,

doi = "10.1145/384101.384132",

language = "English",

isbn = "1581134177",

pages = "223--230",

booktitle = "Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC",

publisher = "Association for Computing Machinery (ACM)",

address = "United States",

note = "Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001) ; Conference date: 22-07-2001 Through 25-07-2001",

}

McCallum, S 2001, On propagation of equational constraints in CAD-based quantifier elimination. in Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC. Association for Computing Machinery (ACM), New York, NY, pp. 223-230, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001), London, Ont., Canada, 22/07/01. https://doi.org/10.1145/384101.384132

On propagation of equational constraints in CAD-based quantifier elimination. / McCallum, S.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC. New York, NY: Association for Computing Machinery (ACM), 2001. p. 223-230.

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

TY - GEN

T1 - On propagation of equational constraints in CAD-based quantifier elimination

AU - McCallum, S.

PY - 2001/7

Y1 - 2001/7

N2 - Collins [4] observed that quantifier elimination problems often have equational constraints, and he asserted that such constraints can be used to reduce the projection sets required for cylindrical algebraic decomposition (cad) based quantifier elimination. This paper follows on from [11], and validates the use of a semi-restricted equational projection scheme throughout the projection phase of cad. The fully restricted projection scheme as originally proposed in [4] is proved valid for four variable problems under certain conditions.

AB - Collins [4] observed that quantifier elimination problems often have equational constraints, and he asserted that such constraints can be used to reduce the projection sets required for cylindrical algebraic decomposition (cad) based quantifier elimination. This paper follows on from [11], and validates the use of a semi-restricted equational projection scheme throughout the projection phase of cad. The fully restricted projection scheme as originally proposed in [4] is proved valid for four variable problems under certain conditions.

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

U2 - 10.1145/384101.384132

DO - 10.1145/384101.384132

M3 - Conference proceeding contribution

AN - SCOPUS:0034777338

SN - 1581134177

SP - 223

EP - 230

BT - Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

PB - Association for Computing Machinery (ACM)

CY - New York, NY

T2 - Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001)

Y2 - 22 July 2001 through 25 July 2001

ER -

On propagation of equational constraints in CAD-based quantifier elimination

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this