A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus
The satisfiability checking problem is known to be decidable for a variety of modal/temporal logics such as the modal μ-calculus, but effective implementation has not necessarily been developed for all such logics. In this paper, we propose a decision procedure using the tableau method for the alter...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 291 |
|---|---|
| container_issue | |
| container_start_page | 277 |
| container_title | |
| container_volume | |
| creator | Tanabe, Yoshinori Takahashi, Koichi Yamamoto, Mitsuharu Tozawa, Akihiko Hagiya, Masami |
| description | The satisfiability checking problem is known to be decidable for a variety of modal/temporal logics such as the modal μ-calculus, but effective implementation has not necessarily been developed for all such logics. In this paper, we propose a decision procedure using the tableau method for the alternation-free two-way modal μ-calculus. Although the size of the tableau set maintained in the method might be large for complex formulas, the set and the operations on it can be expressed using BDD and therefore we can implement the method in an effective way. |
| doi_str_mv | 10.1007/11554554_21 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17183038</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17183038</sourcerecordid><originalsourceid>FETCH-LOGICAL-c261t-c557c8f92b85d4c052c636f3bfa4b4a5145748fd3be9bc193bb8c188b6de8d643</originalsourceid><addsrcrecordid>eNpNkM1OwzAQhM2fRCk98QK-cOBg8HrtxD5WLS1IRXAo4hjZjgOFkFR2KtR34xl4JlKVA6uR9vCNRqMh5AL4NXCe3wAoJXsVAg7IGSrJEbQQ8pAMIANgiNIckZHJ9Y4JbRDMMRlw5IKZXOIpGaX0zvtDyCTnAzIf02nwq7RqG_oUWx_KTQy0aiPt3gId112Ije16ymYxBLr8atmL3dKHtrQ1_flmE1v7Tb1J5-SksnUKo78_JM-z2-Xkji0e5_eT8YJ5kUHHvFK515URTqtSeq6EzzCr0FVWOmkVSJVLXZXognEeDDqnPWjtsjLoMpM4JJf73LVN3tZVtE3fvljH1aeN2wJy0MhR976rvS_1qHkNsXBt-5EK4MVuyeLfkvgLP-Jfvg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus</title><source>Springer Books</source><creator>Tanabe, Yoshinori ; Takahashi, Koichi ; Yamamoto, Mitsuharu ; Tozawa, Akihiko ; Hagiya, Masami</creator><contributor>Beckert, Bernhard</contributor><creatorcontrib>Tanabe, Yoshinori ; Takahashi, Koichi ; Yamamoto, Mitsuharu ; Tozawa, Akihiko ; Hagiya, Masami ; Beckert, Bernhard</creatorcontrib><description>The satisfiability checking problem is known to be decidable for a variety of modal/temporal logics such as the modal μ-calculus, but effective implementation has not necessarily been developed for all such logics. In this paper, we propose a decision procedure using the tableau method for the alternation-free two-way modal μ-calculus. Although the size of the tableau set maintained in the method might be large for complex formulas, the set and the operations on it can be expressed using BDD and therefore we can implement the method in an effective way.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540289319</identifier><identifier>ISBN: 3540289313</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540318224</identifier><identifier>EISBN: 9783540318224</identifier><identifier>DOI: 10.1007/11554554_21</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Choice Function ; Computer science; control theory; systems ; Decision Procedure ; Exact sciences and technology ; Graph Transformation ; Logical, boolean and switching functions ; Model Check ; Temporal Logic ; Theoretical computing</subject><ispartof>Automated Reasoning with Analytic Tableaux and Related Methods, 2005, p.277-291</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c261t-c557c8f92b85d4c052c636f3bfa4b4a5145748fd3be9bc193bb8c188b6de8d643</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11554554_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11554554_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,777,778,782,787,788,791,4038,4039,27912,38242,41429,42498</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17183038$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Beckert, Bernhard</contributor><creatorcontrib>Tanabe, Yoshinori</creatorcontrib><creatorcontrib>Takahashi, Koichi</creatorcontrib><creatorcontrib>Yamamoto, Mitsuharu</creatorcontrib><creatorcontrib>Tozawa, Akihiko</creatorcontrib><creatorcontrib>Hagiya, Masami</creatorcontrib><title>A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus</title><title>Automated Reasoning with Analytic Tableaux and Related Methods</title><description>The satisfiability checking problem is known to be decidable for a variety of modal/temporal logics such as the modal μ-calculus, but effective implementation has not necessarily been developed for all such logics. In this paper, we propose a decision procedure using the tableau method for the alternation-free two-way modal μ-calculus. Although the size of the tableau set maintained in the method might be large for complex formulas, the set and the operations on it can be expressed using BDD and therefore we can implement the method in an effective way.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Choice Function</subject><subject>Computer science; control theory; systems</subject><subject>Decision Procedure</subject><subject>Exact sciences and technology</subject><subject>Graph Transformation</subject><subject>Logical, boolean and switching functions</subject><subject>Model Check</subject><subject>Temporal Logic</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540289319</isbn><isbn>3540289313</isbn><isbn>3540318224</isbn><isbn>9783540318224</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkM1OwzAQhM2fRCk98QK-cOBg8HrtxD5WLS1IRXAo4hjZjgOFkFR2KtR34xl4JlKVA6uR9vCNRqMh5AL4NXCe3wAoJXsVAg7IGSrJEbQQ8pAMIANgiNIckZHJ9Y4JbRDMMRlw5IKZXOIpGaX0zvtDyCTnAzIf02nwq7RqG_oUWx_KTQy0aiPt3gId112Ije16ymYxBLr8atmL3dKHtrQ1_flmE1v7Tb1J5-SksnUKo78_JM-z2-Xkji0e5_eT8YJ5kUHHvFK515URTqtSeq6EzzCr0FVWOmkVSJVLXZXognEeDDqnPWjtsjLoMpM4JJf73LVN3tZVtE3fvljH1aeN2wJy0MhR976rvS_1qHkNsXBt-5EK4MVuyeLfkvgLP-Jfvg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Tanabe, Yoshinori</creator><creator>Takahashi, Koichi</creator><creator>Yamamoto, Mitsuharu</creator><creator>Tozawa, Akihiko</creator><creator>Hagiya, Masami</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus</title><author>Tanabe, Yoshinori ; Takahashi, Koichi ; Yamamoto, Mitsuharu ; Tozawa, Akihiko ; Hagiya, Masami</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c261t-c557c8f92b85d4c052c636f3bfa4b4a5145748fd3be9bc193bb8c188b6de8d643</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Choice Function</topic><topic>Computer science; control theory; systems</topic><topic>Decision Procedure</topic><topic>Exact sciences and technology</topic><topic>Graph Transformation</topic><topic>Logical, boolean and switching functions</topic><topic>Model Check</topic><topic>Temporal Logic</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tanabe, Yoshinori</creatorcontrib><creatorcontrib>Takahashi, Koichi</creatorcontrib><creatorcontrib>Yamamoto, Mitsuharu</creatorcontrib><creatorcontrib>Tozawa, Akihiko</creatorcontrib><creatorcontrib>Hagiya, Masami</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tanabe, Yoshinori</au><au>Takahashi, Koichi</au><au>Yamamoto, Mitsuharu</au><au>Tozawa, Akihiko</au><au>Hagiya, Masami</au><au>Beckert, Bernhard</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus</atitle><btitle>Automated Reasoning with Analytic Tableaux and Related Methods</btitle><date>2005</date><risdate>2005</risdate><spage>277</spage><epage>291</epage><pages>277-291</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540289319</isbn><isbn>3540289313</isbn><eisbn>3540318224</eisbn><eisbn>9783540318224</eisbn><abstract>The satisfiability checking problem is known to be decidable for a variety of modal/temporal logics such as the modal μ-calculus, but effective implementation has not necessarily been developed for all such logics. In this paper, we propose a decision procedure using the tableau method for the alternation-free two-way modal μ-calculus. Although the size of the tableau set maintained in the method might be large for complex formulas, the set and the operations on it can be expressed using BDD and therefore we can implement the method in an effective way.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11554554_21</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automated Reasoning with Analytic Tableaux and Related Methods, 2005, p.277-291 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17183038 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Choice Function Computer science control theory systems Decision Procedure Exact sciences and technology Graph Transformation Logical, boolean and switching functions Model Check Temporal Logic Theoretical computing |
| title | A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T04%3A54%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Decision%20Procedure%20for%20the%20Alternation-Free%20Two-Way%20Modal%20%CE%BC-Calculus&rft.btitle=Automated%20Reasoning%20with%20Analytic%20Tableaux%20and%20Related%20Methods&rft.au=Tanabe,%20Yoshinori&rft.date=2005&rft.spage=277&rft.epage=291&rft.pages=277-291&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540289319&rft.isbn_list=3540289313&rft_id=info:doi/10.1007/11554554_21&rft_dat=%3Cpascalfrancis_sprin%3E17183038%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540318224&rft.eisbn_list=9783540318224&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |