b'@inproceedings{Sofronie-Stokkermans-ki2008,'b'\nTITLE = {Efficient hierarchical reasoning about functions over numerical domains},\nAUTHOR = {Sofronie-Stokkermans, Viorica},\nLANGUAGE = {eng},\nISBN = {978-3-540-85844-7},\nURL = {http://dx.doi.org/10.1007/978-3-540-85845-4_17},\nDOI = {10.1007/978-3-540-85845-4_17},\nLOCALID = {Local-ID: C125756E0038A185-81A568586689C255C125745D004491D9-Sofronie-Stokkermans-ki2008},\nPUBLISHER = {Springer},\nYEAR = {2008},\nDATE = {2008},\nABSTRACT = {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.},\nBOOKTITLE = {KI 2008: Advances in Artificial Intelligence : 31st Annual German Conference on AI, KI 2008},\nEDITOR = {Dengel, Andreas R. and Berns, Karsten and Breuel, Thomas M. and Bomarius, Frank and Roth-Berghofer, Thomas R.},\nPAGES = {135--143},\nSERIES = {Lecture Notes in Artificial Intelligence},\n}\n'