English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Efficient Solving of Quantified Inequality Constraints over the Real Numbers

Ratschan, S. (2006). Efficient Solving of Quantified Inequality Constraints over the Real Numbers. ACM Transactions on Computational Logic, 7, 723-748.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ratschan, Stefan1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-262006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 314375
Other: Local-ID: C1256104005ECAFC-9674D6D775A64682C1256FA9005604DE-Ratschan2005a
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: ACM Transactions on Computational Logic
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 7 Sequence Number: - Start / End Page: 723 - 748 Identifier: -