CAL, a theoretical background of constraint logic programming and its applications:
Gespeichert in:
Bibliographische Detailangaben
Beteiligte Personen: Sakai, Ko (VerfasserIn), Aiba, Akira (VerfasserIn)
Format: Buch
Sprache:Englisch
Veröffentlicht: Tokyo, Japan 1990
Ausgabe:(Rev.)
Schriftenreihe:Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 537
Schlagwörter:
Abstract:Abstract: "Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly non-linear) polynomial equations can be written as constraints, while almost all the other CLP languages proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework."
Umfang:14 S.
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik, Berichte

Bestandsangaben von Teilbibliothek Mathematik &amp; Informatik, Berichte
Signatur: 0111 2001 B 6123-537
Lageplan
Exemplar 1 Ausleihbar Am Standort