Answer Set Planning: A Survey
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans , that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the developme...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 23; H. 1; S. 226 - 298 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
01.01.2023
|
| Schlagworte: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Answer Set Planning
refers to the use of
Answer Set Programming (ASP)
to compute
plans
, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research. |
|---|---|
| AbstractList | Answer Set Planning
refers to the use of
Answer Set Programming (ASP)
to compute
plans
, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research. Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research. |
| Author | BALDUCCINI, MARCELLO CAO TRAN, SON PONTELLI, ENRICO SCHAUB, TORSTEN |
| Author_xml | – sequence: 1 givenname: SON orcidid: 0000-0003-3689-8433 surname: CAO TRAN fullname: CAO TRAN, SON – sequence: 2 givenname: ENRICO orcidid: 0000-0002-7753-1737 surname: PONTELLI fullname: PONTELLI, ENRICO – sequence: 3 givenname: MARCELLO surname: BALDUCCINI fullname: BALDUCCINI, MARCELLO – sequence: 4 givenname: TORSTEN orcidid: 0000-0002-7456-041X surname: SCHAUB fullname: SCHAUB, TORSTEN |
| BookMark | eNp9UE1LxDAQDbKCu6s_wINQ8FzNJGnSeiuLq8KCQvUc2jSRLjVdk1TZf2_qelJwLjPM-5jhLdDMDlYjdA74CjCI6wqYAMxzRgiOJcgRmsdVllKcw-x7hnTCT9DC-y3GwClhc3RRWv-pXVLpkDz1tbWdfb1JyqQa3Yfen6JjU_den_30JXpZ3z6v7tPN493DqtykiggaUmEaoXFGgArOsGp1YUg7QawoRNYYVpsm5wQwgcYoTeMzBVeKCd3QRrWMLtHlwXfnhvdR-yC3w-hsPClJXhDKGeE4ssSBpdzgvdNGqi7UoRtscHXXS8ByykL-ySIq4Zdy57q32u3_0XwBbxtfCQ |
| CitedBy_id | crossref_primary_10_1016_j_cmpb_2023_107817 crossref_primary_10_4204_EPTCS_416_10 crossref_primary_10_4204_EPTCS_416_3 crossref_primary_10_3390_robotics13080112 crossref_primary_10_1007_s13218_024_00847_8 crossref_primary_10_1017_S1471068425100288 |
| Cites_doi | 10.1016/j.artint.2006.08.002 10.1017/S1471068406002717 10.1109/TRO.2016.2593448 10.1016/j.artint.2006.01.003 10.1016/0004-3702(87)90062-2 10.1007/3-540-44957-4_54 10.1007/3-540-45757-7_10 10.1016/j.ijar.2019.12.005 10.1613/jair.1148 10.1007/s10472-009-9116-y 10.1007/978-3-642-20895-9_33 10.1145/1160633.1160816 10.1093/logcom/5.5.579 10.1007/978-3-642-38197-3_9 10.1613/jair.1427 10.1016/j.artint.2004.05.003 10.1017/S1471068406002948 10.1609/icaps.v19i1.13370 10.1609/icaps.v24i1.13671 10.1007/11562931_7 10.1007/3-540-63912-8_84 10.24963/ijcai.2020/232 10.24963/kr.2020/66 10.1007/978-3-540-72200-7_23 10.1007/978-3-030-20528-7_17 10.1017/S1471068418000182 10.1017/S1471068403001807 10.1609/aaai.v25i1.8005 10.1007/978-3-642-24130-7_13 10.1016/B978-012369388-4/50072-2 10.1007/3-540-45241-9_12 10.1017/S1471068418000583 10.1287/moor.27.4.819.297 10.1145/136035.136043 10.1613/jair.4591 10.1613/jair.4447 10.1145/3356464.3357702 10.1016/j.knosys.2018.11.028 10.1613/jair.774 10.1613/jair.855 10.1109/TAC.2013.2275892 10.1016/S0004-3702(02)00187-X 10.1007/978-3-540-72200-7_19 10.1109/ACCESS.2021.3053547 10.1017/S1471068420000289 10.1145/545056.545095 10.24963/ijcai.2019/164 10.1007/978-3-030-55789-8_45 10.1007/978-3-642-40564-8_6 10.1609/aimag.v29i4.2204 10.1016/S0004-3702(00)00080-1 10.1609/icaps.v21i1.13445 10.1609/aaai.v34i03.5670 10.1609/icaps.v19i1.13345 10.1609/icaps.v22i1.13498 10.1007/978-3-540-30227-8_6 10.3233/MGS-2009-0133 10.3233/FI-2009-180 10.1613/jair.277 10.24963/ijcai.2018/848 10.1613/jair.2708 10.1007/978-3-540-92995-6_17 10.1016/S0743-1066(96)00125-2 10.21236/ADA459656 10.1016/S0004-3702(01)00106-0 10.1007/11549468_82 10.1016/S0004-3702(01)00108-4 10.1007/s10458-014-9261-5 10.1016/j.artint.2008.11.004 10.1016/j.artint.2005.08.004 10.1017/S1471068418000054 10.1007/11881216_33 10.1007/978-3-540-27775-0_6 10.1016/S0004-3702(02)00186-8 10.1016/j.artint.2020.103271 10.1016/S0004-3702(98)00023-X 10.1613/jair.591 10.1016/S0004-3702(02)00367-3 10.1613/jair.1.11751 10.24963/ijcai.2018/58 10.1613/jair.4171 10.1016/S0004-3702(96)00047-1 10.24963/ijcai.2017/684 10.1007/978-3-030-20528-7_22 10.1007/11546207_14 10.1631/FITEE.1800514 10.1007/978-3-642-02846-5_13 10.1016/S0004-3702(00)00043-6 10.1016/0004-3702(71)90010-5 10.1007/BF03037383 10.1093/logcom/exq023 10.1609/aaai.v34i06.6540 10.1016/j.engappai.2019.08.002 10.24963/ijcai.2020/663 10.1017/S1471068417000321 10.1609/aaai.v24i1.7757 10.1017/S1471068417000187 10.1007/978-3-540-24609-1_32 10.1111/j.1467-8640.1995.tb00052.x 10.1007/978-3-642-03770-2_13 10.1007/3-540-46767-X_7 10.1007/978-3-319-61660-5_19 10.1017/S1471068419000395 10.24963/ijcai.2019/6 10.1017/S1471068412000142 10.1016/S0004-3702(99)00019-3 10.1613/jair.1705 10.1613/jair.1747 10.1613/jair.1.11734 10.1007/978-3-642-16867-3_1 10.24963/ijcai.2017/23 10.1016/0004-3702(74)90026-5 10.4204/EPTCS.243.6 10.24963/ijcai.2017/169 10.1007/978-3-030-20528-7_1 10.1017/S1471068417000138 10.1023/A:1020236119243 10.1016/j.artint.2014.11.006 10.1016/S0004-3702(02)00375-2 10.1016/B978-0-08-049944-4.50027-6 10.1016/S0743-1066(99)00077-1 10.1016/S0004-3702(97)00037-4 10.1016/j.artint.2010.04.007 10.1007/3-540-63255-7_32 10.1016/0004-3702(85)90084-0 10.1145/1183278.1183279 10.1017/S1471068420000319 10.1017/S1471068421000259 10.7551/mitpress/5803.001.0001 10.1007/3-540-63255-7_27 10.24963/ijcai.2017/152 10.1007/978-3-319-23264-5_15 10.1145/976706.976708 10.1613/jair.4503 10.1007/BF03037169 10.1017/S1471068417000102 10.1007/978-1-4615-1567-8_12 10.1613/jair.1869 10.1017/S1471068418000200 10.1613/jair.1492 10.3166/jancl.21.9-34 10.1016/S1474-6670(17)36467-4 10.1613/jair.1579 10.1080/09528130701538174 10.1613/jair.1156 10.1007/978-3-642-20895-9_36 10.1007/978-3-642-02846-5_22 10.2200/S00091ED1V01Y200705AIM002 10.1017/CBO9781139583923 10.1016/j.artint.2012.08.001 10.1007/11871842_29 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2022. Published by Cambridge University Press |
| Copyright_xml | – notice: The Author(s), 2022. Published by Cambridge University Press |
| DBID | AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U |
| DOI | 10.1017/S1471068422000072 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Database (1962 - current) ProQuest Central Essentials - QC ProQuest Central Technology collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database (ProQuest) Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1475-3081 |
| EndPage | 298 |
| ExternalDocumentID | 10_1017_S1471068422000072 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYXX ABBXD ABGDZ ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABXHF ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AFFHD AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKMAY ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ATUCA AUXHV AZQEC BBLKV BENPR BGHMG BGLVJ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CFAFE CHEAL CITATION CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IPYYG IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V NIKVX O9- OYBOY P2P P62 PHGZM PHGZT PQGLB PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WYP ZYDXJ 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c273t-7fb7e052137640cde9f2dc27349975bf4afb8621021bfce314796cc47eb3bcd43 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000776673100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-0684 |
| IngestDate | Sun Nov 30 04:42:25 EST 2025 Sat Nov 29 04:58:37 EST 2025 Tue Nov 18 20:02:55 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c273t-7fb7e052137640cde9f2dc27349975bf4afb8621021bfce314796cc47eb3bcd43 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-3689-8433 0000-0002-7753-1737 0000-0002-7456-041X |
| PQID | 2892364260 |
| PQPubID | 43613 |
| PageCount | 73 |
| ParticipantIDs | proquest_journals_2892364260 crossref_citationtrail_10_1017_S1471068422000072 crossref_primary_10_1017_S1471068422000072 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-00 20230101 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Cambridge |
| PublicationPlace_xml | – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationYear | 2023 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | Bellman (S1471068422000072_ref32) 1957; 5 Wagner (S1471068422000072_ref266) 2015 Ghallab (S1471068422000072_ref110) 2004 Tran (S1471068422000072_ref253) 2013; 2 Allen (S1471068422000072_ref5) 1991 Shanahan (S1471068422000072_ref213) 1997 BartÁk (S1471068422000072_ref29) 2019; 3 Gelfond (S1471068422000072_ref106) 1998; 6 Calimeri (S1471068422000072_ref52) 2019; 2 Fagin (S1471068422000072_ref92) 1995 Wang (S1471068422000072_ref268) 2011 Shoham (S1471068422000072_ref218) 2009 S1471068422000072_ref18 S1471068422000072_ref19 S1471068422000072_ref10 S1471068422000072_ref168 S1471068422000072_ref169 S1471068422000072_ref11 S1471068422000072_ref12 S1471068422000072_ref166 S1471068422000072_ref167 S1471068422000072_ref14 S1471068422000072_ref15 S1471068422000072_ref16 S1471068422000072_ref17 S1471068422000072_ref160 S1471068422000072_ref161 S1471068422000072_ref164 S1471068422000072_ref165 S1471068422000072_ref163 S1471068422000072_ref20 S1471068422000072_ref179 S1471068422000072_ref177 S1471068422000072_ref178 S1471068422000072_ref171 S1471068422000072_ref172 S1471068422000072_ref170 S1471068422000072_ref175 Allen (S1471068422000072_ref4) 1990 S1471068422000072_ref176 S1471068422000072_ref173 S1471068422000072_ref174 Bacchus (S1471068422000072_ref13) 2001; 3 S1471068422000072_ref188 S1471068422000072_ref189 S1471068422000072_ref182 Van Gelder (S1471068422000072_ref261) 1991; 3 S1471068422000072_ref183 S1471068422000072_ref180 S1471068422000072_ref181 S1471068422000072_ref186 S1471068422000072_ref187 S1471068422000072_ref184 S1471068422000072_ref185 S1471068422000072_ref199 S1471068422000072_ref193 S1471068422000072_ref194 S1471068422000072_ref191 S1471068422000072_ref192 S1471068422000072_ref197 Long (S1471068422000072_ref162) 2000; 2 S1471068422000072_ref198 S1471068422000072_ref195 S1471068422000072_ref196 S1471068422000072_ref190 S1471068422000072_ref245 S1471068422000072_ref54 S1471068422000072_ref124 S1471068422000072_ref55 S1471068422000072_ref125 S1471068422000072_ref243 S1471068422000072_ref56 S1471068422000072_ref122 S1471068422000072_ref123 S1471068422000072_ref244 S1471068422000072_ref57 S1471068422000072_ref128 S1471068422000072_ref249 S1471068422000072_ref58 S1471068422000072_ref59 S1471068422000072_ref129 S1471068422000072_ref126 S1471068422000072_ref247 S1471068422000072_ref248 S1471068422000072_ref127 S1471068422000072_ref60 S1471068422000072_ref120 S1471068422000072_ref61 S1471068422000072_ref241 S1471068422000072_ref121 S1471068422000072_ref62 S1471068422000072_ref242 S1471068422000072_ref63 S1471068422000072_ref240 S1471068422000072_ref64 S1471068422000072_ref256 S1471068422000072_ref43 S1471068422000072_ref135 S1471068422000072_ref257 S1471068422000072_ref136 S1471068422000072_ref44 S1471068422000072_ref133 S1471068422000072_ref254 S1471068422000072_ref45 S1471068422000072_ref46 S1471068422000072_ref134 S1471068422000072_ref255 S1471068422000072_ref47 Kambhampati (S1471068422000072_ref141) 1997 S1471068422000072_ref139 S1471068422000072_ref48 S1471068422000072_ref137 S1471068422000072_ref258 S1471068422000072_ref49 S1471068422000072_ref138 S1471068422000072_ref259 S1471068422000072_ref252 S1471068422000072_ref131 S1471068422000072_ref50 S1471068422000072_ref51 S1471068422000072_ref250 S1471068422000072_ref251 S1471068422000072_ref130 S1471068422000072_ref53 Yang (S1471068422000072_ref277) 1997 Shani (S1471068422000072_ref216) 2013; 1 S1471068422000072_ref146 S1471068422000072_ref267 S1471068422000072_ref147 S1471068422000072_ref33 S1471068422000072_ref34 S1471068422000072_ref144 S1471068422000072_ref265 S1471068422000072_ref145 S1471068422000072_ref35 S1471068422000072_ref36 S1471068422000072_ref37 S1471068422000072_ref269 S1471068422000072_ref38 S1471068422000072_ref148 S1471068422000072_ref149 S1471068422000072_ref39 S1471068422000072_ref142 S1471068422000072_ref263 S1471068422000072_ref264 S1471068422000072_ref40 S1471068422000072_ref143 S1471068422000072_ref140 S1471068422000072_ref41 S1471068422000072_ref262 S1471068422000072_ref42 Ghallab (S1471068422000072_ref111) 2016 S1471068422000072_ref157 S1471068422000072_ref278 S1471068422000072_ref21 S1471068422000072_ref22 S1471068422000072_ref158 S1471068422000072_ref279 S1471068422000072_ref23 S1471068422000072_ref155 S1471068422000072_ref276 S1471068422000072_ref156 S1471068422000072_ref24 S1471068422000072_ref25 S1471068422000072_ref26 S1471068422000072_ref159 S1471068422000072_ref27 S1471068422000072_ref28 S1471068422000072_ref270 S1471068422000072_ref150 S1471068422000072_ref274 S1471068422000072_ref153 S1471068422000072_ref154 S1471068422000072_ref151 S1471068422000072_ref272 S1471068422000072_ref30 S1471068422000072_ref31 S1471068422000072_ref273 Wurman (S1471068422000072_ref275) 2008; 1 S1471068422000072_ref152 S1471068422000072_ref209 S1471068422000072_ref207 S1471068422000072_ref208 S1471068422000072_ref98 S1471068422000072_ref201 S1471068422000072_ref99 S1471068422000072_ref202 S1471068422000072_ref200 S1471068422000072_ref205 S1471068422000072_ref206 S1471068422000072_ref203 S1471068422000072_ref204 Weld (S1471068422000072_ref271) 1994; 4 S1471068422000072_ref219 S1471068422000072_ref212 S1471068422000072_ref87 S1471068422000072_ref88 S1471068422000072_ref210 S1471068422000072_ref89 S1471068422000072_ref211 S1471068422000072_ref217 S1471068422000072_ref214 S1471068422000072_ref215 S1471068422000072_ref90 S1471068422000072_ref91 S1471068422000072_ref9 S1471068422000072_ref93 S1471068422000072_ref94 S1471068422000072_ref95 S1471068422000072_ref96 S1471068422000072_ref97 S1471068422000072_ref3 S1471068422000072_ref1 S1471068422000072_ref2 S1471068422000072_ref7 S1471068422000072_ref8 S1471068422000072_ref6 S1471068422000072_ref108 S1471068422000072_ref109 S1471068422000072_ref223 S1471068422000072_ref102 S1471068422000072_ref76 S1471068422000072_ref77 S1471068422000072_ref103 S1471068422000072_ref224 S1471068422000072_ref100 S1471068422000072_ref221 S1471068422000072_ref101 S1471068422000072_ref79 S1471068422000072_ref222 S1471068422000072_ref227 S1471068422000072_ref228 S1471068422000072_ref107 S1471068422000072_ref225 S1471068422000072_ref104 S1471068422000072_ref105 S1471068422000072_ref226 S1471068422000072_ref80 S1471068422000072_ref81 S1471068422000072_ref82 S1471068422000072_ref83 S1471068422000072_ref84 S1471068422000072_ref220 S1471068422000072_ref85 S1471068422000072_ref86 Dodaro (S1471068422000072_ref78) 2019 Van Ditmarsch (S1471068422000072_ref260) 2007 Son (S1471068422000072_ref229) 2014; 2 Hendler (S1471068422000072_ref132) 1990; 2 S1471068422000072_ref119 S1471068422000072_ref113 S1471068422000072_ref234 S1471068422000072_ref65 S1471068422000072_ref114 S1471068422000072_ref66 S1471068422000072_ref235 S1471068422000072_ref232 S1471068422000072_ref67 S1471068422000072_ref68 S1471068422000072_ref112 S1471068422000072_ref233 S1471068422000072_ref69 S1471068422000072_ref117 S1471068422000072_ref238 S1471068422000072_ref118 S1471068422000072_ref239 S1471068422000072_ref115 S1471068422000072_ref236 S1471068422000072_ref237 S1471068422000072_ref116 S1471068422000072_ref70 S1471068422000072_ref71 S1471068422000072_ref230 S1471068422000072_ref72 Thielscher (S1471068422000072_ref246) 1997; 4 S1471068422000072_ref231 S1471068422000072_ref73 S1471068422000072_ref74 S1471068422000072_ref75 |
| References_xml | – ident: S1471068422000072_ref205 doi: 10.1016/j.artint.2006.08.002 – volume-title: Dynamic Epistemic Logic year: 2007 ident: S1471068422000072_ref260 – ident: S1471068422000072_ref226 doi: 10.1017/S1471068406002717 – ident: S1471068422000072_ref278 doi: 10.1109/TRO.2016.2593448 – ident: S1471068422000072_ref134 doi: 10.1016/j.artint.2006.01.003 – volume: 2 year: 2014 ident: S1471068422000072_ref229 article-title: Formalizing negotiations using logic programming publication-title: ACM Transactions on Computational Logic 15 – ident: S1471068422000072_ref30 – ident: S1471068422000072_ref200 doi: 10.1016/0004-3702(87)90062-2 – volume: 3 start-page: 47 year: 2001 ident: S1471068422000072_ref13 article-title: The AIPS’00 planning competition publication-title: AI Magazine 22 – ident: S1471068422000072_ref131 – ident: S1471068422000072_ref263 – ident: S1471068422000072_ref82 doi: 10.1007/3-540-44957-4_54 – ident: S1471068422000072_ref258 doi: 10.1007/3-540-45757-7_10 – ident: S1471068422000072_ref154 – ident: S1471068422000072_ref251 – ident: S1471068422000072_ref211 – volume: 3 start-page: 175 year: 2019 ident: S1471068422000072_ref29 article-title: Multi-agent path finding on real robots publication-title: AI Magazine 32 – ident: S1471068422000072_ref254 doi: 10.1016/j.ijar.2019.12.005 – ident: S1471068422000072_ref70 – ident: S1471068422000072_ref171 – ident: S1471068422000072_ref83 doi: 10.1613/jair.1148 – ident: S1471068422000072_ref172 doi: 10.1007/s10472-009-9116-y – ident: S1471068422000072_ref17 doi: 10.1007/978-3-642-20895-9_33 – ident: S1471068422000072_ref234 – volume: 4 start-page: 73 year: 1997 ident: S1471068422000072_ref246 article-title: A theory of dynamic diagnosis publication-title: Electronic Transactions on Artificial Intelligence 1 – ident: S1471068422000072_ref47 – ident: S1471068422000072_ref199 doi: 10.1145/1160633.1160816 – volume: 2 start-page: 294 year: 2019 ident: S1471068422000072_ref52 article-title: ASP-Core-2 input language format publication-title: Theory and Practice of Logic Programming 20 – ident: S1471068422000072_ref142 – ident: S1471068422000072_ref174 doi: 10.1093/logcom/5.5.579 – ident: S1471068422000072_ref125 – ident: S1471068422000072_ref169 doi: 10.1007/978-3-642-38197-3_9 – ident: S1471068422000072_ref119 doi: 10.1613/jair.1427 – ident: S1471068422000072_ref62 doi: 10.1016/j.artint.2004.05.003 – volume: 1 start-page: 9 year: 2008 ident: S1471068422000072_ref275 article-title: Coordinating hundreds of cooperative, autonomous vehicles in warehouses publication-title: AI Magazine 29 – ident: S1471068422000072_ref160 – ident: S1471068422000072_ref255 doi: 10.1017/S1471068406002948 – ident: S1471068422000072_ref128 doi: 10.1609/icaps.v19i1.13370 – ident: S1471068422000072_ref12 – ident: S1471068422000072_ref245 – ident: S1471068422000072_ref145 doi: 10.1609/icaps.v24i1.13671 – ident: S1471068422000072_ref239 – ident: S1471068422000072_ref31 doi: 10.1007/11562931_7 – start-page: 390 year: 1997 ident: S1471068422000072_ref213 – ident: S1471068422000072_ref101 – ident: S1471068422000072_ref75 doi: 10.1007/3-540-63912-8_84 – ident: S1471068422000072_ref42 – ident: S1471068422000072_ref227 – ident: S1471068422000072_ref143 – ident: S1471068422000072_ref9 doi: 10.24963/ijcai.2020/232 – ident: S1471068422000072_ref183 doi: 10.24963/kr.2020/66 – ident: S1471068422000072_ref100 doi: 10.1007/978-3-540-72200-7_23 – ident: S1471068422000072_ref269 doi: 10.1007/978-3-030-20528-7_17 – ident: S1471068422000072_ref103 doi: 10.1017/S1471068418000182 – ident: S1471068422000072_ref18 doi: 10.1017/S1471068403001807 – ident: S1471068422000072_ref98 – ident: S1471068422000072_ref180 doi: 10.1609/aaai.v25i1.8005 – ident: S1471068422000072_ref59 – ident: S1471068422000072_ref108 – ident: S1471068422000072_ref65 – volume: 1 start-page: 1 year: 2013 ident: S1471068422000072_ref216 article-title: A survey of point-based POMDP solvers publication-title: Autonomous Agents and Multi-Agent Systems 27 – ident: S1471068422000072_ref163 doi: 10.1007/978-3-642-24130-7_13 – ident: S1471068422000072_ref177 doi: 10.1016/B978-012369388-4/50072-2 – ident: S1471068422000072_ref186 doi: 10.1007/3-540-45241-9_12 – ident: S1471068422000072_ref148 – ident: S1471068422000072_ref74 doi: 10.1017/S1471068418000583 – ident: S1471068422000072_ref33 doi: 10.1287/moor.27.4.819.297 – ident: S1471068422000072_ref49 doi: 10.1145/136035.136043 – ident: S1471068422000072_ref165 – ident: S1471068422000072_ref76 – ident: S1471068422000072_ref57 doi: 10.1613/jair.4591 – ident: S1471068422000072_ref222 – ident: S1471068422000072_ref73 doi: 10.1613/jair.4447 – ident: S1471068422000072_ref194 doi: 10.1145/3356464.3357702 – ident: S1471068422000072_ref159 – ident: S1471068422000072_ref68 doi: 10.1016/j.knosys.2018.11.028 – ident: S1471068422000072_ref61 doi: 10.1613/jair.774 – volume: 2 year: 2013 ident: S1471068422000072_ref253 article-title: A conformant planner based on approximation: Cpa(h) publication-title: ACM Transactions on Intelligent Systems and Technology 4 – ident: S1471068422000072_ref28 – ident: S1471068422000072_ref135 doi: 10.1613/jair.855 – ident: S1471068422000072_ref176 – ident: S1471068422000072_ref122 doi: 10.1109/TAC.2013.2275892 – ident: S1471068422000072_ref193 – ident: S1471068422000072_ref221 doi: 10.1016/S0004-3702(02)00187-X – ident: S1471068422000072_ref170 – ident: S1471068422000072_ref25 – ident: S1471068422000072_ref19 – ident: S1471068422000072_ref40 – ident: S1471068422000072_ref262 doi: 10.1007/978-3-540-72200-7_19 – ident: S1471068422000072_ref121 doi: 10.1109/ACCESS.2021.3053547 – ident: S1471068422000072_ref164 – ident: S1471068422000072_ref51 doi: 10.1017/S1471068420000289 – ident: S1471068422000072_ref267 – ident: S1471068422000072_ref259 doi: 10.1145/545056.545095 – volume: 5 start-page: 679 year: 1957 ident: S1471068422000072_ref32 article-title: A markovian decision process publication-title: Journal of Mathematics and Mechanics 6 – ident: S1471068422000072_ref240 doi: 10.24963/ijcai.2019/164 – ident: S1471068422000072_ref63 – ident: S1471068422000072_ref274 doi: 10.1007/978-3-030-55789-8_45 – ident: S1471068422000072_ref8 doi: 10.1007/978-3-642-40564-8_6 – ident: S1471068422000072_ref15 doi: 10.1609/aimag.v29i4.2204 – ident: S1471068422000072_ref196 – ident: S1471068422000072_ref224 doi: 10.1016/S0004-3702(00)00080-1 – ident: S1471068422000072_ref64 doi: 10.1609/icaps.v21i1.13445 – ident: S1471068422000072_ref94 doi: 10.1609/aaai.v34i03.5670 – ident: S1471068422000072_ref129 – ident: S1471068422000072_ref201 doi: 10.1609/icaps.v19i1.13345 – ident: S1471068422000072_ref181 doi: 10.1609/icaps.v22i1.13498 – ident: S1471068422000072_ref88 doi: 10.1007/978-3-540-30227-8_6 – ident: S1471068422000072_ref72 doi: 10.3233/MGS-2009-0133 – ident: S1471068422000072_ref191 doi: 10.3233/FI-2009-180 – ident: S1471068422000072_ref81 – ident: S1471068422000072_ref197 doi: 10.1613/jair.277 – ident: S1471068422000072_ref241 – volume-title: Reasoning about Plans year: 1991 ident: S1471068422000072_ref5 – ident: S1471068422000072_ref3 – ident: S1471068422000072_ref273 – ident: S1471068422000072_ref153 – ident: S1471068422000072_ref147 – ident: S1471068422000072_ref279 – ident: S1471068422000072_ref46 – ident: S1471068422000072_ref53 doi: 10.24963/ijcai.2018/848 – ident: S1471068422000072_ref190 doi: 10.1613/jair.2708 – ident: S1471068422000072_ref130 – ident: S1471068422000072_ref223 – ident: S1471068422000072_ref252 doi: 10.1007/978-3-540-92995-6_17 – ident: S1471068422000072_ref257 doi: 10.1016/S0743-1066(96)00125-2 – ident: S1471068422000072_ref80 – ident: S1471068422000072_ref124 doi: 10.21236/ADA459656 – ident: S1471068422000072_ref175 – ident: S1471068422000072_ref126 doi: 10.1016/S0004-3702(01)00106-0 – ident: S1471068422000072_ref151 doi: 10.1007/11549468_82 – ident: S1471068422000072_ref39 doi: 10.1016/S0004-3702(01)00108-4 – ident: S1471068422000072_ref235 doi: 10.1007/s10458-014-9261-5 – ident: S1471068422000072_ref152 – ident: S1471068422000072_ref41 – ident: S1471068422000072_ref60 doi: 10.1016/j.artint.2008.11.004 – ident: S1471068422000072_ref264 doi: 10.1016/j.artint.2005.08.004 – ident: S1471068422000072_ref97 – ident: S1471068422000072_ref99 doi: 10.1017/S1471068418000054 – ident: S1471068422000072_ref188 doi: 10.1007/11881216_33 – ident: S1471068422000072_ref113 – ident: S1471068422000072_ref87 doi: 10.1007/978-3-540-27775-0_6 – ident: S1471068422000072_ref107 – ident: S1471068422000072_ref157 doi: 10.1016/S0004-3702(02)00186-8 – ident: S1471068422000072_ref123 doi: 10.1016/j.artint.2020.103271 – ident: S1471068422000072_ref140 doi: 10.1016/S0004-3702(98)00023-X – ident: S1471068422000072_ref231 – ident: S1471068422000072_ref202 doi: 10.1613/jair.591 – ident: S1471068422000072_ref67 – ident: S1471068422000072_ref84 doi: 10.1016/S0004-3702(02)00367-3 – ident: S1471068422000072_ref44 – ident: S1471068422000072_ref38 – ident: S1471068422000072_ref55 doi: 10.1613/jair.1.11751 – ident: S1471068422000072_ref96 – ident: S1471068422000072_ref219 – ident: S1471068422000072_ref168 doi: 10.24963/ijcai.2018/58 – ident: S1471068422000072_ref248 – ident: S1471068422000072_ref118 doi: 10.1613/jair.4171 – ident: S1471068422000072_ref116 – ident: S1471068422000072_ref35 doi: 10.1016/S0004-3702(96)00047-1 – ident: S1471068422000072_ref137 doi: 10.24963/ijcai.2017/684 – ident: S1471068422000072_ref243 doi: 10.1007/978-3-030-20528-7_22 – ident: S1471068422000072_ref233 doi: 10.1007/11546207_14 – ident: S1471068422000072_ref207 – ident: S1471068422000072_ref139 doi: 10.1631/FITEE.1800514 – ident: S1471068422000072_ref91 – ident: S1471068422000072_ref230 doi: 10.1007/978-3-642-02846-5_13 – ident: S1471068422000072_ref26 – start-page: 67 year: 2019 ident: S1471068422000072_ref78 – ident: S1471068422000072_ref24 doi: 10.1016/S0004-3702(00)00043-6 – ident: S1471068422000072_ref95 doi: 10.1016/0004-3702(71)90010-5 – ident: S1471068422000072_ref220 – ident: S1471068422000072_ref185 – ident: S1471068422000072_ref150 doi: 10.1007/BF03037383 – volume: 2 start-page: 61 year: 1990 ident: S1471068422000072_ref132 article-title: AI planning: Systems and techniques publication-title: AI Magazine 11 – ident: S1471068422000072_ref114 doi: 10.1093/logcom/exq023 – ident: S1471068422000072_ref120 doi: 10.1609/aaai.v34i06.6540 – ident: S1471068422000072_ref34 doi: 10.1016/j.engappai.2019.08.002 – ident: S1471068422000072_ref214 – ident: S1471068422000072_ref195 doi: 10.24963/ijcai.2020/663 – volume-title: Intelligent Planning - A Decomposition and Abstraction based Approach year: 1997 ident: S1471068422000072_ref277 – ident: S1471068422000072_ref276 doi: 10.1017/S1471068417000321 – ident: S1471068422000072_ref208 – ident: S1471068422000072_ref250 doi: 10.1609/aaai.v24i1.7757 – ident: S1471068422000072_ref21 doi: 10.1017/S1471068417000187 – ident: S1471068422000072_ref155 doi: 10.1007/978-3-540-24609-1_32 – ident: S1471068422000072_ref14 doi: 10.1111/j.1467-8640.1995.tb00052.x – ident: S1471068422000072_ref90 – volume: 3 start-page: 620 year: 1991 ident: S1471068422000072_ref261 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM 38 – start-page: 260 year: 1997 ident: S1471068422000072_ref141 – ident: S1471068422000072_ref212 doi: 10.1007/978-3-642-03770-2_13 – ident: S1471068422000072_ref158 doi: 10.1007/3-540-46767-X_7 – ident: S1471068422000072_ref242 – ident: S1471068422000072_ref7 doi: 10.1007/978-3-319-61660-5_19 – ident: S1471068422000072_ref236 doi: 10.1017/S1471068419000395 – ident: S1471068422000072_ref272 – ident: S1471068422000072_ref10 doi: 10.24963/ijcai.2019/6 – ident: S1471068422000072_ref187 doi: 10.1017/S1471068412000142 – ident: S1471068422000072_ref156 – ident: S1471068422000072_ref27 doi: 10.1016/S0004-3702(99)00019-3 – ident: S1471068422000072_ref127 doi: 10.1613/jair.1705 – ident: S1471068422000072_ref179 – ident: S1471068422000072_ref198 – ident: S1471068422000072_ref45 – ident: S1471068422000072_ref133 doi: 10.1613/jair.1747 – ident: S1471068422000072_ref11 doi: 10.1613/jair.1.11734 – ident: S1471068422000072_ref117 – ident: S1471068422000072_ref228 doi: 10.1007/978-3-642-16867-3_1 – ident: S1471068422000072_ref58 doi: 10.24963/ijcai.2017/23 – ident: S1471068422000072_ref209 doi: 10.1016/0004-3702(74)90026-5 – ident: S1471068422000072_ref247 – ident: S1471068422000072_ref89 doi: 10.4204/EPTCS.243.6 – ident: S1471068422000072_ref182 doi: 10.24963/ijcai.2017/169 – ident: S1471068422000072_ref1 doi: 10.1007/978-3-030-20528-7_1 – ident: S1471068422000072_ref22 doi: 10.1017/S1471068417000138 – ident: S1471068422000072_ref71 doi: 10.1023/A:1020236119243 – ident: S1471068422000072_ref217 doi: 10.1016/j.artint.2014.11.006 – ident: S1471068422000072_ref56 doi: 10.1016/S0004-3702(02)00375-2 – volume: 2 start-page: 13 year: 2000 ident: S1471068422000072_ref162 article-title: The AIPS’98 planning competition publication-title: AI Magazine 21 – ident: S1471068422000072_ref192 doi: 10.1016/B978-0-08-049944-4.50027-6 – ident: S1471068422000072_ref244 – ident: S1471068422000072_ref161 – ident: S1471068422000072_ref215 doi: 10.1016/S0743-1066(99)00077-1 – volume-title: Multiagent Systems — Algorithmic, Game-Theoretic, and Logical Foundations year: 2009 ident: S1471068422000072_ref218 – ident: S1471068422000072_ref270 – ident: S1471068422000072_ref112 doi: 10.1016/S0004-3702(97)00037-4 – ident: S1471068422000072_ref238 – ident: S1471068422000072_ref6 – start-page: 1 year: 2015 ident: S1471068422000072_ref266 article-title: Subdimensional expansion for multirobot path planning publication-title: Artificial Intelligence 219 – ident: S1471068422000072_ref256 doi: 10.1016/j.artint.2010.04.007 – volume-title: Automated Planning: Theory and Practice year: 2004 ident: S1471068422000072_ref110 – ident: S1471068422000072_ref184 doi: 10.1007/3-540-63255-7_32 – ident: S1471068422000072_ref149 doi: 10.1016/0004-3702(85)90084-0 – ident: S1471068422000072_ref225 doi: 10.1145/1183278.1183279 – ident: S1471068422000072_ref206 doi: 10.1017/S1471068420000319 – ident: S1471068422000072_ref16 – ident: S1471068422000072_ref93 doi: 10.1017/S1471068421000259 – ident: S1471068422000072_ref249 – ident: S1471068422000072_ref43 – volume-title: Reasoning About Knowledge year: 1995 ident: S1471068422000072_ref92 doi: 10.7551/mitpress/5803.001.0001 – ident: S1471068422000072_ref167 – ident: S1471068422000072_ref86 doi: 10.1007/3-540-63255-7_27 – ident: S1471068422000072_ref203 – volume: 6 start-page: 193 year: 1998 ident: S1471068422000072_ref106 article-title: Action languages publication-title: Electronic Transactions on Artificial Intelligence 3 – ident: S1471068422000072_ref138 doi: 10.24963/ijcai.2017/152 – ident: S1471068422000072_ref54 – ident: S1471068422000072_ref48 doi: 10.1007/978-3-319-23264-5_15 – ident: S1471068422000072_ref37 – ident: S1471068422000072_ref109 – ident: S1471068422000072_ref85 doi: 10.1145/976706.976708 – ident: S1471068422000072_ref173 doi: 10.1613/jair.4503 – ident: S1471068422000072_ref178 – ident: S1471068422000072_ref105 doi: 10.1007/BF03037169 – ident: S1471068422000072_ref210 – ident: S1471068422000072_ref20 doi: 10.1017/S1471068417000102 – ident: S1471068422000072_ref23 doi: 10.1007/978-1-4615-1567-8_12 – ident: S1471068422000072_ref166 – ident: S1471068422000072_ref50 doi: 10.1613/jair.1869 – ident: S1471068422000072_ref102 doi: 10.1017/S1471068418000200 – ident: S1471068422000072_ref189 – ident: S1471068422000072_ref136 doi: 10.1613/jair.1492 – volume-title: Readings in Planning year: 1990 ident: S1471068422000072_ref4 – volume: 4 start-page: 27 year: 1994 ident: S1471068422000072_ref271 article-title: An introduction to least commitment planning publication-title: AI Magazine 15 – ident: S1471068422000072_ref36 doi: 10.3166/jancl.21.9-34 – ident: S1471068422000072_ref232 – ident: S1471068422000072_ref66 – ident: S1471068422000072_ref144 – ident: S1471068422000072_ref69 doi: 10.1016/S1474-6670(17)36467-4 – ident: S1471068422000072_ref115 doi: 10.1613/jair.1579 – ident: S1471068422000072_ref79 doi: 10.1080/09528130701538174 – ident: S1471068422000072_ref77 doi: 10.1613/jair.1156 – start-page: 55 year: 2011 ident: S1471068422000072_ref268 article-title: MAPP a scalable multi-agent path planning algorithm with tractability and completeness guarantees publication-title: Journal of Artificial Intelligence Research 42 – ident: S1471068422000072_ref2 doi: 10.1007/978-3-642-20895-9_36 – ident: S1471068422000072_ref104 doi: 10.1007/978-3-642-02846-5_22 – ident: S1471068422000072_ref265 doi: 10.2200/S00091ED1V01Y200705AIM002 – volume-title: Automated Planning and Acting year: 2016 ident: S1471068422000072_ref111 doi: 10.1017/CBO9781139583923 – ident: S1471068422000072_ref237 – ident: S1471068422000072_ref204 doi: 10.1016/j.artint.2012.08.001 – ident: S1471068422000072_ref146 doi: 10.1007/11871842_29 |
| SSID | ssj0016324 |
| Score | 2.4330938 |
| Snippet | Answer Set Planning
refers to the use of
Answer Set Programming (ASP)
to compute
plans
, that is, solutions to planning problems, that transform a given state... Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 226 |
| SubjectTerms | Automation Declarative programming Knowledge Logic programming Mathematical programming Planning Semantics |
| Title | Answer Set Planning: A Survey |
| URI | https://www.proquest.com/docview/2892364260 |
| Volume | 23 |
| WOSCitedRecordID | wos000776673100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: K7- dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB609eDF-sRqW3LwJCy2yabb9SJVWgSlFF8UL2FfAUHS2qQV_707yaZSBC9ecphNIAwzs_P-AM4oVwFX2iddEWtCJZdECh4SYV1TE3ARBvnU-8s9G416kwkfu4Rb6toqS5uYG2o9VZgjv7CBAe46t-731eyDIGoUVlcdhMYmVDu-30E5v2NkVUXAVeT5dBHD7p4eLauauDIaiUjz_bya56_fS-tmOb9rhrX__uUu7Dgv0-sXYrEHGybZh1qJ4OA5hT6AZj9JP5FgMq-EL7r0-t7jYr40X4fwPBw83dwSB5hAlPVCMsJiyQxO41qrQdtKGx77Go9sWMNCGVMRSxvBIJq3jJUJLA94VynKbEQtlabBEVSSaWKOwQuF0O3AWO1tK-qLWEipO1SEOrTxmWS8Du2SXZFy28QR1OI9KtrGWPSLw3U4X30yK1Zp_PVyo2Rw5LQqjX64e_L38SlsIyx8kSppQCWbL0wTttQye0vnLaheD0bjh1YuLPY5Dl-_AeW9waA |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bSwJBFD6YBfWSXcnS2od6CZZ0dtZxggipRNFEyEJ62ea2EMRquir-qX5jM3sxIvDNh17PzC7LnjPnMufyAZxjKhwqJLIrzJc25pTbnFHXZto1VQ5lrhN1vb-0SadT7fdpNwNfaS-MKatMdWKkqOVAmDvyKx0YmFnn2v2-HX7aBjXKZFdTCI1YLFpqPtMh2_imea_5e4FQ_aF317ATVAFbaFMd2sTnRJmWVX20cElIRX0kzZL2_YnLfcx8rt18A3nNfaGcMia0IgQmOuzkQmJHv3cN1jHWW_T56bqvi6yFGX0edTMRU01UxWkW1YyoNkRDQyjKHqLfdvC3GYhsWz333_7KDmwnXrRVi8V-FzIq2INcilBhJQprH4q1YDwzBBVaKTzTtVWzniajqZofwPNKPvIQssEgUEdguYzJkqO0dioJjJjPOJdlzFzp6viTE5qHUsoeTyTT0g1ox4cXl8UR7w9H83C5eGQYjwpZtrmQMtRLtMbY--Hm8fLlM9hs9B7bXrvZaZ3AFtKOV3wtVIBsOJqoImyIafg-Hp1GAmrB26p5_w3YSxyp |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Answer+Set+Planning%3A+A+Survey&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=SON+CAO+TRAN&rft.au=Pontelli%2C+Enrico&rft.au=BALDUCCINI%2C+MARCELLO&rft.au=Schaub%2C+Torsten&rft.date=2023-01-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=1&rft.spage=226&rft.epage=298&rft_id=info:doi/10.1017%2FS1471068422000072 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon |