Log in

Relevant bibliographies by topics / Quantifier Elimination

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Quantifier Elimination'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantifier Elimination.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quantifier Elimination"

1

Bubeck, Uwe, and Hans Kleine Büning. "Models and quantifier elimination for quantified Horn formulas." Discrete Applied Mathematics 156, no. 10 (2008): 1606–22. http://dx.doi.org/10.1016/j.dam.2007.10.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hong, Hoon, and Mohab Safey El Din. "Variant quantifier elimination." Journal of Symbolic Computation 47, no. 7 (2012): 883–901. http://dx.doi.org/10.1016/j.jsc.2011.05.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Nipkow, Tobias. "Linear Quantifier Elimination." Journal of Automated Reasoning 45, no. 2 (2010): 189–212. http://dx.doi.org/10.1007/s10817-010-9183-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Loos, R. "Applying Linear Quantifier Elimination." Computer Journal 36, no. 5 (1993): 450–62. http://dx.doi.org/10.1093/comjnl/36.5.450.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Weispfenning, Volker. "Quantifier elimination for modules." Archiv für Mathematische Logik und Grundlagenforschung 25, no. 1 (1985): 1–11. http://dx.doi.org/10.1007/bf02007550.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Prunescu, Mihai. "Non-effective Quantifier Elimination." MLQ 47, no. 4 (2001): 557–61. http://dx.doi.org/10.1002/1521-3870(200111)47:4<557::aid-malq557>3.0.co;2-o.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Keisler, H. Jerome. "Quantifier elimination for neocompact sets." Journal of Symbolic Logic 63, no. 4 (1998): 1442–72. http://dx.doi.org/10.2307/2586661.

Full text

Abstract:

AbstractWe shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets is countably compact. To provid

APA, Harvard, Vancouver, ISO, and other styles

8

Subramani, K., and D. Desovski. "Out of order quantifier elimination for Standard Quantified Linear Programs." Journal of Symbolic Computation 40, no. 6 (2005): 1383–96. http://dx.doi.org/10.1016/j.jsc.2005.08.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Keisler, H. Jerome, and Wafik Boulos Lotfallah. "Almost everywhere elimination of probability quantifiers." Journal of Symbolic Logic 74, no. 4 (2009): 1121–42. http://dx.doi.org/10.2178/jsl/1254748683.

Full text

Abstract:

AbstractWe obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like ∃≥3/4y which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are:1. We deal with the quantifier ∃≥ry, where y is a tuple of variables.2. We remove the closedness restriction, which requires that the variables in y occur in all atomic subformulas of the quantifier scope.3. Instead of the un

APA, Harvard, Vancouver, ISO, and other styles

10

LIPSHITZ, L., and Z. ROBINSON. "OVERCONVERGENT REAL CLOSED QUANTIFIER ELIMINATION." Bulletin of the London Mathematical Society 38, no. 06 (2006): 897–906. http://dx.doi.org/10.1112/s0024609306018832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Quantifier Elimination"

1

Hong, Hoon. "Improvements in CAD-based quantifier elimination /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487684245468432.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dolzmann, Andreas. "Algorithmic strategies for applicable real quantifier elimination." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=963958151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Košta, Marek [Verfasser], and Thomas [Akademischer Betreuer] Sturm. "New concepts for real quantifier elimination by virtual substitution / Marek Košta ; Betreuer: Thomas Sturm." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2016. http://d-nb.info/112211060X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Passmore, Grant Olney. "Combined decision procedures for nonlinear arithmetics, real and complex." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5738.

Full text

Abstract:

We describe contributions to algorithmic proof techniques for deciding the satisfiability of boolean combinations of many-variable nonlinear polynomial equations and inequalities over the real and complex numbers. In the first half, we present an abstract theory of Grobner basis construction algorithms for algebraically closed fields of characteristic zero and use it to introduce and prove the correctness of Grobner basis methods tailored to the needs of modern satisfiability modulo theories (SMT) solvers. In the process, we use the technique of proof orders to derive a generalisation of S-pol

APA, Harvard, Vancouver, ISO, and other styles

5

Elmwafy, Ahmed Osama Mohamed Sayed Sayed. "Model theory of algebraically closed fields and the Ax-Grothendieck Theorem." University of Western Cape, 2020. http://hdl.handle.net/11394/8275.

Full text

Abstract:

>Magister Scientiae - MSc<br>We introduce the concept of an algebraically closed field with emphasis of the basic model-theoretic results concerning the theory of algebraically closed fields. One of these nice results about algebraically closed fields is the quantifier elimination property. We also show that the theory of algebraically closed field with a given characteristic is complete and model-complete. Finally, we introduce the beautiful Ax-Grothendieck theorem and an application to it.

APA, Harvard, Vancouver, ISO, and other styles

6

Phillips, Laura Rose. "Some structures interpretable in the ring of continuous semi-algebraic functions on a curve." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/some-structures-interpretable-in-the-ring-of-continuous-semialgebraic-functions-on-a-curve(f5a52f43-1bf2-42da-85c0-22847a35dcfc).html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Le, Huu Phuoc. "On solving parametric polynomial systems and quantifier elimination over the reals : algorithms, complexity and implementations." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS554.

Full text

Abstract:

La résolution de systèmes polynomiaux est un domaine de recherche actif situé entre informatique et mathématiques. Il trouve de nombreuses applications dans divers domaines des sciences de l'ingénieur (robotique, biologie) et du numérique (cryptographie, imagerie, contrôle optimal). Le calcul formel fournit des algorithmes qui permettent de calculer des solutions exactes à ces applications, ce qui pourraient être très délicat pour des algorithmes numériques en raison de la non-linéarité. La plupart des applications en ingénierie s'intéressent aux solutions réelles. Le développement d'algorithm

APA, Harvard, Vancouver, ISO, and other styles

8

Banerjee, Bonny. "Spatial problem solving for diagrammatic reasoning." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1194455860.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kaila, Risto. "On almost sure elimination of generalized quantifiers." Helsinki : University of Helsinki, 2001. http://ethesis.helsinki.fi/julkaisut/mat/matem/vk/kaila/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nunes, Sampaio Diogo. "Profile guided hybrid compilation." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM082/document.

Full text

Abstract:

L'auteur n'a pas fourni de résumé en français<br>The end of chip frequency scaling capacity, due heat dissipation limitations, made manufacturers search for an alternative to sustain the processing capacity growth. The chosen solution was to increase the hardware parallelism, by packing multiple independent processors in a single chip, in a Multiple-Instruction Multiple-Data (MIMD) fashion, each with special instructions to operate over a vector of data, in a Single-Instruction Multiple-Data (SIMD) manner. Such paradigm change, brought to software developer the convoluted task of producing eff

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Quantifier Elimination"

1

Caviness, Bob F., and Jeremy R. Johnson, eds. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer Vienna, 1998. http://dx.doi.org/10.1007/978-3-7091-9459-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

F, Caviness Bob, and Johnson J. R, eds. Quantifier elimination and cylindrical algebraic decomposition. Springer, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

A, Schmidt Renate, and Szałas Andrzej 1958-, eds. Second-order quantifier elimination: Foundations, computational aspects and applications. College Publications, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Johnson, Jeremy R., and Bob F. Caviness. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer London, Limited, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

(Editor), Bob F. Caviness, and Jeremy R. Johnson (Editor), eds. Quantifier Elimination and Cylindrical Algebraic Decomposition (Texts and Monographs in Symbolic Computation). Springer, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tennant, Neil. From the Logic of Evaluation to the Logic of Deduction. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198777892.003.0004.

Full text

Abstract:

We deliver the details on the smooth morphing from the verification and falsification rules of the model-relative Logic of Evaluation to the model-invariant, deductive rules of Core Logic. There are good reasons for preferring the parallelized forms of certain elimination rules in natural deduction (the ones for conjunction, the conditional, and the universal quantifier) to their more conventional serial forms. We explain how ⊥ can make its way into proofs as a conclusion, as required for applications of ¬-Introduction. We discuss the notion of harmony between introduction and elimination rule

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Quantifier Elimination"

1

Basu, Saugata, Richard Pollack, and Marie-Francoise Roy. "Quantifier Elimination." In Algorithms in Real Algebraic Geometry. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-05355-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Marcja, Annalisa, and Carlo Toffalori. "Quantifier Elimination." In Trends in Logic. Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-007-0812-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rasga, João, and Cristina Sernadas. "Quantifier Elimination." In Studies in Universal Logic. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56554-1_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Marker, David. "Quantifier Elimination." In Graduate Texts in Mathematics. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-55368-4_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Goldberg, Eugene, and Panagiotis Manolios. "Partial Quantifier Elimination." In Hardware and Software: Verification and Testing. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13338-6_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Autexier, Serge, Heiko Mantel, and Werner Stephan. "Simultaneous quantifier elimination." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0095435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Garcia-Contreras, Isabel, V. K. Hari Govind, Sharon Shoham, and Arie Gurfinkel. "Fast Approximations of Quantifier Elimination." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_4.

Full text

Abstract:

AbstractQuantifier elimination (qelim) is used in many automated reasoning tasks including program synthesis, exist-forall solving, quantified SMT, Model Checking, and solving Constrained Horn Clauses (CHCs). Exact qelim is computationally expensive. Hence, it is often approximated. For example, Z3 uses “light” pre-processing to reduce the number of quantified variables. CHC-solver Spacer uses model-based projection (MBP) to under-approximate qelim relative to a given model, and over-approximations of qelim can be used as abstractions.In this paper, we present the QEL framework for fast approximations of qelim. QEL provides a uniform interface for both quantifier reduction and model-based projection. QEL builds on the egraph data structure – the core of the EUF decision procedure in SMT – by casting quantifier reduction as a problem of choosing ground (i.e., variable-free) representatives for equivalence classes. We have used QEL to implement MBP for the theories of Arrays and Algebraic Data Types (ADTs). We integrated QEL and our new MBP in Z3 and evaluated it within several tasks that rely on quantifier approximations, outperforming state-of-the-art.

APA, Harvard, Vancouver, ISO, and other styles

8

Yang, Lu, and Bican Xia. "Quantifier Elimination for Quartics." In Artificial Intelligence and Symbolic Computation. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11856290_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dolzmann, Andreas, and Lorenz A. Gilch. "Generic Hermitian Quantifier Elimination." In Artificial Intelligence and Symbolic Computation. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30210-0_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Goldberg, Eugene. "Partial Quantifier Elimination and Property Generation." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_6.

Full text

Abstract:

AbstractWe study partial quantifier elimination (PQE) for propositional CNF formulas with existential quantifiers. PQE is a generalization of quantifier elimination where one can limit the set of clauses taken out of the scope of quantifiers to a small subset of clauses. The appeal of PQE is that many verification problems (e.g., equivalence checking and model checking) can be solved in terms of PQE and the latter can be dramatically simpler than full quantifier elimination. We show that PQE can be used for property generation that one can view as a generalization of testing. The objective here is to produce an unwanted property of a design implementation, thus exposing a bug. We introduce two PQE solvers called $$ EG \text {-} PQE $$ E G - P Q E and $$ EG \text {-} PQE ^+$$ E G - P Q E + . $$ EG \text {-} PQE $$ E G - P Q E is a very simple SAT-based algorithm. $$ EG \text {-} PQE ^+$$ E G - P Q E + is more sophisticated and robust than $$ EG \text {-} PQE $$ E G - P Q E . We use these PQE solvers to find an unwanted property (namely, an unwanted invariant) of a buggy FIFO buffer. We also apply them to invariant generation for sequential circuits from a HWMCC benchmark set. Finally, we use these solvers to generate properties of a combinational circuit that mimic symbolic simulation.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Quantifier Elimination"

1

Dolzmann, Andreas, and Volker Weispfenning. "Local quantifier elimination." In the 2000 international symposium. ACM Press, 2000. http://dx.doi.org/10.1145/345542.345589.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Yijia, and Jörg Flum. "Tree-depth, quantifier elimination, and quantifier rank." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2018. http://dx.doi.org/10.1145/3209108.3209160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hong, Hoon, and Mohab Safey El Din. "Variant real quantifier elimination." In the 2009 international symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1576702.1576729.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vosswinkel, Rick, Dinu Mihailescu-Stoica, Frank Schrodel, and Klaus Robenack. "Determining Passivity via Quantifier Elimination." In 2019 27th Mediterranean Conference on Control and Automation (MED). IEEE, 2019. http://dx.doi.org/10.1109/med.2019.8798571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dolzmann, Andreas, Oliver Gloor, and Thomas Sturm. "Approaches to parallel quantifier elimination." In the 1998 international symposium. ACM Press, 1998. http://dx.doi.org/10.1145/281508.281564.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Goldberg, Eugene, and Panagiotis Manolios. "Quantifier elimination via clause redundancy." In 2013 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2013. http://dx.doi.org/10.1109/fmcad.2013.6679395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gitina, Karina, Ralf Wimmer, Sven Reimer, Matthias Sauer, Christoph Scholl, and Bernd Becker. "Solving DQBF Through Quantifier Elimination." In Design, Automation and Test in Europe. IEEE Conference Publications, 2015. http://dx.doi.org/10.7873/date.2015.0098.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Anai, Hirokazu. "Effective quantifier elimination for industrial applications." In the 39th International Symposium. ACM Press, 2014. http://dx.doi.org/10.1145/2608628.2627494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Weispfenning, Volker. "Mixed real-integre linear quantifier elimination." In the 1999 international symposium. ACM Press, 1999. http://dx.doi.org/10.1145/309831.309888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ajtai, Miklos. "Lower bounds for RAMs and quantifier elimination." In the 45th annual ACM symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2488608.2488710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Quantifier Elimination"

1

Mulligan, Casey. Automated Economic Reasoning with Quantifier Elimination. National Bureau of Economic Research, 2016. http://dx.doi.org/10.3386/w22922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mulligan, Casey. Quantifier Elimination for Deduction in Econometrics. National Bureau of Economic Research, 2018. http://dx.doi.org/10.3386/w24601.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Brown, Christopher W. On Quantifer Elimination by Virtual Term Substitution. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada608079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brown, Christopher W. On Quantifer Elimination by Virtual Term Substitution. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada460669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!