Analysis of Nonlinear Constraints in CLP(R)

Hanus, Michael

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Analysis of Nonlinear Constraints in CLP(R)

MPS-Authors

/persons/resource/persons44582

Hanus, Michael
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Hanus, M. (1993). Analysis of Nonlinear Constraints in CLP(R). In D. S., Warren (Ed.), Proceedings of the 10th International Conference on Logic Programming (ICLP '93) (pp. 83-99). Cambridge, USA: MIT Press.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ADDB-2

要旨

Solving nonlinear constraints over real numbers is a complex problem. Hence
constraint logic programming languages like CLP($\cal R$) or Prolog III solve
only linear constraints and delay nonlinear constraints until they become
linear. This efficient implementation method has the disadvantage that
sometimes computed answers are unsatisfiable or infinite loops occur due to the
unsatisfiability of delayed nonlinear constraints. These problems could be
solved by using a more powerful constraint solver which can deal with nonlinear
constraints like in RISC-CLP(Real). Since such powerful constraint solvers are
not very efficient, we propose a compromise between these two extremes. We
characterize a class of CLP($\cal R$) programs for which all delayed nonlinear
constraints become linear at run time. Programs belonging to this class can be
safely executed with the efficient CLP($\cal R$) method while the remaining
programs need a more powerful constraint solver.