التفاصيل البيبلوغرافية
| العنوان: |
Extending Prolog with Constraint Arithmetic on Real Intervals |
| المؤلفون: |
William Older, André Vellino |
| المساهمون: |
The Pennsylvania State University CiteSeerX Archives |
| المصدر: |
ftp://ftp.cs.unh.edu/pub/csp/archive/papers/nato/BNR-IEEE90.ps.Z |
| بيانات النشر: |
Society Press |
| سنة النشر: |
1990 |
| المجموعة: |
CiteSeerX |
| الوصف: |
Prolog can be extended by a system of constraints on closed intervals to perform declarative relational arithmetic. Imposing constraints on an interval can narrow its range and propagate the narrowing to other intervals related to it by constraint equations or inequalities. Relational interval arithmetic can be used to contain floating point errors and, when combined with Prolog backtracking, to obtain numeric solutions to linear and non-linear rational constraint satisfaction problems over the reals (e.g. n-degree polynomial equations). This technique differs from other constraint logic programming (CLP) systems like CLP(!) or Prolog-III in that it does not do any symbolic processing. 1 Introduction In most programming languages arithmetic operations are performed by a functional evaluation mechanism. This is also true for logic programming languages such as Prolog even though such mechanisms are ill-suited to its generally relational nature. Arithmetic in Prolog is essentially no d. |
| نوع الوثيقة: |
text |
| وصف الملف: |
application/postscript |
| اللغة: |
English |
| Relation: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7295 |
| الاتاحة: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7295 |
| Rights: |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: |
edsbas.6D54CB77 |
| قاعدة البيانات: |
BASE |