From 3e03f52c1866c397a76344af4a7cc2f9bc0f54a1 Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sat, 20 May 2017 15:58:18 -0400
Subject: [PATCH] bookvolbib cylindrical algorithmic decomposition references
Goal: Axiom Literate Programming
\index{Richardson, Daniel}
\begin{chunk}{axiom.bib}
@InCollection{Rich98,
author = "Richardson, Daniel",
title = "Local Theories and Cylindrical Decomposition",
booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
publisher = "Springer",
year = "1998",
isbn = "3-211-82794-3",
abstract =
"There are many interesting problems which can be expressed in the
language of elementary algebra, or in one of its extensions, but which
do not really depend on the coordinate system, and in which the
variables can be restricted to an arbitrary small neighborhood of some
point. It seems that it ought to be possible to use cylindrical
decomposition techniques to solve such problems, taking advantage
of their special features. This article attempts to do this, but
many unsolved problems remain.",
keywords = "axiomref"
}
\end{chunk}
\index{Weispfenning, V.}
\begin{chunk}{axiom.bib}
@InCollection{Weis98,
author = "Weispfenning, V.",
title = "A New Approach to Quantifier Elimination for Real Algebra",
booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
publisher = "Springer",
year = "1998",
isbn = "3-211-82794-3",
abstract =
"Quantifier elimination for the elementary formal theory of real
numbers is a facinating area of research at the intersection of
various field of mathematics and computer science, such as
mathematical logic, commutative algebra and algebraic geometry,
computer algebra, computational geometry and complexity
theory. Originally the method of quantifier elimination was invented
(among others by Th. Skolem) in mathematical logic as a technical tool
for solving the decision problem for a formalized mathematical
theory. For the elementary formal theory of real numbers (or more
accurately of real closed fields) such a quantifier elimination
procedure was established in the 1930s by A. Tarski, using an
extension of Sturm's theorem of the 1830s for counting the number of
real zeros of a univariate polynomial in a given interval. Since then
an abundance of new decision and quantifier elimination methods for
this theory with variations and optimizations has been published with
the aim both of establishing the theoretical complexity of the problem
and of finding methods that are of practical importance (see Arnon
1988a and the discussion and references in Renegar 1992a, 1992b, 1992c
for a comparison of these methods). For subproblems such as
elimination of quantifiers with respect to variables, that are
linearly or quadratically restricted, specialized methods have been
developed with good success (see Weispfenning 1988, Loos and
Weispfenning 1993; Hong 1992d; Weispfenning 1997).",
keywords = "axiomref"
}
\end{chunk}
---
books/bookvolbib.pamphlet | 81 ++++++++++++++++++++++++++++++++++++++++
changelog | 2 +
patch | 65 +++++++++++++++++++++++++++++++-
src/axiom-website/patches.html | 2 +
4 files changed, 148 insertions(+), 2 deletions(-)
diff --git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index f52cbf6..c47dd22 100644
--- a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ -14098,6 +14098,8 @@ Proc ISSAC 97 pp172-175 (1997)
\section{Cylindrical Algebraic Decomposition} %%%%%%%%%%%%%%%%%%%%%%
+\subsection{A} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Arnon, Dennis S.}
\index{Collins, George E.}
\index{McCallum, Scott}
@@ -14190,6 +14192,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{B} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Beaumont, James}
\index{Bradford, Russell}
\index{Davenport, James H.}
@@ -14454,6 +14458,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{C} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Caviness, B. F.}
\index{Johnson, J. R.}
\begin{chunk}{axiom.bib}
@@ -14596,6 +14602,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{D} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Davenport, J.H.}
\begin{chunk}{axiom.bib}
@techreport{Dave85a,
@@ -14620,6 +14628,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{E} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{RealClosure}
\index{Emiris, Ioannis Z.}
\index{Tsigaridas, Elias P.}
@@ -14787,6 +14797,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{L} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{LaValle, Steven M.}
\index{algorithm!cylindrical algebraic decomposition}
\index{cylindrical algebraic decomposition}
@@ -14800,6 +14812,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{M} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Mahboubi, Assia}
\begin{chunk}{axiom.bib}
@article{Mahb07,
@@ -14821,6 +14835,31 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{R} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\index{Richardson, Daniel}
+\begin{chunk}{axiom.bib}
+@InCollection{Rich98,
+ author = "Richardson, Daniel",
+ title = "Local Theories and Cylindrical Decomposition",
+ booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
+ publisher = "Springer",
+ year = "1998",
+ isbn = "3-211-82794-3",
+ abstract =
+ "There are many interesting problems which can be expressed in the
+ language of elementary algebra, or in one of its extensions, but which
+ do not really depend on the coordinate system, and in which the
+ variables can be restricted to an arbitrary small neighborhood of some
+ point. It seems that it ought to be possible to use cylindrical
+ decomposition techniques to solve such problems, taking advantage
+ of their special features. This article attempts to do this, but
+ many unsolved problems remain.",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\index{Rioboo, Renaud}
\begin{chunk}{axiom.bib}
@misc{Riobxx,
@@ -14905,6 +14944,46 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{W} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\index{Weispfenning, V.}
+\begin{chunk}{axiom.bib}
+@InCollection{Weis98,
+ author = "Weispfenning, V.",
+ title = "A New Approach to Quantifier Elimination for Real Algebra",
+ booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
+ publisher = "Springer",
+ year = "1998",
+ isbn = "3-211-82794-3",
+ abstract =
+ "Quantifier elimination for the elementary formal theory of real
+ numbers is a facinating area of research at the intersection of
+ various field of mathematics and computer science, such as
+ mathematical logic, commutative algebra and algebraic geometry,
+ computer algebra, computational geometry and complexity
+ theory. Originally the method of quantifier elimination was invented
+ (among others by Th. Skolem) in mathematical logic as a technical tool
+ for solving the decision problem for a formalized mathematical
+ theory. For the elementary formal theory of real numbers (or more
+ accurately of real closed fields) such a quantifier elimination
+ procedure was established in the 1930s by A. Tarski, using an
+ extension of Sturm's theorem of the 1830s for counting the number of
+ real zeros of a univariate polynomial in a given interval. Since then
+ an abundance of new decision and quantifier elimination methods for
+ this theory with variations and optimizations has been published with
+ the aim both of establishing the theoretical complexity of the problem
+ and of finding methods that are of practical importance (see Arnon
+ 1988a and the discussion and references in Renegar 1992a, 1992b, 1992c
+ for a comparison of these methods). For subproblems such as
+ elimination of quantifiers with respect to variables, that are
+ linearly or quadratically restricted, specialized methods have been
+ developed with good success (see Weispfenning 1988, Loos and
+ Weispfenning 1993; Hong 1992d; Weispfenning 1997).",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
\index{Wilson, David}
\index{Bradford, Russell}
\index{Davenport, James H.}
@@ -14936,6 +15015,8 @@ Proc ISSAC 97 pp172-175 (1997)
\end{chunk}
+\subsection{Z} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
\index{Zhao, Ting}
\index{Wang, Dongming}
\index{Hong, Hoon}
diff --git a/changelog b/changelog
index 255de79..5b461da 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20170520 tpd src/axiom-website/patches.html 20170520.01.tpd.patch
+20170520 tpd bookvolbib cylindrical algorithmic decomposition references
20170518 tpd src/axiom-website/patches.html 20170518.02.tpd.patch
20170518 tpd download.html update download table for BSD, ubuntu, ubuntu64
20170518 tpd src/axiom-website/patches.html 20170518.01.tpd.patch
diff --git a/patch b/patch
index 29bb584..831a166 100644
--- a/patch
+++ b/patch
@@ -1,4 +1,65 @@
-download.html update download table for BSD, ubuntu, ubuntu64
+bookvolbib cylindrical algorithmic decomposition references
-Goal: Axiom Maintenance
+Goal: Axiom Literate Programming
+
+\index{Richardson, Daniel}
+\begin{chunk}{axiom.bib}
+@InCollection{Rich98,
+ author = "Richardson, Daniel",
+ title = "Local Theories and Cylindrical Decomposition",
+ booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
+ publisher = "Springer",
+ year = "1998",
+ isbn = "3-211-82794-3",
+ abstract =
+ "There are many interesting problems which can be expressed in the
+ language of elementary algebra, or in one of its extensions, but which
+ do not really depend on the coordinate system, and in which the
+ variables can be restricted to an arbitrary small neighborhood of some
+ point. It seems that it ought to be possible to use cylindrical
+ decomposition techniques to solve such problems, taking advantage
+ of their special features. This article attempts to do this, but
+ many unsolved problems remain.",
+ keywords = "axiomref"
+}
+
+\end{chunk}
+
+\index{Weispfenning, V.}
+\begin{chunk}{axiom.bib}
+@InCollection{Weis98,
+ author = "Weispfenning, V.",
+ title = "A New Approach to Quantifier Elimination for Real Algebra",
+ booktitle = "Quantifier Elimination and Cylindrical Algebraic Decomposition",
+ publisher = "Springer",
+ year = "1998",
+ isbn = "3-211-82794-3",
+ abstract =
+ "Quantifier elimination for the elementary formal theory of real
+ numbers is a facinating area of research at the intersection of
+ various field of mathematics and computer science, such as
+ mathematical logic, commutative algebra and algebraic geometry,
+ computer algebra, computational geometry and complexity
+ theory. Originally the method of quantifier elimination was invented
+ (among others by Th. Skolem) in mathematical logic as a technical tool
+ for solving the decision problem for a formalized mathematical
+ theory. For the elementary formal theory of real numbers (or more
+ accurately of real closed fields) such a quantifier elimination
+ procedure was established in the 1930s by A. Tarski, using an
+ extension of Sturm's theorem of the 1830s for counting the number of
+ real zeros of a univariate polynomial in a given interval. Since then
+ an abundance of new decision and quantifier elimination methods for
+ this theory with variations and optimizations has been published with
+ the aim both of establishing the theoretical complexity of the problem
+ and of finding methods that are of practical importance (see Arnon
+ 1988a and the discussion and references in Renegar 1992a, 1992b, 1992c
+ for a comparison of these methods). For subproblems such as
+ elimination of quantifiers with respect to variables, that are
+ linearly or quadratically restricted, specialized methods have been
+ developed with good success (see Weispfenning 1988, Loos and
+ Weispfenning 1993; Hong 1992d; Weispfenning 1997).",
+ keywords = "axiomref"
+}
+
+\end{chunk}
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index d33dcb8..e31b9e1 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -5732,6 +5732,8 @@ Makefile update VERSION variable

Makefile fix makefile.ubuntu64 chunk

20170518.02.tpd.patch
download.html update download table for BSD, ubuntu, ubuntu64

+20170520.01.tpd.patch
+bookvolbib cylindrical algorithmic decomposition references

--
1.7.5.4