Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Efficient hierarchical reasoning about functions over numerical domains


Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Sofronie-Stokkermans, V. (2008). Efficient hierarchical reasoning about functions over numerical domains. In A. R. Dengel, K. Berns, T. M. Breuel, F. Bomarius, & T. R. Roth-Berghofer (Eds.), KI 2008: Advances in Artificial Intelligence: 31st Annual German Conference on AI, KI 2008 (pp. 135-143). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1B79-3
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inverse or Lipschitz properties, possibly combined with continuity and/or derivability) are expressible as axioms in a class for which sound and complete hierarchical proof methods for testing satisfiability of ground formulae exist. The results are useful for automated reasoning in analysis, and in the verification of hybrid systems.