Abstract
We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, Lipschitz properties possibly combined with continuity, derivability) are expressible by formulae in a class for which sound and complete hierarchical proof methods for testing satisfiability of sets of ground clauses exist. The results are useful for automated reasoning in analysis and in the verification of hybrid systems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sofronie-Stokkermans, V. (2008). Efficient hierarchical reasoning about functions over numerical domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5243 LNAI, pp. 135–143). https://doi.org/10.1007/978-3-540-85845-4_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
