The complexity of linear problems in fields
Journal of Symbolic Computation
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Guaranteed tuning, with application to robust control and motion planning
Automatica (Journal of IFAC)
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
Subdivision Direction Selection in Interval Methods for Global Optimization
SIAM Journal on Numerical Analysis
Robust multi-objective feedback design by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Robust analysis and design of control systems using interval arithmetic
Automatica (Journal of IFAC)
The essence of constraint propagation
Theoretical Computer Science
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Quantified constraints under perturbation
Journal of Symbolic Computation
The Symbolic Methods in Control System Analysis and Design
The Symbolic Methods in Control System Analysis and Design
Constraint Programming: Basics and Trends: 1994 Chatillon Spring School, Chantillon-Sur-Seine, France, May 16-20, 1994: Selected Papers
Search Heuristics for Box Decomposition Methods
Journal of Global Optimization
Extending Consistent Domains of Numeric CSP
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Versatility of Handling Disjunctions as Constraints
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Selected Papers from Constraint Programming: Basics and Trends
Interval Constraint Logic Programming
Selected Papers from Constraint Programming: Basics and Trends
Solving Disjunctive Constraints for Interactive Graphical Applications
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Beyond NP: Arc-Consistency for Quantified Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Automatic synthesis of optimal invariant assertions: Mathematical foundations
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Solving quantified constraint satisfaction problems
Artificial Intelligence
An efficient algorithm for a sharp approximation of universally quantified inequalities
Proceedings of the 2008 ACM symposium on Applied computing
Splitting heuristics for disjunctive numerical constraints
Proceedings of the 2008 ACM symposium on Applied computing
Theoretical Computer Science
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Tightened reachability constraints for safety verification of linear hybrid systems
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Probabilistic constraints for reliability problems
Proceedings of the 2010 ACM Symposium on Applied Computing
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
SIAM Journal on Control and Optimization
CONTROL'07 Proceedings of the 3rd WSEAS/IASME international conference on Dynamical systems and control
CalCS: SMT solving for non-linear convex constraints
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Satisfiability of systems of equations of real analytic functions is quasi-decidable
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Incremental computation of succinct abstractions for hybrid systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Constraints for continuous reachability in the verification of hybrid systems
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Automated machine-checked hybrid system safety proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Reachability analysis of non-linear planar autonomous systems
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
SMT for Polynomial Constraints on Real Numbers
Electronic Notes in Theoretical Computer Science (ENTCS)
Computation in real closed infinitesimal and transcendental extensions of the rationals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Note: On the complexity of quantified linear systems
Theoretical Computer Science
| Hi-index | 0.00 |
Let a quantified inequality constraint over the reals be a formula in the first-order predicate language over the structure of the real numbers, where the allowed predicate symbols are ≤ and