Efficient Solving of Quantified Inequality Constraints over the Real Numbers
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2002
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908599801872384 |
|---|---|
| author | Ratschan, Stefan |
| author_facet | Ratschan, Stefan |
| contents | Let a quantified inequality constraint over the reals be a formula in the first-order predicate language over the structure of the real numbers, where the allowed predicate symbols are $\leq$ and $<$. Solving such constraints is an undecidable problem when allowing function symbols such $\sin$ or $\cos$. In the paper we give an algorithm that terminates with a solution for all, except for very special, pathological inputs. We ensure the practical efficiency of this algorithm by employing constraint programming techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0211016 |
| institution | arXiv |
| publishDate | 2002 |
| record_format | arxiv |
| spellingShingle | Efficient Solving of Quantified Inequality Constraints over the Real Numbers Ratschan, Stefan Logic in Computer Science Numerical Analysis F.4.1; G.1.0; I.2.3 Let a quantified inequality constraint over the reals be a formula in the first-order predicate language over the structure of the real numbers, where the allowed predicate symbols are $\leq$ and $<$. Solving such constraints is an undecidable problem when allowing function symbols such $\sin$ or $\cos$. In the paper we give an algorithm that terminates with a solution for all, except for very special, pathological inputs. We ensure the practical efficiency of this algorithm by employing constraint programming techniques. |
| title | Efficient Solving of Quantified Inequality Constraints over the Real Numbers |
| topic | Logic in Computer Science Numerical Analysis F.4.1; G.1.0; I.2.3 |
| url | https://arxiv.org/abs/cs/0211016 |