Stefan Ratschan,
"Approximate Constraint Logic Programming"
, 1998, S. Ratschan: Approximate Constraint Logic Programming, Dissertation an der Johannes Kepler Universität Linz, 1998.
Original Titel:
Approximate Constraint Logic Programming
Sprache des Titels:
Englisch
Original Kurzfassung:
This thesis describes results that can be used to improve constraint logic programming (CLP) by increasing its expressivity and efficiency. This is done by introducing
# approximate answers and
# approximate quantifiers
into constraint logic programming and providing a computer implementation of a CLP system using these inprovements.
For reaching this goal, work has been done in the following main areas, corresponding to the three parts of the term "constraint logic programming":
Logic:
An extension of the first-order predicate language, defining the notions of "approximate solution set" and "approximate quantifier" has been introduced.
Programming (Language Design and Implementation):
The syntax and semantics of a new constraint logic programming language allowing first-order constraints with approximate quantifiers and approximate answers has been defined and implemented.
Constraint (Solving):
A new algorithm for approximately solving first-order constraints with approximate quantifiers has been devised. The algorithm has been implemented over the domain of the real numbers.
Sprache der Kurzfassung:
Deutsch
Erscheinungsjahr:
1998
Notiz zum Zitat:
S. Ratschan: Approximate Constraint Logic Programming, Dissertation an der Johannes Kepler Universität Linz, 1998.