Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Universally Quantified Interval Constraints
CP '02 Proceedings of the 6th 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
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Formal Methods in System Design
| Hi-index | 0.00 |
In an earlier paper we have shown, how one can successfully use constraint satisfaction techniques for proving and solving formulae in the first-order predicate language over the real numbers (i.e., real first-order constraints). This approach was restricted to inputs that contain inequality symbols such as 驴, but no equality symbols (=) or disequality symbols (驴). In this paper we lay the basis for extending this approach to inputs that contain (dis)equalities. This considerably widens the practical applicability of numerical constraint satisfaction methods.