Eliminating combinatories from production match:
Abstract: "Eliminating combinatorics from the match in production systems (or rule-based systems) is important for various reasons like real-time performance, the utility issue in machine learning, parallel implementations and modeling human cognition. The goal of this thesis is to eliminate ma...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, Pa.
School of Computer Science, Carnegie Mellon Univ.
1991
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1991,150 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Eliminating combinatorics from the match in production systems (or rule-based systems) is important for various reasons like real-time performance, the utility issue in machine learning, parallel implementations and modeling human cognition. The goal of this thesis is to eliminate match combinatorics without sacrificing production system functionality. The thesis focuses on restricting expressiveness for achieving this goal. It explores a variety of approaches for restricting expressiveness in production systems, which engage in different trade-offs for eliminating match combinatorics. It uses Soar, an integrated problem- solving and learning system, as a vehicle in this investigation This investigation rules out several of the approaches, but it reveals two promising approaches that could form the basis of future production systems. |
| Beschreibung: | Zugl.: Pittsburgh, Pa., Univ., Diss., 1991 |
| Beschreibung: | IX, 174 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008398673 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 931203s1991 d||| m||| 00||| engod | ||
| 035 | |a (OCoLC)24129943 | ||
| 035 | |a (DE-599)BVBBV008398673 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 91-150 | |
| 088 | |a CMU CS 91 150 | ||
| 100 | 1 | |a Tambe, Milind |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Eliminating combinatories from production match |c Milind Tambe |
| 246 | 1 | 3 | |a CMU CS 91 150 |
| 264 | 1 | |a Pittsburgh, Pa. |b School of Computer Science, Carnegie Mellon Univ. |c 1991 | |
| 300 | |a IX, 174 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,150 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1991 | ||
| 520 | 3 | |a Abstract: "Eliminating combinatorics from the match in production systems (or rule-based systems) is important for various reasons like real-time performance, the utility issue in machine learning, parallel implementations and modeling human cognition. The goal of this thesis is to eliminate match combinatorics without sacrificing production system functionality. The thesis focuses on restricting expressiveness for achieving this goal. It explores a variety of approaches for restricting expressiveness in production systems, which engage in different trade-offs for eliminating match combinatorics. It uses Soar, an integrated problem- solving and learning system, as a vehicle in this investigation | |
| 520 | 3 | |a This investigation rules out several of the approaches, but it reveals two promising approaches that could form the basis of future production systems. | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Real-time data processing | |
| 650 | 4 | |a Rule-based programming | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1991,150 |w (DE-604)BV006187264 |9 1991,150 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005532941 | ||
Datensatz im Suchindex
| _version_ | 1804122766326104064 |
|---|---|
| any_adam_object | |
| author | Tambe, Milind |
| author_facet | Tambe, Milind |
| author_role | aut |
| author_sort | Tambe, Milind |
| author_variant | m t mt |
| building | Verbundindex |
| bvnumber | BV008398673 |
| ctrlnum | (OCoLC)24129943 (DE-599)BVBBV008398673 |
| 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 | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02174nam a2200397 cb4500</leader><controlfield tag="001">BV008398673</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931203s1991 d||| m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24129943</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008398673</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-150</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 91 150</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tambe, Milind</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Eliminating combinatories from production match</subfield><subfield code="c">Milind Tambe</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 91 150</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">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 174 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,150</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1991</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Eliminating combinatorics from the match in production systems (or rule-based systems) is important for various reasons like real-time performance, the utility issue in machine learning, parallel implementations and modeling human cognition. The goal of this thesis is to eliminate match combinatorics without sacrificing production system functionality. The thesis focuses on restricting expressiveness for achieving this goal. It explores a variety of approaches for restricting expressiveness in production systems, which engage in different trade-offs for eliminating match combinatorics. It uses Soar, an integrated problem- solving and learning system, as a vehicle in this investigation</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This investigation rules out several of the approaches, but it reveals two promising approaches that could form the basis of future production systems.</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">Real-time data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rule-based programming</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="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1991,150</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1991,150</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005532941</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV008398673 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:19:05Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005532941 |
| oclc_num | 24129943 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | IX, 174 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 | Tambe, Milind Verfasser aut Eliminating combinatories from production match Milind Tambe CMU CS 91 150 Pittsburgh, Pa. School of Computer Science, Carnegie Mellon Univ. 1991 IX, 174 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1991,150 Zugl.: Pittsburgh, Pa., Univ., Diss., 1991 Abstract: "Eliminating combinatorics from the match in production systems (or rule-based systems) is important for various reasons like real-time performance, the utility issue in machine learning, parallel implementations and modeling human cognition. The goal of this thesis is to eliminate match combinatorics without sacrificing production system functionality. The thesis focuses on restricting expressiveness for achieving this goal. It explores a variety of approaches for restricting expressiveness in production systems, which engage in different trade-offs for eliminating match combinatorics. It uses Soar, an integrated problem- solving and learning system, as a vehicle in this investigation This investigation rules out several of the approaches, but it reveals two promising approaches that could form the basis of future production systems. Künstliche Intelligenz Artificial intelligence Real-time data processing Rule-based programming (DE-588)4113937-9 Hochschulschrift gnd-content School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1991,150 (DE-604)BV006187264 1991,150 |
| spellingShingle | Tambe, Milind Eliminating combinatories from production match School of Computer Science <Pittsburgh, Pa.>: CMU-CS Künstliche Intelligenz Artificial intelligence Real-time data processing Rule-based programming |
| subject_GND | (DE-588)4113937-9 |
| title | Eliminating combinatories from production match |
| title_alt | CMU CS 91 150 |
| title_auth | Eliminating combinatories from production match |
| title_exact_search | Eliminating combinatories from production match |
| title_full | Eliminating combinatories from production match Milind Tambe |
| title_fullStr | Eliminating combinatories from production match Milind Tambe |
| title_full_unstemmed | Eliminating combinatories from production match Milind Tambe |
| title_short | Eliminating combinatories from production match |
| title_sort | eliminating combinatories from production match |
| topic | Künstliche Intelligenz Artificial intelligence Real-time data processing Rule-based programming |
| topic_facet | Künstliche Intelligenz Artificial intelligence Real-time data processing Rule-based programming Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT tambemilind eliminatingcombinatoriesfromproductionmatch AT tambemilind cmucs91150 |