Query languages for hierarchic databases
Information and Computation
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Generalised Computability and Applications to Hybrid Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Reachability Verification for Hybrid Automata
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reach Set Computations Using Real Quantifier Elimination
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Characteristic Properties of Majorant-Computability over the Reals
Proceedings of the 12th International Workshop on Computer Science Logic
Background, Reserve, and Gandy Machines
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Interval constraint solving for camera control and motion planning
ACM Transactions on Computational Logic (TOCL)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Abstractions for hybrid systems
Formal Methods in System Design
Towards Computability over Effectively Enumerable Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraints for continuous reachability in the verification of hybrid systems
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Towards computability of higher type continuous data
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
In this paper we introduce and study computational aspects of $\it \Sigma_K$-constraints which are powerful enough to represent computable continuous data, but also simple enough to be an approach to approximate constraint solving for a large class of quantified continuous constraints. We illustrate how $\it \Sigma_K$-constraints can be used for reasoning about hybrid systems.