Linear Polynomial Equations ℜ

  • Thom Frühwirth
  • Slim Abdennadher
Part of the Cognitive Technologies book series (COGTECH)

Abstract

One motivation for introducing constraints in the LP language Prolog was the non-declarative nature of the built-in predicates for arithmetic computations. Therefore, the first CLP languages included constraint solvers for linear polynomial equations and inequations over the real numbers (CLP(ℜ) [33]) or rational numbers (Prolog-III [15], CHIP [20]).

Keywords

Prefix Decid 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Thom Frühwirth
    • 1
  • Slim Abdennadher
    • 2
  1. 1.Fakultät für InformatikUniversität UlmUlmGermany
  2. 2.Institut für InformatikUniversität MünchenMünchenGermany

Personalised recommendations