Reasoning with limited unification in a connectionist rule based system:
Abstract: "At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1995
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
731 |
| Subjects: | |
| Summary: | Abstract: "At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, they may be capable of very fast, 'reactive' responses to external stimuli. A major open question in this field is the extent to which a connectionist architecture can accommodate basic concepts of symbolic inference, such as unification of terms. One of the current leaders in this area is the rule-based system proposed by Shastri & Ajjanagadde (1993). We demonstrate that the mechanism for variable binding which they advocate is fundamentally limited and show how a reinterpretation of the primitive components of their system can extend the range of inference which can be supported." |
| Physical Description: | 11 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011043445 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961107s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)37017382 | ||
| 035 | |a (DE-599)BVBBV011043445 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Park, Nam Seog |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reasoning with limited unification in a connectionist rule based system |c Park, N. S. ; Robertson, D. ; Stenning, K. |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 11 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 731 | |
| 520 | 3 | |a Abstract: "At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, they may be capable of very fast, 'reactive' responses to external stimuli. A major open question in this field is the extent to which a connectionist architecture can accommodate basic concepts of symbolic inference, such as unification of terms. One of the current leaders in this area is the rule-based system proposed by Shastri & Ajjanagadde (1993). We demonstrate that the mechanism for variable binding which they advocate is fundamentally limited and show how a reinterpretation of the primitive components of their system can extend the range of inference which can be supported." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Rule-based programming | |
| 700 | 1 | |a Robertson, Dave |e Verfasser |4 aut | |
| 700 | 1 | |a Stenning, Keith |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 731 |w (DE-604)BV010450646 |9 731 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007394758 | ||
Record in the Search Index
| _version_ | 1804125532708667392 |
|---|---|
| any_adam_object | |
| author | Park, Nam Seog Robertson, Dave Stenning, Keith |
| author_facet | Park, Nam Seog Robertson, Dave Stenning, Keith |
| author_role | aut aut aut |
| author_sort | Park, Nam Seog |
| author_variant | n s p ns nsp d r dr k s ks |
| building | Verbundindex |
| bvnumber | BV011043445 |
| ctrlnum | (OCoLC)37017382 (DE-599)BVBBV011043445 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02180nam a2200373 cb4500</leader><controlfield tag="001">BV011043445</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961107s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37017382</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011043445</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Park, Nam Seog</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reasoning with limited unification in a connectionist rule based system</subfield><subfield code="c">Park, N. S. ; Robertson, D. ; Stenning, K.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 S.</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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">731</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, they may be capable of very fast, 'reactive' responses to external stimuli. A major open question in this field is the extent to which a connectionist architecture can accommodate basic concepts of symbolic inference, such as unification of terms. One of the current leaders in this area is the rule-based system proposed by Shastri & Ajjanagadde (1993). We demonstrate that the mechanism for variable binding which they advocate is fundamentally limited and show how a reinterpretation of the primitive components of their system can extend the range of inference which can be supported."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</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">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rule-based programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Robertson, Dave</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stenning, Keith</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">731</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">731</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007394758</subfield></datafield></record></collection> |
| id | DE-604.BV011043445 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007394758 |
| oclc_num | 37017382 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Park, Nam Seog Verfasser aut Reasoning with limited unification in a connectionist rule based system Park, N. S. ; Robertson, D. ; Stenning, K. Edinburgh 1995 11 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 731 Abstract: "At the intersection between symbolic inference and connectionism, there is interest in producing systems constructed from connectionist components which perform types of inference comparable to symbolic systems. The attraction of such systems is that, under restricted conditions, they may be capable of very fast, 'reactive' responses to external stimuli. A major open question in this field is the extent to which a connectionist architecture can accommodate basic concepts of symbolic inference, such as unification of terms. One of the current leaders in this area is the rule-based system proposed by Shastri & Ajjanagadde (1993). We demonstrate that the mechanism for variable binding which they advocate is fundamentally limited and show how a reinterpretation of the primitive components of their system can extend the range of inference which can be supported." Bionics and artificial intelligence sigle Computer software sigle Künstliche Intelligenz Artificial intelligence Automatic theorem proving Rule-based programming Robertson, Dave Verfasser aut Stenning, Keith Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 731 (DE-604)BV010450646 731 |
| spellingShingle | Park, Nam Seog Robertson, Dave Stenning, Keith Reasoning with limited unification in a connectionist rule based system Bionics and artificial intelligence sigle Computer software sigle Künstliche Intelligenz Artificial intelligence Automatic theorem proving Rule-based programming |
| title | Reasoning with limited unification in a connectionist rule based system |
| title_auth | Reasoning with limited unification in a connectionist rule based system |
| title_exact_search | Reasoning with limited unification in a connectionist rule based system |
| title_full | Reasoning with limited unification in a connectionist rule based system Park, N. S. ; Robertson, D. ; Stenning, K. |
| title_fullStr | Reasoning with limited unification in a connectionist rule based system Park, N. S. ; Robertson, D. ; Stenning, K. |
| title_full_unstemmed | Reasoning with limited unification in a connectionist rule based system Park, N. S. ; Robertson, D. ; Stenning, K. |
| title_short | Reasoning with limited unification in a connectionist rule based system |
| title_sort | reasoning with limited unification in a connectionist rule based system |
| topic | Bionics and artificial intelligence sigle Computer software sigle Künstliche Intelligenz Artificial intelligence Automatic theorem proving Rule-based programming |
| topic_facet | Bionics and artificial intelligence Computer software Künstliche Intelligenz Artificial intelligence Automatic theorem proving Rule-based programming |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT parknamseog reasoningwithlimitedunificationinaconnectionistrulebasedsystem AT robertsondave reasoningwithlimitedunificationinaconnectionistrulebasedsystem AT stenningkeith reasoningwithlimitedunificationinaconnectionistrulebasedsystem |