Causes of Ineradicable Spurious Predictions in Qualitative Simulation
It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is used, there will always be input models which cause any simulator with a coverage guarantee to make spurious predictions in...
Gespeichert in:
Veröffentlicht in: | The Journal of artificial intelligence research 2006-01, Vol.27, p.551-575 |
---|---|
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 | 575 |
---|---|
container_issue | |
container_start_page | 551 |
container_title | The Journal of artificial intelligence research |
container_volume | 27 |
creator | Yilmaz, O. Say, A. C. Cem |
description | It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is used, there will always be input models which cause any simulator with a coverage guarantee to make spurious predictions in its output. In this paper, we examine whether a meaningfully expressive restriction of this vocabulary is possible so that one can build a simulator with both the soundness and completeness properties. We prove several negative results: All sound qualitative simulators, employing subsets of the QSIM representation which retain the operating region transition feature, and support at least the addition and constancy constraints, are shown to be inherently incomplete. Even when the simulations are restricted to run in a single operating region, a constraint vocabulary containing just the addition, constancy, derivative, and multiplication relations makes the construction of sound and complete qualitative simulators impossible. |
doi_str_mv | 10.1613/jair.2065 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2554120011</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2554120011</sourcerecordid><originalsourceid>FETCH-LOGICAL-c147t-9368996b04acd4f2bf41dbf33aad082919341e926312a5a6b885a8f55c26f72f3</originalsourceid><addsrcrecordid>eNpNkE1LxDAQhoMouK4e_AcFTx66ZvLV5ijLui4sqKjnMG0TSOm2a9II_ntb1oOnGeZ9mGEeQm6BrkABf2jRhxWjSp6RBdBC5bqQxfm__pJcxdhSClqwckE2a0zRxmxw2a63ARtfY9XZ7P2Ygh9SzF6DnWajH_qY-T57S9j5EUf_PTH-kDqco2ty4bCL9uavLsnn0-Zj_ZzvX7a79eM-r0EUY665KrVWFRVYN8KxygloKsc5YkNLpkFzAVYzxYGhRFWVpcTSSVkz5Qrm-JLcnfYew_CVbBxNO6TQTycNk1IAm_6Cibo_UXUYYgzWmWPwBww_BqiZLZnZkpkt8V9ftFoy</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2554120011</pqid></control><display><type>article</type><title>Causes of Ineradicable Spurious Predictions in Qualitative Simulation</title><source>DOAJ Directory of Open Access Journals</source><source>Free E-Journal (出版社公開部分のみ)</source><source>Open Access: Freely Accessible Journals by multiple vendors</source><creator>Yilmaz, O. ; Say, A. C. Cem</creator><creatorcontrib>Yilmaz, O. ; Say, A. C. Cem</creatorcontrib><description>It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is used, there will always be input models which cause any simulator with a coverage guarantee to make spurious predictions in its output. In this paper, we examine whether a meaningfully expressive restriction of this vocabulary is possible so that one can build a simulator with both the soundness and completeness properties. We prove several negative results: All sound qualitative simulators, employing subsets of the QSIM representation which retain the operating region transition feature, and support at least the addition and constancy constraints, are shown to be inherently incomplete. Even when the simulations are restricted to run in a single operating region, a constraint vocabulary containing just the addition, constancy, derivative, and multiplication relations makes the construction of sound and complete qualitative simulators impossible.</description><identifier>ISSN: 1076-9757</identifier><identifier>EISSN: 1076-9757</identifier><identifier>EISSN: 1943-5037</identifier><identifier>DOI: 10.1613/jair.2065</identifier><language>eng</language><publisher>San Francisco: AI Access Foundation</publisher><subject>Algorithms ; Artificial intelligence ; Multiplication ; Simulation ; Simulators ; Sound</subject><ispartof>The Journal of artificial intelligence research, 2006-01, Vol.27, p.551-575</ispartof><rights>2006. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,860,27901,27902</link.rule.ids></links><search><creatorcontrib>Yilmaz, O.</creatorcontrib><creatorcontrib>Say, A. C. Cem</creatorcontrib><title>Causes of Ineradicable Spurious Predictions in Qualitative Simulation</title><title>The Journal of artificial intelligence research</title><description>It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is used, there will always be input models which cause any simulator with a coverage guarantee to make spurious predictions in its output. In this paper, we examine whether a meaningfully expressive restriction of this vocabulary is possible so that one can build a simulator with both the soundness and completeness properties. We prove several negative results: All sound qualitative simulators, employing subsets of the QSIM representation which retain the operating region transition feature, and support at least the addition and constancy constraints, are shown to be inherently incomplete. Even when the simulations are restricted to run in a single operating region, a constraint vocabulary containing just the addition, constancy, derivative, and multiplication relations makes the construction of sound and complete qualitative simulators impossible.</description><subject>Algorithms</subject><subject>Artificial intelligence</subject><subject>Multiplication</subject><subject>Simulation</subject><subject>Simulators</subject><subject>Sound</subject><issn>1076-9757</issn><issn>1076-9757</issn><issn>1943-5037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpNkE1LxDAQhoMouK4e_AcFTx66ZvLV5ijLui4sqKjnMG0TSOm2a9II_ntb1oOnGeZ9mGEeQm6BrkABf2jRhxWjSp6RBdBC5bqQxfm__pJcxdhSClqwckE2a0zRxmxw2a63ARtfY9XZ7P2Ygh9SzF6DnWajH_qY-T57S9j5EUf_PTH-kDqco2ty4bCL9uavLsnn0-Zj_ZzvX7a79eM-r0EUY665KrVWFRVYN8KxygloKsc5YkNLpkFzAVYzxYGhRFWVpcTSSVkz5Qrm-JLcnfYew_CVbBxNO6TQTycNk1IAm_6Cibo_UXUYYgzWmWPwBww_BqiZLZnZkpkt8V9ftFoy</recordid><startdate>20060101</startdate><enddate>20060101</enddate><creator>Yilmaz, O.</creator><creator>Say, A. C. Cem</creator><general>AI Access Foundation</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20060101</creationdate><title>Causes of Ineradicable Spurious Predictions in Qualitative Simulation</title><author>Yilmaz, O. ; Say, A. C. Cem</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c147t-9368996b04acd4f2bf41dbf33aad082919341e926312a5a6b885a8f55c26f72f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Artificial intelligence</topic><topic>Multiplication</topic><topic>Simulation</topic><topic>Simulators</topic><topic>Sound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yilmaz, O.</creatorcontrib><creatorcontrib>Say, A. C. Cem</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>The Journal of artificial intelligence research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yilmaz, O.</au><au>Say, A. C. Cem</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Causes of Ineradicable Spurious Predictions in Qualitative Simulation</atitle><jtitle>The Journal of artificial intelligence research</jtitle><date>2006-01-01</date><risdate>2006</risdate><volume>27</volume><spage>551</spage><epage>575</epage><pages>551-575</pages><issn>1076-9757</issn><eissn>1076-9757</eissn><eissn>1943-5037</eissn><abstract>It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is used, there will always be input models which cause any simulator with a coverage guarantee to make spurious predictions in its output. In this paper, we examine whether a meaningfully expressive restriction of this vocabulary is possible so that one can build a simulator with both the soundness and completeness properties. We prove several negative results: All sound qualitative simulators, employing subsets of the QSIM representation which retain the operating region transition feature, and support at least the addition and constancy constraints, are shown to be inherently incomplete. Even when the simulations are restricted to run in a single operating region, a constraint vocabulary containing just the addition, constancy, derivative, and multiplication relations makes the construction of sound and complete qualitative simulators impossible.</abstract><cop>San Francisco</cop><pub>AI Access Foundation</pub><doi>10.1613/jair.2065</doi><tpages>25</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1076-9757 |
ispartof | The Journal of artificial intelligence research, 2006-01, Vol.27, p.551-575 |
issn | 1076-9757 1076-9757 1943-5037 |
language | eng |
recordid | cdi_proquest_journals_2554120011 |
source | DOAJ Directory of Open Access Journals; Free E-Journal (出版社公開部分のみ); Open Access: Freely Accessible Journals by multiple vendors |
subjects | Algorithms Artificial intelligence Multiplication Simulation Simulators Sound |
title | Causes of Ineradicable Spurious Predictions in Qualitative Simulation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T10%3A07%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Causes%20of%20Ineradicable%20Spurious%20Predictions%20in%20Qualitative%20Simulation&rft.jtitle=The%20Journal%20of%20artificial%20intelligence%20research&rft.au=Yilmaz,%20O.&rft.date=2006-01-01&rft.volume=27&rft.spage=551&rft.epage=575&rft.pages=551-575&rft.issn=1076-9757&rft.eissn=1076-9757&rft_id=info:doi/10.1613/jair.2065&rft_dat=%3Cproquest_cross%3E2554120011%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2554120011&rft_id=info:pmid/&rfr_iscdi=true |