English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Book Chapter

Solving numerical constraints

MPS-Authors
/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, 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
Citation

Bockmayr, A., & Weispfenning, V. (2001). Solving numerical constraints. In A. Robinson, & A. Voronkov (Eds.), Handbook of Automated Reasoning (pp. 751-842). Amsterdam, the Netherlands: Elsevier.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3243-E
Abstract
In \cite{BockmayrWeispfenning01}, we give an overview of solving numerical constraints in the context of automated reasoning. Emphasis is on logical aspects of numerical constraints. We view them as atomic formulae in first-order predicate logic that are interpreted over some numerical domain like the real, rational, or integer numbers. We present various inference systems for reasoning with numerical constraints, describe the algebraic and geometric structure of their solution set, and present fundamental algorithms for deciding satisfiability, computing one or all solutions, and deducing new constraints.