Efficient reasoning
Many tasks require "reasoning"--i.e., deriving conclusions from a corpus of explicitly stored information--to solve their range of problems. An ideal reasoning system would produce all-and-only the correct answers to every possible query, produce answers that are as specific as possible, b...
Gespeichert in:
| Veröffentlicht in: | ACM computing surveys 2001-03, Vol.33 (1), p.1-30 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 30 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | ACM computing surveys |
| container_volume | 33 |
| creator | GREINER, Russell DARKEN, Christian SANTOSO, N. Iwan |
| description | Many tasks require "reasoning"--i.e., deriving conclusions from a corpus of explicitly stored information--to solve their range of problems. An ideal reasoning system would produce all-and-only the correct answers to every possible query, produce answers that are as specific as possible, be expressive enough to permit any possible fact to be stored and any possible query to be asked, and be (time) efficient. Unfortunately, this is provably impossible: as correct and precise systems become more expressive, they can become increasingly inefficient, or even undecidable. This survey first formalizes these hardness results, in the context of both logic- and probability-based reasoning, then overviews the techniques now used to address, or at least side-step, this dilemma. |
| doi_str_mv | 10.1145/375360.375363 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_28918902</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A75950730</galeid><sourcerecordid>A75950730</sourcerecordid><originalsourceid>FETCH-LOGICAL-c424t-38615e0f385218a24b6213c73b221f1457e0bca851db4ec9250938d79f3afe7c3</originalsourceid><addsrcrecordid>eNp90U1LAzEQBuAgCtbqSbyLiCe3Tr42ybGU-gEFL3oO2TQpKdtsTbYH_72pLVhEJIcXkifDDIPQFYYRxow_UMFpDaPvoEdogDkXlaAMH6MBlJcKKMApOst5CQCE4XqALqfeBxtc7K-TM7mLIS7O0Yk3bXYX-xyi98fp2-S5mr0-vUzGs8oywvqKyhpzB55KTrA0hDU1wdQK2hCCfWlIOGiskRzPG-asIhwUlXOhPDXeCUuH6G5Xd526j43LvV6FbF3bmui6TdZEKiwVkAJvfsFlt0mx9Kax4lgyAvIHLUzrdIi-65Ox24p6LLjiICgUdP8HWrjokmm76Hwo14e8-oOXM3erYP_xNnU5J-f1OoWVSZ8ag97uSO92tAta_O1-MJOtaX0y0YZ88IkTBYx-AW7Sip4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195184208</pqid></control><display><type>article</type><title>Efficient reasoning</title><source>ACM Digital Library Complete</source><creator>GREINER, Russell ; DARKEN, Christian ; SANTOSO, N. Iwan</creator><creatorcontrib>GREINER, Russell ; DARKEN, Christian ; SANTOSO, N. Iwan</creatorcontrib><description>Many tasks require "reasoning"--i.e., deriving conclusions from a corpus of explicitly stored information--to solve their range of problems. An ideal reasoning system would produce all-and-only the correct answers to every possible query, produce answers that are as specific as possible, be expressive enough to permit any possible fact to be stored and any possible query to be asked, and be (time) efficient. Unfortunately, this is provably impossible: as correct and precise systems become more expressive, they can become increasingly inefficient, or even undecidable. This survey first formalizes these hardness results, in the context of both logic- and probability-based reasoning, then overviews the techniques now used to address, or at least side-step, this dilemma.</description><identifier>ISSN: 0360-0300</identifier><identifier>EISSN: 1557-7341</identifier><identifier>DOI: 10.1145/375360.375363</identifier><identifier>CODEN: CMSVAN</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Artificial intelligence ; Computer programming ; Computer science; control theory; systems ; Efficiency ; Exact sciences and technology ; Information management ; Knowledge-based systems ; Learning and adaptive systems ; Logic ; Management ; Reasoning ; Studies ; System design ; Systems analysis ; Theoretical computing</subject><ispartof>ACM computing surveys, 2001-03, Vol.33 (1), p.1-30</ispartof><rights>2001 INIST-CNRS</rights><rights>COPYRIGHT 2001 Association for Computing Machinery, Inc.</rights><rights>Copyright Association for Computing Machinery Mar 2001</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c424t-38615e0f385218a24b6213c73b221f1457e0bca851db4ec9250938d79f3afe7c3</citedby><cites>FETCH-LOGICAL-c424t-38615e0f385218a24b6213c73b221f1457e0bca851db4ec9250938d79f3afe7c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1052904$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>GREINER, Russell</creatorcontrib><creatorcontrib>DARKEN, Christian</creatorcontrib><creatorcontrib>SANTOSO, N. Iwan</creatorcontrib><title>Efficient reasoning</title><title>ACM computing surveys</title><description>Many tasks require "reasoning"--i.e., deriving conclusions from a corpus of explicitly stored information--to solve their range of problems. An ideal reasoning system would produce all-and-only the correct answers to every possible query, produce answers that are as specific as possible, be expressive enough to permit any possible fact to be stored and any possible query to be asked, and be (time) efficient. Unfortunately, this is provably impossible: as correct and precise systems become more expressive, they can become increasingly inefficient, or even undecidable. This survey first formalizes these hardness results, in the context of both logic- and probability-based reasoning, then overviews the techniques now used to address, or at least side-step, this dilemma.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer programming</subject><subject>Computer science; control theory; systems</subject><subject>Efficiency</subject><subject>Exact sciences and technology</subject><subject>Information management</subject><subject>Knowledge-based systems</subject><subject>Learning and adaptive systems</subject><subject>Logic</subject><subject>Management</subject><subject>Reasoning</subject><subject>Studies</subject><subject>System design</subject><subject>Systems analysis</subject><subject>Theoretical computing</subject><issn>0360-0300</issn><issn>1557-7341</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNp90U1LAzEQBuAgCtbqSbyLiCe3Tr42ybGU-gEFL3oO2TQpKdtsTbYH_72pLVhEJIcXkifDDIPQFYYRxow_UMFpDaPvoEdogDkXlaAMH6MBlJcKKMApOst5CQCE4XqALqfeBxtc7K-TM7mLIS7O0Yk3bXYX-xyi98fp2-S5mr0-vUzGs8oywvqKyhpzB55KTrA0hDU1wdQK2hCCfWlIOGiskRzPG-asIhwUlXOhPDXeCUuH6G5Xd526j43LvV6FbF3bmui6TdZEKiwVkAJvfsFlt0mx9Kax4lgyAvIHLUzrdIi-65Ox24p6LLjiICgUdP8HWrjokmm76Hwo14e8-oOXM3erYP_xNnU5J-f1OoWVSZ8ag97uSO92tAta_O1-MJOtaX0y0YZ88IkTBYx-AW7Sip4</recordid><startdate>20010301</startdate><enddate>20010301</enddate><creator>GREINER, Russell</creator><creator>DARKEN, Christian</creator><creator>SANTOSO, N. Iwan</creator><general>Association for Computing Machinery</general><general>Association for Computing Machinery, Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20010301</creationdate><title>Efficient reasoning</title><author>GREINER, Russell ; DARKEN, Christian ; SANTOSO, N. Iwan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c424t-38615e0f385218a24b6213c73b221f1457e0bca851db4ec9250938d79f3afe7c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer programming</topic><topic>Computer science; control theory; systems</topic><topic>Efficiency</topic><topic>Exact sciences and technology</topic><topic>Information management</topic><topic>Knowledge-based systems</topic><topic>Learning and adaptive systems</topic><topic>Logic</topic><topic>Management</topic><topic>Reasoning</topic><topic>Studies</topic><topic>System design</topic><topic>Systems analysis</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GREINER, Russell</creatorcontrib><creatorcontrib>DARKEN, Christian</creatorcontrib><creatorcontrib>SANTOSO, N. Iwan</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM computing surveys</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GREINER, Russell</au><au>DARKEN, Christian</au><au>SANTOSO, N. Iwan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient reasoning</atitle><jtitle>ACM computing surveys</jtitle><date>2001-03-01</date><risdate>2001</risdate><volume>33</volume><issue>1</issue><spage>1</spage><epage>30</epage><pages>1-30</pages><issn>0360-0300</issn><eissn>1557-7341</eissn><coden>CMSVAN</coden><abstract>Many tasks require "reasoning"--i.e., deriving conclusions from a corpus of explicitly stored information--to solve their range of problems. An ideal reasoning system would produce all-and-only the correct answers to every possible query, produce answers that are as specific as possible, be expressive enough to permit any possible fact to be stored and any possible query to be asked, and be (time) efficient. Unfortunately, this is provably impossible: as correct and precise systems become more expressive, they can become increasingly inefficient, or even undecidable. This survey first formalizes these hardness results, in the context of both logic- and probability-based reasoning, then overviews the techniques now used to address, or at least side-step, this dilemma.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/375360.375363</doi><tpages>30</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-0300 |
| ispartof | ACM computing surveys, 2001-03, Vol.33 (1), p.1-30 |
| issn | 0360-0300 1557-7341 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28918902 |
| source | ACM Digital Library Complete |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Artificial intelligence Computer programming Computer science control theory systems Efficiency Exact sciences and technology Information management Knowledge-based systems Learning and adaptive systems Logic Management Reasoning Studies System design Systems analysis Theoretical computing |
| title | Efficient reasoning |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T19%3A55%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20reasoning&rft.jtitle=ACM%20computing%20surveys&rft.au=GREINER,%20Russell&rft.date=2001-03-01&rft.volume=33&rft.issue=1&rft.spage=1&rft.epage=30&rft.pages=1-30&rft.issn=0360-0300&rft.eissn=1557-7341&rft.coden=CMSVAN&rft_id=info:doi/10.1145/375360.375363&rft_dat=%3Cgale_proqu%3EA75950730%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195184208&rft_id=info:pmid/&rft_galeid=A75950730&rfr_iscdi=true |