DEL-based epistemic planning: Decidability and complexity
Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known comp...
Gespeichert in:
| Veröffentlicht in: | Artificial intelligence 2020-10, Vol.287, p.103304, Article 103304 |
|---|---|
| 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 | |
|---|---|
| container_issue | |
| container_start_page | 103304 |
| container_title | Artificial intelligence |
| container_volume | 287 |
| creator | Bolander, Thomas Charrier, Tristan Pinchinat, Sophie Schwarzentruber, François |
| description | Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems. |
| doi_str_mv | 10.1016/j.artint.2020.103304 |
| format | Article |
| fullrecord | <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_04047904v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0004370219301146</els_id><sourcerecordid>oai_HAL_hal_04047904v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c386t-b3e1bce0faf5a305d111450cb647e9ea396c51cb58b32fd330448abe0e035aed3</originalsourceid><addsrcrecordid>eNp9kM1LxDAQxYMouH78Bx569dB10qQf8SAsu6srFLzoOUySqWbptqUpi_vf21Lx6Gl4w3uPmR9jdxyWHHj2sF9iP_hmWCaQTCshQJ6xBS_yJM5Vws_ZAgBkLHJILtlVCPtRCqX4gqnNtowNBnIRdT4MdPA26mpsGt98PkYbst6h8bUfThE2LrLtoavpe5Q37KLCOtDt77xmH8_b9_UuLt9eXterMraiyIbYCOLGElRYpSggdZxzmYI1mcxJEQqV2ZRbkxZGJJWbTpcFGgICkSI5cc3u594vrHXX-wP2J92i17tVqacdSJC5Annko1fOXtu3IfRU_QU46AmV3usZlZ5Q6RnVGHuaYzT-cfTU62A9NZac78kO2rX-_4Ifi9tzGw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>DEL-based epistemic planning: Decidability and complexity</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB Electronic Journals Library</source><creator>Bolander, Thomas ; Charrier, Tristan ; Pinchinat, Sophie ; Schwarzentruber, François</creator><creatorcontrib>Bolander, Thomas ; Charrier, Tristan ; Pinchinat, Sophie ; Schwarzentruber, François</creatorcontrib><description>Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems.</description><identifier>ISSN: 0004-3702</identifier><identifier>EISSN: 1872-7921</identifier><identifier>DOI: 10.1016/j.artint.2020.103304</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Automata theory ; Automated planning ; Complexity theory ; Computer Science ; Decision problems ; Dynamic epistemic logic ; Epistemic planning ; Software Engineering</subject><ispartof>Artificial intelligence, 2020-10, Vol.287, p.103304, Article 103304</ispartof><rights>2020 Elsevier B.V.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c386t-b3e1bce0faf5a305d111450cb647e9ea396c51cb58b32fd330448abe0e035aed3</citedby><cites>FETCH-LOGICAL-c386t-b3e1bce0faf5a305d111450cb647e9ea396c51cb58b32fd330448abe0e035aed3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.artint.2020.103304$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttps://hal.science/hal-04047904$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Bolander, Thomas</creatorcontrib><creatorcontrib>Charrier, Tristan</creatorcontrib><creatorcontrib>Pinchinat, Sophie</creatorcontrib><creatorcontrib>Schwarzentruber, François</creatorcontrib><title>DEL-based epistemic planning: Decidability and complexity</title><title>Artificial intelligence</title><description>Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems.</description><subject>Automata theory</subject><subject>Automated planning</subject><subject>Complexity theory</subject><subject>Computer Science</subject><subject>Decision problems</subject><subject>Dynamic epistemic logic</subject><subject>Epistemic planning</subject><subject>Software Engineering</subject><issn>0004-3702</issn><issn>1872-7921</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kM1LxDAQxYMouH78Bx569dB10qQf8SAsu6srFLzoOUySqWbptqUpi_vf21Lx6Gl4w3uPmR9jdxyWHHj2sF9iP_hmWCaQTCshQJ6xBS_yJM5Vws_ZAgBkLHJILtlVCPtRCqX4gqnNtowNBnIRdT4MdPA26mpsGt98PkYbst6h8bUfThE2LrLtoavpe5Q37KLCOtDt77xmH8_b9_UuLt9eXterMraiyIbYCOLGElRYpSggdZxzmYI1mcxJEQqV2ZRbkxZGJJWbTpcFGgICkSI5cc3u594vrHXX-wP2J92i17tVqacdSJC5Annko1fOXtu3IfRU_QU46AmV3usZlZ5Q6RnVGHuaYzT-cfTU62A9NZac78kO2rX-_4Ifi9tzGw</recordid><startdate>202010</startdate><enddate>202010</enddate><creator>Bolander, Thomas</creator><creator>Charrier, Tristan</creator><creator>Pinchinat, Sophie</creator><creator>Schwarzentruber, François</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope></search><sort><creationdate>202010</creationdate><title>DEL-based epistemic planning: Decidability and complexity</title><author>Bolander, Thomas ; Charrier, Tristan ; Pinchinat, Sophie ; Schwarzentruber, François</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c386t-b3e1bce0faf5a305d111450cb647e9ea396c51cb58b32fd330448abe0e035aed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Automata theory</topic><topic>Automated planning</topic><topic>Complexity theory</topic><topic>Computer Science</topic><topic>Decision problems</topic><topic>Dynamic epistemic logic</topic><topic>Epistemic planning</topic><topic>Software Engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bolander, Thomas</creatorcontrib><creatorcontrib>Charrier, Tristan</creatorcontrib><creatorcontrib>Pinchinat, Sophie</creatorcontrib><creatorcontrib>Schwarzentruber, François</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Artificial intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bolander, Thomas</au><au>Charrier, Tristan</au><au>Pinchinat, Sophie</au><au>Schwarzentruber, François</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>DEL-based epistemic planning: Decidability and complexity</atitle><jtitle>Artificial intelligence</jtitle><date>2020-10</date><risdate>2020</risdate><volume>287</volume><spage>103304</spage><pages>103304-</pages><artnum>103304</artnum><issn>0004-3702</issn><eissn>1872-7921</eissn><abstract>Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.artint.2020.103304</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0004-3702 |
| ispartof | Artificial intelligence, 2020-10, Vol.287, p.103304, Article 103304 |
| issn | 0004-3702 1872-7921 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_04047904v1 |
| source | Elsevier ScienceDirect Journals Complete; EZB Electronic Journals Library |
| subjects | Automata theory Automated planning Complexity theory Computer Science Decision problems Dynamic epistemic logic Epistemic planning Software Engineering |
| title | DEL-based epistemic planning: Decidability and complexity |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T19%3A26%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=DEL-based%20epistemic%20planning:%20Decidability%20and%20complexity&rft.jtitle=Artificial%20intelligence&rft.au=Bolander,%20Thomas&rft.date=2020-10&rft.volume=287&rft.spage=103304&rft.pages=103304-&rft.artnum=103304&rft.issn=0004-3702&rft.eissn=1872-7921&rft_id=info:doi/10.1016/j.artint.2020.103304&rft_dat=%3Chal_cross%3Eoai_HAL_hal_04047904v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0004370219301146&rfr_iscdi=true |