Automating the construction of efficient artificial intelligence algorithms
Abstract: "The scaling up of Artificial Intelligence (AI) systems to large real-world applications requires the use of efficient underlying AI algorithms and methods. Such efficiency, however, comes at a price: the increased conceptual and implementational complexity of developing, maintaining,...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, Pa.
School of Computer Science
1991
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1991,176 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006149274 | ||
| 003 | DE-604 | ||
| 005 | 19940616 | ||
| 007 | t| | ||
| 008 | 930107s1991 xx d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)26757632 | ||
| 035 | |a (DE-599)BVBBV006149274 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 91-176 | |
| 084 | |a DAT 539d |2 stub | ||
| 084 | |a DAT 704d |2 stub | ||
| 088 | |a CMU CS 91 176 | ||
| 100 | 1 | |a Perlin, Mark W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automating the construction of efficient artificial intelligence algorithms |c Mark W. Perlin |
| 246 | 1 | 3 | |a CMU CS 91 176 |
| 264 | 1 | |a Pittsburgh, Pa. |b School of Computer Science |c 1991 | |
| 300 | |a XV, 245 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 1991,176 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss., 1991 | ||
| 520 | 3 | |a Abstract: "The scaling up of Artificial Intelligence (AI) systems to large real-world applications requires the use of efficient underlying AI algorithms and methods. Such efficiency, however, comes at a price: the increased conceptual and implementational complexity of developing, maintaining, and refining these efficient algorithms. What is needed is a medium for rapid specification, and a mechanism for then automatically constructing efficient AI algorithms from such specifications. Recursion is an elegant and intuitive medium for algorithm specification. Standard recursive evaluation, however, may be very inefficient | |
| 520 | 3 | |a Call-Graph Caching (CGC) is the preservation of the control flow of a computational process into a graph; subsequent reuse of this graph can often result in highly efficient evaluation. Our thesis is that a large number of efficient AI algorithms can be decomposed into a conceptually transparent recursive specification, and an implementationally efficient CGC-based evaluation. This decomposition enables an AI algorithm to be rapidly specified, and then efficiently executed. In this thesis, we introduce Call-Graph Caching. We show how to use CGC to automatically construct a variety of important efficient AI algorithms, including RETE matching, Earley and Tomita parsing, linear unification, arc consistency, classical planning, and learning algorithms | |
| 520 | 3 | |a We describe MatchBox and Linear MatchBox, new algorithms for incremental conjunctive match. We present CACHE, a development environment for automatically constructing and visualizing CGC-based computation. CGC evaluation transforms search into knowledge, and represents an important first step toward a unified theory of AI computation. | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Object-oriented programming (Computer science) | |
| 650 | 4 | |a Software engineering | |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatische Programmierung |0 (DE-588)4143702-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |D s |
| 689 | 0 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | 2 | |a Automatische Programmierung |0 (DE-588)4143702-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1991,176 |w (DE-604)BV006187264 |9 1991,176 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-003888400 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0011 CMU CS 91 176 |
|---|---|
| DE-BY-TUM_katkey | 577405 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | TEMP1997808 |
| _version_ | 1820891725186465792 |
| any_adam_object | |
| author | Perlin, Mark W. |
| author_facet | Perlin, Mark W. |
| author_role | aut |
| author_sort | Perlin, Mark W. |
| author_variant | m w p mw mwp |
| building | Verbundindex |
| bvnumber | BV006149274 |
| classification_tum | DAT 539d DAT 704d |
| ctrlnum | (OCoLC)26757632 (DE-599)BVBBV006149274 |
| 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>03604nam a2200517 cb4500</leader><controlfield tag="001">BV006149274</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940616 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930107s1991 xx d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26757632</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006149274</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 91-176</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 539d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 704d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 91 176</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Perlin, Mark W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automating the construction of efficient artificial intelligence algorithms</subfield><subfield code="c">Mark W. Perlin</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 91 176</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="b">School of Computer Science</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 245 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">1991,176</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Carnegie Mellon Univ., Diss., 1991</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The scaling up of Artificial Intelligence (AI) systems to large real-world applications requires the use of efficient underlying AI algorithms and methods. Such efficiency, however, comes at a price: the increased conceptual and implementational complexity of developing, maintaining, and refining these efficient algorithms. What is needed is a medium for rapid specification, and a mechanism for then automatically constructing efficient AI algorithms from such specifications. Recursion is an elegant and intuitive medium for algorithm specification. Standard recursive evaluation, however, may be very inefficient</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Call-Graph Caching (CGC) is the preservation of the control flow of a computational process into a graph; subsequent reuse of this graph can often result in highly efficient evaluation. Our thesis is that a large number of efficient AI algorithms can be decomposed into a conceptually transparent recursive specification, and an implementationally efficient CGC-based evaluation. This decomposition enables an AI algorithm to be rapidly specified, and then efficiently executed. In this thesis, we introduce Call-Graph Caching. We show how to use CGC to automatically construct a variety of important efficient AI algorithms, including RETE matching, Earley and Tomita parsing, linear unification, arc consistency, classical planning, and learning algorithms</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We describe MatchBox and Linear MatchBox, new algorithms for incremental conjunctive match. We present CACHE, a development environment for automatically constructing and visualizing CGC-based computation. CGC evaluation transforms search into knowledge, and represents an important first step toward a unified theory of AI computation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Object-oriented programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatische Programmierung</subfield><subfield code="0">(DE-588)4143702-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</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">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Automatische Programmierung</subfield><subfield code="0">(DE-588)4143702-0</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">1991,176</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1991,176</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003888400</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV006149274 |
| illustrated | Illustrated |
| indexdate | 2024-12-23T12:01:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003888400 |
| oclc_num | 26757632 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | XV, 245 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | School of Computer Science |
| record_format | marc |
| series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| spellingShingle | Perlin, Mark W. Automating the construction of efficient artificial intelligence algorithms School of Computer Science <Pittsburgh, Pa.>: CMU-CS Künstliche Intelligenz Artificial intelligence Object-oriented programming (Computer science) Software engineering Effizienter Algorithmus (DE-588)4125422-3 gnd Automatische Programmierung (DE-588)4143702-0 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
| subject_GND | (DE-588)4125422-3 (DE-588)4143702-0 (DE-588)4033447-8 (DE-588)4113937-9 |
| title | Automating the construction of efficient artificial intelligence algorithms |
| title_alt | CMU CS 91 176 |
| title_auth | Automating the construction of efficient artificial intelligence algorithms |
| title_exact_search | Automating the construction of efficient artificial intelligence algorithms |
| title_full | Automating the construction of efficient artificial intelligence algorithms Mark W. Perlin |
| title_fullStr | Automating the construction of efficient artificial intelligence algorithms Mark W. Perlin |
| title_full_unstemmed | Automating the construction of efficient artificial intelligence algorithms Mark W. Perlin |
| title_short | Automating the construction of efficient artificial intelligence algorithms |
| title_sort | automating the construction of efficient artificial intelligence algorithms |
| topic | Künstliche Intelligenz Artificial intelligence Object-oriented programming (Computer science) Software engineering Effizienter Algorithmus (DE-588)4125422-3 gnd Automatische Programmierung (DE-588)4143702-0 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
| topic_facet | Künstliche Intelligenz Artificial intelligence Object-oriented programming (Computer science) Software engineering Effizienter Algorithmus Automatische Programmierung Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT perlinmarkw automatingtheconstructionofefficientartificialintelligencealgorithms AT perlinmarkw cmucs91176 |