Efficient Hierarchical Reasoning about Functions over Numerical Domains

  • Authors:
  • Viorica Sofronie-Stokkermans

  • Affiliations:
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany D-66123

  • Venue:
  • KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.