DOI: 10.1007/978-3-642-11486-1_20
View full text |Buy / Rent full text
Sign up to set email alerts

Abstract: Abstract. In this paper we introduce and study computational aspects of Σ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 ΣK -constraints can be used for reasoning about hybrid systems.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles