Abstract
Having dealt with Boolean combinations of linear arithmetic constraints in the previous chapter, we now address the problem of solving Boolean combinations of nonlinear arithmetic constraints which may contain transcendental functions, like sine, cosine, and the exponential function. This gives rise to a plethora of problems, in particular (a) how to efficiently and sufficiently completely solve conjunctive combinations of constraints in the undecidable domain of nonlinear constraints involving transcendental functions and (b) how to efficiently maneuver the large search spaces arising from the potentially rich Boolean structure of the overall formula.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH
About this chapter
Cite this chapter
Herde, C. (2011). Integration of DPLL and Interval Constraint Solving. In: Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9949-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-8348-9949-1_5
Publisher Name: Vieweg+Teubner
Print ISBN: 978-3-8348-1494-4
Online ISBN: 978-3-8348-9949-1
eBook Packages: Computer ScienceComputer Science (R0)