Design and implementation of practical constraint logic programming systems:
Abstract: "The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule-based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, PA
School of Computer Science, Carnegie Mellon Univ.
1992
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1992,168 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule-based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be amenable to practical implementations. This thesis describes a systematic approach to the design and implementation of practical CLP systems. The approach is evaluated with respect to two major objectives. First, the Prolog subset of the languages must be executed with essentially the efficiency of an equivalent Prolog system Second, the cost of constraint solving must be commensurate with the complexity of the constraints arising. The language CLP(R), whose domain is uninterpreted functors over real numbers, is the central case study. First, the design of CLP(R) is discussed in relation to programming methodology. The discussion of implementation begins with an interpreter that achieves the efficiency of equivalent Prolog interpreters, and meets many of the basic efficiency requirements for constraint solving. Many of the principles applied in the interpreter are then used to develop an abstract machine for CLP(R), leading to a compiler-based system achieving performance comparable to modern Prolog compilers Furthermore, it is shown how this technology can be extended so that the efficiency of CLP(R) approaches that of imperative programming languages. Finally, to demonstrate the wider applicability of the techniques developed, it is shown how they can be used to design and implement a version of Elf, a language with equality constraints over [lambda]-expressions with dependent types. |
| Beschreibung: | Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 |
| Beschreibung: | XIV, 228 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010171516 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950509s1992 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)27551637 | ||
| 035 | |a (DE-599)BVBBV010171516 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 92-168 | |
| 084 | |a DAT 706d |2 stub | ||
| 088 | |a CMU CS 92 168 | ||
| 100 | 1 | |a Michaylov, Spiro |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Design and implementation of practical constraint logic programming systems |c Spiro Michaylov |
| 246 | 1 | 3 | |a CMU CS 92 168 |
| 264 | 1 | |a Pittsburgh, PA |b School of Computer Science, Carnegie Mellon Univ. |c 1992 | |
| 300 | |a XIV, 228 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,168 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule-based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be amenable to practical implementations. This thesis describes a systematic approach to the design and implementation of practical CLP systems. The approach is evaluated with respect to two major objectives. First, the Prolog subset of the languages must be executed with essentially the efficiency of an equivalent Prolog system | |
| 520 | 3 | |a Second, the cost of constraint solving must be commensurate with the complexity of the constraints arising. The language CLP(R), whose domain is uninterpreted functors over real numbers, is the central case study. First, the design of CLP(R) is discussed in relation to programming methodology. The discussion of implementation begins with an interpreter that achieves the efficiency of equivalent Prolog interpreters, and meets many of the basic efficiency requirements for constraint solving. Many of the principles applied in the interpreter are then used to develop an abstract machine for CLP(R), leading to a compiler-based system achieving performance comparable to modern Prolog compilers | |
| 520 | 3 | |a Furthermore, it is shown how this technology can be extended so that the efficiency of CLP(R) approaches that of imperative programming languages. Finally, to demonstrate the wider applicability of the techniques developed, it is shown how they can be used to design and implement a version of Elf, a language with equality constraints over [lambda]-expressions with dependent types. | |
| 650 | 4 | |a Logic programming | |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1992,168 |w (DE-604)BV006187264 |9 1992,168 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006755951 | ||
Datensatz im Suchindex
| _version_ | 1804124568703467520 |
|---|---|
| any_adam_object | |
| author | Michaylov, Spiro |
| author_facet | Michaylov, Spiro |
| author_role | aut |
| author_sort | Michaylov, Spiro |
| author_variant | s m sm |
| building | Verbundindex |
| bvnumber | BV010171516 |
| classification_tum | DAT 706d |
| ctrlnum | (OCoLC)27551637 (DE-599)BVBBV010171516 |
| dewey-full | 510.7808 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7808 |
| dewey-search | 510.7808 |
| dewey-sort | 3510.7808 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03246nam a2200421 cb4500</leader><controlfield tag="001">BV010171516</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950509s1992 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27551637</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010171516</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 92-168</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 92 168</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Michaylov, Spiro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design and implementation of practical constraint logic programming systems</subfield><subfield code="c">Spiro Michaylov</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 92 168</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, PA</subfield><subfield code="b">School of Computer Science, Carnegie Mellon Univ.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 228 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,168</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule-based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be amenable to practical implementations. This thesis describes a systematic approach to the design and implementation of practical CLP systems. The approach is evaluated with respect to two major objectives. First, the Prolog subset of the languages must be executed with essentially the efficiency of an equivalent Prolog system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Second, the cost of constraint solving must be commensurate with the complexity of the constraints arising. The language CLP(R), whose domain is uninterpreted functors over real numbers, is the central case study. First, the design of CLP(R) is discussed in relation to programming methodology. The discussion of implementation begins with an interpreter that achieves the efficiency of equivalent Prolog interpreters, and meets many of the basic efficiency requirements for constraint solving. Many of the principles applied in the interpreter are then used to develop an abstract machine for CLP(R), leading to a compiler-based system achieving performance comparable to modern Prolog compilers</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Furthermore, it is shown how this technology can be extended so that the efficiency of CLP(R) approaches that of imperative programming languages. Finally, to demonstrate the wider applicability of the techniques developed, it is shown how they can be used to design and implement a version of Elf, a language with equality constraints over [lambda]-expressions with dependent types.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1992,168</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1992,168</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006755951</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010171516 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:47:44Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006755951 |
| oclc_num | 27551637 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | XIV, 228 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | School of Computer Science, Carnegie Mellon Univ. |
| record_format | marc |
| series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| spelling | Michaylov, Spiro Verfasser aut Design and implementation of practical constraint logic programming systems Spiro Michaylov CMU CS 92 168 Pittsburgh, PA School of Computer Science, Carnegie Mellon Univ. 1992 XIV, 228 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,168 Zugl.: Pittsburgh, Pa., Univ., Diss., 1992 Abstract: "The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule-based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be amenable to practical implementations. This thesis describes a systematic approach to the design and implementation of practical CLP systems. The approach is evaluated with respect to two major objectives. First, the Prolog subset of the languages must be executed with essentially the efficiency of an equivalent Prolog system Second, the cost of constraint solving must be commensurate with the complexity of the constraints arising. The language CLP(R), whose domain is uninterpreted functors over real numbers, is the central case study. First, the design of CLP(R) is discussed in relation to programming methodology. The discussion of implementation begins with an interpreter that achieves the efficiency of equivalent Prolog interpreters, and meets many of the basic efficiency requirements for constraint solving. Many of the principles applied in the interpreter are then used to develop an abstract machine for CLP(R), leading to a compiler-based system achieving performance comparable to modern Prolog compilers Furthermore, it is shown how this technology can be extended so that the efficiency of CLP(R) approaches that of imperative programming languages. Finally, to demonstrate the wider applicability of the techniques developed, it is shown how they can be used to design and implement a version of Elf, a language with equality constraints over [lambda]-expressions with dependent types. Logic programming Logische Programmierung (DE-588)4195096-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Logische Programmierung (DE-588)4195096-3 s DE-604 School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1992,168 (DE-604)BV006187264 1992,168 |
| spellingShingle | Michaylov, Spiro Design and implementation of practical constraint logic programming systems School of Computer Science <Pittsburgh, Pa.>: CMU-CS Logic programming Logische Programmierung (DE-588)4195096-3 gnd |
| subject_GND | (DE-588)4195096-3 (DE-588)4113937-9 |
| title | Design and implementation of practical constraint logic programming systems |
| title_alt | CMU CS 92 168 |
| title_auth | Design and implementation of practical constraint logic programming systems |
| title_exact_search | Design and implementation of practical constraint logic programming systems |
| title_full | Design and implementation of practical constraint logic programming systems Spiro Michaylov |
| title_fullStr | Design and implementation of practical constraint logic programming systems Spiro Michaylov |
| title_full_unstemmed | Design and implementation of practical constraint logic programming systems Spiro Michaylov |
| title_short | Design and implementation of practical constraint logic programming systems |
| title_sort | design and implementation of practical constraint logic programming systems |
| topic | Logic programming Logische Programmierung (DE-588)4195096-3 gnd |
| topic_facet | Logic programming Logische Programmierung Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT michaylovspiro designandimplementationofpracticalconstraintlogicprogrammingsystems AT michaylovspiro cmucs92168 |