The CAD conundrum: lex-least vs order

Scott McCallum, Akshar Nair, James Davenport, Gregory Sankaran

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

Abstract

This paper is part of our ongoing research and collaboration on understanding the relations between CAD algorithms, equational constraints and curtains. Our previous work manages to circumvent the curtain problem in the single equational constraint by taking advantage of the Lex-least valuation (even in the presence of curtains). That method however fails to take full advantage of multiple equational constraints. In this paper we provide further clarification of McCallum's work to validate the use of restricted projection operator at 2 levels. We also discuss the close relationship between order invariant and lex-least invariant CAD's.

Original languageEnglish
Title of host publicationProceedings - 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2020
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages32-35
Number of pages4
ISBN (Electronic)9781728176284
DOIs
Publication statusPublished - Sep 2020
Event22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2020 - Virtual, Timisoara, Romania
Duration: 1 Sep 20204 Sep 2020

Publication series

NameInternational Symposium on Symbolic and Numeric Algorithms for Scientific Computing
PublisherIEEE COMPUTER SOC
ISSN (Print)2470-8801

Conference

Conference22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2020
CountryRomania
CityVirtual, Timisoara
Period1/09/204/09/20

Keywords

  • Cylindrical Algebraic Decomposition
  • Equational Constraints
  • Lex-Least Invariance
  • Order Invariance

Fingerprint

Dive into the research topics of 'The CAD conundrum: lex-least vs order'. Together they form a unique fingerprint.

Cite this