Efficient Hierarchical Reasoning about Functions over Numerical Domains

Sofronie-Stokkermans, Viorica

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Efficient Hierarchical Reasoning about Functions over Numerical Domains

MPS-Authors

/persons/resource/persons45516

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

External Resource

http://www.avacs.org/fileadmin/Publikationen/Open/avacs_technical_report_045.pdf
(Any fulltext)

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

Citation

Sofronie-Stokkermans, V.(2008). Efficient Hierarchical Reasoning about Functions over Numerical Domains (ATR45). SFB/TR 14 AVACS.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0027-A46C-B

Abstract

We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, Lipschitz properties, possibly combined with continuity or 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 mathematical analysis and for the verification of hybrid systems.