Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
96 | Volker Weispfenning |
Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(2), pp. 85-101, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 38(2), pp. 540-546, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Saugata Basu |
New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(4), pp. 537-555, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
69 | Aless Lasaruk, Thomas Sturm 0001 |
Weak quantifier elimination for the full linear theory of the integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(6), pp. 545-574, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 54-60, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quantifier elimination, cylindrical algebraic decomposition |
63 | Lauri Hella, Jose Maria Turull Torres |
Complete Problems for Higher Order Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 380-394, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lindström Quantifiers, Complete Problems, Higher Order Logics |
60 | Andreas Dolzmann, Volker Weispfenning |
Local quantifier elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, pp. 86-94, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
60 | Saugata Basu |
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 56-65, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Hervé Fournier |
Quantifier Rank for Parity of Embedded Finite Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 375-386, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 383-397, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Hoon Hong, Mohab Safey El Din |
Variant real quantifier elimination: algorithm and application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 183-190, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(3), pp. 473-485, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(6), pp. 1002-1045, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 411-425, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, August 20-24, 1990, pp. 104-105, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
45 | Volker Weispfenning |
Semilinear Motion Planning in REDLOG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(6), pp. 455-475, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
REDLOG, Motion planning, Quantifier elimination |
45 | Konstantin Knorr, Susanne Röhrig |
Security of Electronic Business Applications - Structure and Quantification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC-Web ![In: Electronic Commerce and Web Technologies, First International Conference, EC-Web 2000, London, UK, September 4-6, 2000, Proceedings, pp. 25-37, 2000, Springer, 3-540-67981-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
security quantifier, electronic business application, security |
42 | Manfred Kufleitner, Pascal Weil |
On FO2 Quantifier Alternation over Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 513-524, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Elena Kartashova, Scott McCallum |
Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Calculemus/MKM ![In: Towards Mechanized Mathematical Assistants, 14th Symposium, Calculemus 2007, 6th International Conference, MKM 2007, Hagenberg, Austria, June 27-30, 2007, Proceedings, pp. 106-115, 2007, Springer, 978-3-540-73083-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Luigi Troiano, Ronald R. Yager |
On the Relationship Between the Quantifier Threshold and OWA Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MDAI ![In: Modeling Decisions for Artificial Intelligence, Third International Conference, MDAI 2006, Tarragona, Spain, April 3-5, 2006, Proceedings, pp. 215-226, 2006, Springer, 3-540-32780-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 13(5), pp. 688-700, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Ting Zhang 0001, Henny B. Sipma, Zohar Manna |
Term Algebras with Length Function and Bounded Quantifier Alternation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 17th International Conference, TPHOLs 2004, Park City, Utah, USA, September 14-17, 2004, Proceedings, pp. 321-336, 2004, Springer, 3-540-23017-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Sanjit A. Seshia, Randal E. Bryant |
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 100-109, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Andreas Dolzmann, Lorenz A. Gilch |
Generic Hermitian Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence and Symbolic Computation, 7th International Conference, AISC 2004, Linz, Austria, September 22-24, 2004, Proceedings, pp. 80-93, 2004, Springer, 3-540-23212-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Matthias Baaz, Helmut Veith |
Quantifier Elimination in Fuzzy Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 399-414, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 71-78, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(6), pp. 497-512, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(6), pp. 575-582, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 87(1), pp. 37-50, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSEN ![In: International Symposium on Fundamentals of Software Engineering, International Symposium, FSEN 2007, Tehran, Iran, April 17-19, 2007, Proceedings, pp. 144-159, 2007, Springer, 978-3-540-75697-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(3), pp. 371-398, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
n+1, Quantifier complexity, Induction, formulas |
36 | Xinwang Liu 0001 |
Some properties of the weighted OWA operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 36(1), pp. 118-127, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Domenico Cantone, Calogero G. Zarba |
A Decision Procedure for Monotone Functions over Bounded and Complete Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory and Applications of Relational Structures as Knowledge Instruments ![In: Theory and Applications of Relational Structures as Knowledge Instruments II, International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers, pp. 318-333, 2006, Springer, 3-540-69223-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 444-454, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
36 | Dov M. Gabbay, Andrzej Szalas |
Annotation Theories over Finite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 93(2-3), pp. 147-180, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 2(3), pp. 493-515, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 36(3), pp. 213-239, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(1), pp. 79-96, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 705-714, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings, pp. 195-212, 2009, Springer, 978-3-642-04102-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | David Monniaux |
A Quantifier Elimination Algorithm for Linear Real Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 243-257, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mikolaj Bojanczyk, Luc Segoufin |
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp. 233-245, 2008, Springer, 978-3-540-70582-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Renate A. Schmidt |
Improved Second-Order Quantifier Elimination in Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings, pp. 375-388, 2008, Springer, 978-3-540-87802-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella |
Quantifier Structure in Search-Based Procedures for QBFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(3), pp. 497-507, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Adrian Brasoveanu 0001 |
Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational and Modal Subordination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007, Proceedings, pp. 101-119, 2007, Springer, 978-3-540-73443-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Rui Otake, Kei Yoshimoto |
A Multimodal Type Logical Grammar Analysis of Japanese: Word Order and Quantifier Scope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI ![In: New Frontiers in Artificial Intelligence, JSAI 2007 Conference and Workshops, Miyazaki, Japan, June 18-22, 2007, Revised Selected Papers, pp. 135-148, 2007, Springer, 978-3-540-78196-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Mana Kobuchi-Philip |
A Modifier Hypothesis on the Japanese Indeterminate Quantifier Phrase. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI ![In: New Frontiers in Artificial Intelligence, JSAI 2007 Conference and Workshops, Miyazaki, Japan, June 18-22, 2007, Revised Selected Papers, pp. 201-213, 2007, Springer, 978-3-540-78196-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Aless Lasaruk, Thomas Sturm 0001 |
Weak Integer Quantifier Elimination Beyond the Linear Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings, pp. 275-294, 2007, Springer, 978-3-540-75186-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Roland Carl Backhouse, Diethard Michaelis |
Exercises in Quantifier Manipulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MPC ![In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings, pp. 69-81, 2006, Springer, 3-540-35631-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella |
Quantifier structure in search based procedures for QBFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2006, Munich, Germany, March 6-10, 2006, pp. 812-817, 2006, European Design and Automation Association, Leuven, Belgium, 3-9810801-1-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Stéphane Demri, Ranko Lazic 0001 |
LTL with the Freeze Quantifier and Register Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pp. 17-26, 2006, IEEE Computer Society, 0-7695-2631-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Amine Chaieb |
Verifying Mixed Real-Integer Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 528-540, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Lu Yang, Bican Xia |
Quantifier Elimination for Quartics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006, Beijing, China, September 20-22, 2006, Proceedings, pp. 131-145, 2006, Springer, 3-540-39728-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Christopher W. Brown 0001, Christian Gross 0003 |
Efficient Preprocessing Methods for Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings, pp. 89-100, 2006, Springer, 3-540-45182-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Marco Benedetti |
Quantifier Trees for QBFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 378-385, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Dale Miller 0001 |
Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, pp. 24, 2004, Springer, 3-540-23024-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Scott McCallum |
On propagation of equational constraints in CAD-based quantifier elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 223-231, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Leonid Libkin |
Variable Independence, Quantifier Elimination, and Constraint Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 260-271, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Clemens Lautemann, Bernhard Weinzinger |
MonadicNLIN and Quantifier-Free Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 322-337, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Dolzmann |
Solving Geometric Problems with Real Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automated Deduction in Geometry ![In: Automated Deduction in Geometry, Second International Workshop, ADG'98, Beijing, China, August 1-3, 1998, Proceedings, pp. 14-29, 1998, Springer, 3-540-66672-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Oliver Matz |
One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 751-759, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Igor Stéphan |
A New Abstract Logic Programming Language and Its Quantifier Elimination Method for Disjunctive Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIMSA ![In: Artificial Intelligence: Methodology, Systems, and Applications, 8th International Conference, AIMSA '98, Sozopol, Bulgaria, September 21-13, 1998, Proceedings, pp. 403-416, 1998, Springer, 3-540-64993-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Oliver Matz, Wolfgang Thomas |
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 236-244, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Volker Weispfenning |
Quantifier Elimination for Real Algebra - the Cubic Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 258-263, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | W. Böge |
Quantifier Elimination for Real Closed Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Algebraic Algorithms and Error-Correcting Codes, 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985, Proceedings, pp. 247-261, 1985, Springer, 3-540-16776-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
33 | Yuguo He |
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 170-178, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 632-641, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.15885, 2023. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE@KR ![In: Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021., pp. 37-45, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Leopoldo E. Bertossi |
Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE@KR ![In: Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021., pp. 28-36, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Christoph Wernhard |
Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE@KR ![In: Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021., pp. 98-111, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Yijia Chen, Jörg Flum |
Tree-depth, quantifier elimination, and quantifier rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pp. 225-234, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE ![In: Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017), Dresden, Germany, December 6-8, 2017., pp. 102-105, 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
31 | Christoph Wernhard |
Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE ![In: Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017), Dresden, Germany, December 6-8, 2017., pp. 82-98, 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
31 | Silvio Ghilardi, Elena Pagani |
Second Order Quantifier Elimination: Towards Verification Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE ![In: Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017), Dresden, Germany, December 6-8, 2017., pp. 36-50, 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
31 | Martin Weese |
Decidability with Respect to Härtig Quantifier and Rescher Quantifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 27(36), pp. 569-576, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
27 | Florian Pigorsch, Christoph Scholl 0001 |
An AIG-Based QBF-solver using SAT for preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 170-175, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Boolean satisfiability, quantified boolean formulas |
27 | Christoph Wernhard |
Literal Projection for First-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings, pp. 389-402, 2008, Springer, 978-3-540-87802-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Radosav Djordjevic, Nebojsa Ikodinovic, Zarko Mijajlovic |
Completeness theorem for topological class models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(1), pp. 1-8, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03C70 |
27 | Yukio Furukawa |
Unembedded 'Negative' Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JSAI ![In: New Frontiers in Artificial Intelligence, JSAI 2006 Conference and Workshops, Tokyo, Japan, June 5-9 2006, Revised Selected Papers, pp. 232-245, 2006, Springer, 3-540-69901-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Guoqiang Pan, Moshe Y. Vardi |
Symbolic Techniques in Satisfiability Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 35(1-3), pp. 25-50, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 66-85, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | James Cheney |
A Simpler Proof Theory for Nominal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 379-394, 2005, Springer, 3-540-25388-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Guoqiang Pan, Moshe Y. Vardi |
Search vs. Symbolic Techniques in Satisfiability Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 235-250, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Andreas Seidl, Thomas Sturm 0001 |
A generic projection operator for partial cylindrical algebraic decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pp. 240-247, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
REDLOG, partial CAD, projection operator |
27 | William Hesse, Neil Immerman |
Complete Problems for Dynamic Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pp. 313-, 2002, IEEE Computer Society, 0-7695-1483-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Deepak Kapur, Mahadevan Subramaniam |
Extending Decision Procedures with Induction Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings, pp. 324-345, 2000, Springer, 3-540-67664-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
First-Order Logic with Two Variables and Unary Temporal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 228-235, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
27 | Dov M. Gabbay, Andrzej Szalas |
Voting by Eliminating Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 92(3), pp. 365-379, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
voting, quantifier elimination, social choice |
27 | David Monniaux |
Automatic modular abstractions for linear constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 140-151, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
program transformation, abstract interpretation, quantifier elimination, linear inequalities |
27 | Felix Klaedtke |
Bounds on the automata size for Presburger arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(2), pp. 11:1-11:34, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Automata-based decision procedures, complexity, quantifier elimination, Presburger arithmetic |
27 | Benjamin Rossman |
Homomorphism preservation theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(3), pp. 15:1-15:53, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(3), pp. 507-539, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets and Their Extensions: Representation, Aggregation and Models ![In: Fuzzy Sets and Their Extensions: Representation, Aggregation and Models - Intelligent Systems from Decision Making to Data Mining, Web Intelligence and Computer Vision, pp. 263-295, 2008, Springer, 978-3-540-73722-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pp. 189-196, 2008, ACM, 978-1-59593-904-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 29(2), pp. 185-210, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGSOFT Softw. Eng. Notes ![In: ACM SIGSOFT Softw. Eng. Notes 32(6), 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
temporal quantifier, temporal logic, fairness, concurrent program, liveness, weakest precondition |
27 | Morteza Moniri |
Preservation theorems for bounded formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(1), pp. 9-14, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings, pp. 430-437, 2007, Springer, 978-3-540-74975-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods and Hybrid Real-Time Systems ![In: Formal Methods and Hybrid Real-Time Systems, Essays in Honor of Dines Bjørner and Chaochen Zhou on the Occasion of Their 70th Birthdays, Papers presented at a Symposium held in Macao, China, September 24-25, 2007, pp. 67-82, 2007, Springer, 978-3-540-75220-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Semi-Algebraic Systems, DISCOVERER, QEPCAD, Program Verification, Quantifier Elimination, Invariant Generation, Polynomial Programs |