Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
96 | Volker Weispfenning |
Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Fast quantifier elimination and decision methods, First-order theory of reals, Constraint solving, Automatic theorem proving |
78 | Byeong Seok Ahn |
Some Quantifier Functions From Weighting Functions With Constant Value of Orness. |
IEEE Trans. Syst. Man Cybern. Part B |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Saugata Basu |
New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
|
69 | Aless Lasaruk, Thomas Sturm 0001 |
Weak quantifier elimination for the full linear theory of the integers. |
Appl. Algebra Eng. Commun. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Integer constraint solving, Implementation, Quantifier elimination |
69 | Christopher W. Brown 0001, James H. Davenport |
The complexity of quantifier elimination and cylindrical algebraic decomposition. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
quantifier elimination, cylindrical algebraic decomposition |
63 | Lauri Hella, Jose Maria Turull Torres |
Complete Problems for Higher Order Logics. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
Lindström Quantifiers, Complete Problems, Higher Order Logics |
60 | Andreas Dolzmann, Volker Weispfenning |
Local quantifier elimination. |
ISSAC |
2000 |
DBLP DOI BibTeX RDF |
|
60 | Saugata Basu |
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Hervé Fournier |
Quantifier Rank for Parity of Embedded Finite Models. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
Ehrenfeucht-Fraïssé games, Uniform Quantifier Elimination, Connectivity, Reachability, Parity, Constraint databases |
51 | Jie-Hong R. Jiang |
Quantifier Elimination via Functional Composition. |
CAV |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Hoon Hong, Mohab Safey El Din |
Variant real quantifier elimination: algorithm and application. |
ISSAC |
2009 |
DBLP DOI BibTeX RDF |
quantifier elimination, polynomial systems, real solutions |
51 | Hiroshi Yoshida, Katsuhisa Horimoto, Hirokazu Anai |
Inference of Probabilities over a Stochastic IL-System by Quantifier Elimination. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
Lindenmayer system with interactions, cell-type diversity, quantifier elimination, algebraic approach |
51 | Saugata Basu, Richard Pollack, Marie-Françoise Roy |
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
Tarski-Seidenberg principle, quantifier elimination, real closed fields |
45 | Lukasz Kaiser |
Game Quantification on Automatic Structures and Hierarchical Model Checking Games. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Dima Grigoriev |
How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. |
ISSAC |
1990 |
DBLP DOI BibTeX RDF |
|
45 | Volker Weispfenning |
Semilinear Motion Planning in REDLOG. |
Appl. Algebra Eng. Commun. Comput. |
2001 |
DBLP DOI BibTeX RDF |
REDLOG, Motion planning, Quantifier elimination |
45 | Konstantin Knorr, Susanne Röhrig |
Security of Electronic Business Applications - Structure and Quantification. |
EC-Web |
2000 |
DBLP DOI BibTeX RDF |
security quantifier, electronic business application, security |
42 | Manfred Kufleitner, Pascal Weil |
On FO2 Quantifier Alternation over Words. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Elena Kartashova, Scott McCallum |
Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators. |
Calculemus/MKM |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Luigi Troiano, Ronald R. Yager |
On the Relationship Between the Quantifier Threshold and OWA Operators. |
MDAI |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Félix Díaz-Hermida, David E. Losada, Alberto Bugarín, Senén Barro |
A Probabilistic Quantifier Fuzzification Mechanism: The Model and Its Evaluation for Information Retrieval. |
IEEE Trans. Fuzzy Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Ting Zhang 0001, Henny B. Sipma, Zohar Manna |
Term Algebras with Length Function and Bounded Quantifier Alternation. |
TPHOLs |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Sanjit A. Seshia, Randal E. Bryant |
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Andreas Dolzmann, Lorenz A. Gilch |
Generic Hermitian Quantifier Elimination. |
AISC |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Matthias Baaz, Helmut Veith |
Quantifier Elimination in Fuzzy Logic. |
CSL |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Scott McCallum, Christopher W. Brown 0001 |
On delineability of varieties in CAD-based quantifier elimination with two equational constraints. |
ISSAC |
2009 |
DBLP DOI BibTeX RDF |
quantifier elimination, cylindrical algebraic decomposition |
42 | Noriko Hyodo, Myunghoon Hong, Hitoshi Yanami, Shinji Hara, Hirokazu Anai |
Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination. |
Appl. Algebra Eng. Commun. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Fixed-structure controller synthesis, CACSD (Computer Aided Control System Design) tool, Robust control, Quantifier elimination, Symbolic-numeric computation |
42 | Richard Liska, Pavel Váchal |
Quantifier elimination supported proofs in the numerical treatment of fluid flows. |
Appl. Algebra Eng. Commun. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Stability, Quantifier elimination, Finite difference method |
42 | Dov M. Gabbay, Andrzej Szalas |
Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. |
Stud Logica |
2007 |
DBLP DOI BibTeX RDF |
second-order quantifier elimination, higher-order relations, conditionals |
42 | Marc Aiguier, Agnès Arnould, Pascale Le Gall, Delphine Longuet |
Test Selection Criteria for Quantifier-Free First-Order Specifications. |
FSEN |
2007 |
DBLP DOI BibTeX RDF |
quantifier-free first-order specifications, axiom coverage, proof tree normalization, Specification-based testing, unfolding, test purpose, selection criteria |
42 | Andrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín |
On the quantifier complexity of bigtriangleupn+1 (T)? induction. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
n+1, Quantifier complexity, Induction, formulas |
36 | Xinwang Liu 0001 |
Some properties of the weighted OWA operator. |
IEEE Trans. Syst. Man Cybern. Part B |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Domenico Cantone, Calogero G. Zarba |
A Decision Procedure for Monotone Functions over Bounded and Complete Lattices. |
Theory and Applications of Relational Structures as Knowledge Instruments |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
36 | Dov M. Gabbay, Andrzej Szalas |
Annotation Theories over Finite Graphs. |
Stud Logica |
2009 |
DBLP DOI BibTeX RDF |
labeled graphs, semantics of logic programs, second-order quantifier elimination, annotations, argumentation theory |
36 | Thomas Sturm 0001, Andreas Weber 0004, Essam O. Abdel-Rahman, M'hammed El Kahoui |
Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology. |
Math. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
quantifier elimination over the reals, logical inconsistency checking, dynamical systems, oscillations, Hopf bifurcations |
36 | Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard |
Deciding Boolean Algebra with Presburger Arithmetic. |
J. Autom. Reason. |
2006 |
DBLP DOI BibTeX RDF |
complexity, program verification, decision procedure, Boolean algebra, quantifier elimination, Presburger arithmetic |
36 | Thomas Sturm 0001 |
Reasoning over Networks by Symbolic Methods. |
Appl. Algebra Eng. Commun. Comput. |
1999 |
DBLP DOI BibTeX RDF |
Real quantifier elimination, Diagnosis, Error detection, Network analysis, Network sizing, Automatic reasoning |
33 | Phokion G. Kolaitis, Swastik Kopparty |
Random graphs and the parity quantifier. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
0-1 law, AC0, modular convergence, first-order logic |
33 | Aless Lasaruk, Thomas Sturm 0001 |
Effective Quantifier Elimination for Presburger Arithmetic with Infinity. |
CASC |
2009 |
DBLP DOI BibTeX RDF |
|
33 | David Monniaux |
A Quantifier Elimination Algorithm for Linear Real Arithmetic. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mikolaj Bojanczyk, Luc Segoufin |
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. |
ICALP (2) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Renate A. Schmidt |
Improved Second-Order Quantifier Elimination in Modal Logic. |
JELIA |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella |
Quantifier Structure in Search-Based Procedures for QBFs. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Adrian Brasoveanu 0001 |
Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational and Modal Subordination. |
WoLLIC |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Rui Otake, Kei Yoshimoto |
A Multimodal Type Logical Grammar Analysis of Japanese: Word Order and Quantifier Scope. |
JSAI |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Mana Kobuchi-Philip |
A Modifier Hypothesis on the Japanese Indeterminate Quantifier Phrase. |
JSAI |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Aless Lasaruk, Thomas Sturm 0001 |
Weak Integer Quantifier Elimination Beyond the Linear Case. |
CASC |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Roland Carl Backhouse, Diethard Michaelis |
Exercises in Quantifier Manipulation. |
MPC |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella |
Quantifier structure in search based procedures for QBFs. |
DATE |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Stéphane Demri, Ranko Lazic 0001 |
LTL with the Freeze Quantifier and Register Automata. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Amine Chaieb |
Verifying Mixed Real-Integer Quantifier Elimination. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Lu Yang, Bican Xia |
Quantifier Elimination for Quartics. |
AISC |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Christopher W. Brown 0001, Christian Gross 0003 |
Efficient Preprocessing Methods for Quantifier Elimination. |
CASC |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Marco Benedetti |
Quantifier Trees for QBFs. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Dale Miller 0001 |
Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Scott McCallum |
On propagation of equational constraints in CAD-based quantifier elimination. |
ISSAC |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Leonid Libkin |
Variable Independence, Quantifier Elimination, and Constraint Representations. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Clemens Lautemann, Bernhard Weinzinger |
MonadicNLIN and Quantifier-Free Reductions. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Dolzmann |
Solving Geometric Problems with Real Quantifier Elimination. |
Automated Deduction in Geometry |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Oliver Matz |
One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Igor Stéphan |
A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic Programming. |
AIMSA |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Oliver Matz, Wolfgang Thomas |
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Volker Weispfenning |
Quantifier Elimination for Real Algebra - the Cubic Case. |
ISSAC |
1994 |
DBLP DOI BibTeX RDF |
|
33 | W. Böge |
Quantifier Elimination for Real Closed Fields. |
AAECC |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Yuguo He |
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
Ehrenfeucht-Fraïssé games, quantifier structure, finite model theory |
33 | Saugata Basu, Richard Pollack, Marie-Françoise Roy |
On the Combinatorial and Algebraic Complexity of Quantifier Elimination |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
complex geometry, first order formulae, asymptotically fastest algorithm, input polynomials, sign partition, polynomials, quantifier elimination, combinatorial complexity, algebraic complexity, real closed fields, first order theory, complexity bound |
31 | Harry Vinall-Smeeth |
From Quantifier Depth to Quantifier Number: Separating Structures with k Variables. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
31 | Lucas Böltz, Hannes Frey, Dennis Peuter, Viorica Sofronie-Stokkermans |
On Testing Containedness Between Geometric Graph Classes using Second-order Quantifier Elimination and Hierarchical Reasoning (Short Paper). |
SOQE@KR |
2021 |
DBLP BibTeX RDF |
|
31 | Leopoldo E. Bertossi |
Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases (Abstract). |
SOQE@KR |
2021 |
DBLP BibTeX RDF |
|
31 | Christoph Wernhard |
Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof. |
SOQE@KR |
2021 |
DBLP BibTeX RDF |
|
31 | Yijia Chen, Jörg Flum |
Tree-depth, quantifier elimination, and quantifier rank. |
LICS |
2018 |
DBLP DOI BibTeX RDF |
|
31 | Christoph Wernhard |
Early Steps of Second-Order Quantifier Elimination beyond the Monadic Case: The Correspondence between Heinrich Behmann and Wilhelm Ackermann 1928-1934 (Abstract). |
SOQE |
2017 |
DBLP BibTeX RDF |
|
31 | Christoph Wernhard |
Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas. |
SOQE |
2017 |
DBLP BibTeX RDF |
|
31 | Silvio Ghilardi, Elena Pagani |
Second Order Quantifier Elimination: Towards Verification Applications. |
SOQE |
2017 |
DBLP BibTeX RDF |
|
31 | Martin Weese |
Decidability with Respect to Härtig Quantifier and Rescher Quantifier. |
Math. Log. Q. |
1981 |
DBLP DOI BibTeX RDF |
|
27 | Florian Pigorsch, Christoph Scholl 0001 |
An AIG-Based QBF-solver using SAT for preprocessing. |
DAC |
2010 |
DBLP DOI BibTeX RDF |
Boolean satisfiability, quantified boolean formulas |
27 | Christoph Wernhard |
Literal Projection for First-Order Logic. |
JELIA |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Radosav Djordjevic, Nebojsa Ikodinovic, Zarko Mijajlovic |
Completeness theorem for topological class models. |
Arch. Math. Log. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03C70 |
27 | Yukio Furukawa |
Unembedded 'Negative' Quantifiers. |
JSAI |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Guoqiang Pan, Moshe Y. Vardi |
Symbolic Techniques in Satisfiability Solving. |
J. Autom. Reason. |
2005 |
DBLP DOI BibTeX RDF |
symbolic decision procedure, satisfiability, binary decision diagram |
27 | Moni Naor, Asaf Nussboim, Eran Tromer |
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
27 | James Cheney |
A Simpler Proof Theory for Nominal Logic. |
FoSSaCS |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Guoqiang Pan, Moshe Y. Vardi |
Search vs. Symbolic Techniques in Satisfiability Solving. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Andreas Seidl, Thomas Sturm 0001 |
A generic projection operator for partial cylindrical algebraic decomposition. |
ISSAC |
2003 |
DBLP DOI BibTeX RDF |
REDLOG, partial CAD, projection operator |
27 | William Hesse, Neil Immerman |
Complete Problems for Dynamic Complexity Classes. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Deepak Kapur, Mahadevan Subramaniam |
Extending Decision Procedures with Induction Schemes. |
CADE |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
First-Order Logic with Two Variables and Unary Temporal Logic. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Dov M. Gabbay, Andrzej Szalas |
Voting by Eliminating Quantifiers. |
Stud Logica |
2009 |
DBLP DOI BibTeX RDF |
voting, quantifier elimination, social choice |
27 | David Monniaux |
Automatic modular abstractions for linear constraints. |
POPL |
2009 |
DBLP DOI BibTeX RDF |
program transformation, abstract interpretation, quantifier elimination, linear inequalities |
27 | Felix Klaedtke |
Bounds on the automata size for Presburger arithmetic. |
ACM Trans. Comput. Log. |
2008 |
DBLP DOI BibTeX RDF |
Automata-based decision procedures, complexity, quantifier elimination, Presburger arithmetic |
27 | Benjamin Rossman |
Homomorphism preservation theorems. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
preservation theorems, quantifier-rank, tree-depth, first-order logic, conjunctive queries, homomorphisms, Finite model theory |
27 | Wei Niu 0001, Dongming Wang 0001 |
Algebraic Approaches to Stability Analysis of Biological Systems. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
discriminant variety, Gröbner basis, real solution classification, self-assembling micelle system, stability, CAD, equilibrium, quantifier elimination, Bifurcation, steady state, biological model, triangular decomposition |
27 | Janusz Kacprzyk, Slawomir Zadrozny, Mario Fedrizzi, Hannu Nurmi |
On Group Decision Making, Consensus Reaching, Voting and Voting Paradoxes under Fuzzy Preferences and a Fuzzy Majority: A Survey and some Perspectives. |
Fuzzy Sets and Their Extensions: Representation, Aggregation and Models |
2008 |
DBLP DOI BibTeX RDF |
Fuzzy majority, Fuzzy logic, Consensus, Group decision making, Social choice, Linguistic quantifier, Fuzzy preference relation |
27 | Songxin Liang, David J. Jeffrey, Marc Moreno Maza |
The complete root classification of a parametric polynomial on an interval. |
ISSAC |
2008 |
DBLP DOI BibTeX RDF |
complete root classification, parametric polynomial, real quantifier elimination, interval, real root |
27 | Patrick Bosc, Olivier Pivert, Daniel Rocacher |
About quotient and division of crisp and fuzzy relations. |
J. Intell. Inf. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Division of relations, Fuzzy quantifier, Relational databases, Fuzzy sets, Preferences, Flexible queries |
27 | Anup Kumar Bandyopadhyay |
Modeling fairness and starvation in concurrent systems. |
ACM SIGSOFT Softw. Eng. Notes |
2007 |
DBLP DOI BibTeX RDF |
temporal quantifier, temporal logic, fairness, concurrent program, liveness, weakest precondition |
27 | Morteza Moniri |
Preservation theorems for bounded formulas. |
Arch. Math. Log. |
2007 |
DBLP DOI BibTeX RDF |
Polynomial induction, Model completeness, Universal theory, Quantifier elimination, Intuitionistic logic, NP, Bounded arithmetic, Polynomial hierarchy, Kripke model |
27 | Richard Frank, Flavia Moser, Martin Ester |
A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions. |
PKDD |
2007 |
DBLP DOI BibTeX RDF |
multi-relational datamining, multi-relational classification, multi-feature aggregation, existential quantifier |
27 | Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan |
Generating Polynomial Invariants with DISCOVERER and QEPCAD. |
Formal Methods and Hybrid Real-Time Systems |
2007 |
DBLP DOI BibTeX RDF |
Semi-Algebraic Systems, DISCOVERER, QEPCAD, Program Verification, Quantifier Elimination, Invariant Generation, Polynomial Programs |