CASP solutions for planning in hybrid domains
Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 17; H. 4; S. 591 - 633 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, UK
Cambridge University Press
01.07.2017
|
| Schlagworte: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution. |
|---|---|
| AbstractList | Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution. Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution. |
| Author | MAGAZZENI, DANIELE BALDUCCINI, MARCELLO MARATEA, MARCO LEBLANC, EMILY C. |
| Author_xml | – sequence: 1 givenname: MARCELLO surname: BALDUCCINI fullname: BALDUCCINI, MARCELLO email: marcello.balduccini@gmail.com organization: Saint Joseph's University, Department of Decision and Support Services, 5600 City Avenue, Philadelphia, PA 19131, USA (e-mail: marcello.balduccini@gmail.com) – sequence: 2 givenname: DANIELE surname: MAGAZZENI fullname: MAGAZZENI, DANIELE email: daniele.magazzeni@kcl.ac.uk organization: King's College London, Department of Informatics, The Strand, London, WC2R 2LS, England (e-mail: daniele.magazzeni@kcl.ac.uk) – sequence: 3 givenname: MARCO surname: MARATEA fullname: MARATEA, MARCO email: marco@dibris.unige.it organization: University of Genoa, Italy (e-mail: marco@dibris.unige.it) – sequence: 4 givenname: EMILY C. surname: LEBLANC fullname: LEBLANC, EMILY C. email: ecl38@drexel.edu organization: Drexel University, Computer Science Department, 3141 Chestnut Avenue, PA 19104, USA (e-mail: ecl38@drexel.edu) |
| BookMark | eNp9kE9PwyAYxomZidv0A3hr4rnKC7TQ47KoM1miyfTcQAuTpYUJ7WHf3tbtYDR6ev89v_eFZ4YmzjuN0DXgW8DA7zbAOOBcMOAYYxD8DE2HVpZSLGDylUM6zi_QLMbdIMkpYVOULheblyT6pu-sdzExPiT7Rjpn3TaxLnk_qGDrpPattC5eonMjm6ivTnGO3h7uX5erdP38-LRcrNOKAu9SDVIZU2RAc0mVJkqMBcMkF5xUqlaFIYZhSUxBGa2YFibDuWYM57UomKJzdHPcuw_-o9exK3e-D244WUJBBi2Hgg8qflRVwccYtCkr28nxH12QtikBl6M35S9vBhJ-kPtgWxkO_zL0xMh29GSrvz3qT-oTrSN0sg |
| CitedBy_id | crossref_primary_10_1017_S1471068421000478 crossref_primary_10_1017_S0269888921000072 crossref_primary_10_1017_S1471068419000061 crossref_primary_10_1017_S1471068422000072 |
| Cites_doi | 10.1145/41625.41635 10.1109/TIME.2000.856584 10.1145/2562059.2562130 10.1007/3-540-45873-5_34 10.1023/A:1018930122475 10.1145/2562059.2562137 10.1007/BF03037169 10.1145/2883817.2883849 10.1613/jair.3608 10.1007/s10472-006-9026-1 10.1016/j.artint.2013.10.004 10.7551/mitpress/4074.001.0001 10.1609/icaps.v21i1.13453 10.1007/s10472-009-9116-y 10.1007/978-3-319-08867-9_22 10.1007/978-3-642-60085-2_17 10.1007/s10489-011-0306-z 10.1016/S1574-6526(06)80016-7 10.1016/S1574-6526(06)80015-5 10.1613/jair.3643 10.1609/icaps.v26i1.13777 10.1145/2461328.2461380 10.1109/LICS.1996.561342 10.1609/icaps.v19i1.13352 10.1007/3-540-63912-8_81 10.1109/ICRA.2011.5980479 10.1017/CBO9780511543357 10.1017/S1471068412000142 10.1007/11562931_7 10.1109/ICRA.2014.6907292 10.1109/ICTAI.2004.120 10.1016/0743-1066(93)90035-F 10.1007/s10009-012-0233-2 10.1016/S0004-3702(02)00186-8 10.1016/j.artint.2005.04.001 10.1613/jair.2044 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2017 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2017 |
| 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/S1471068417000187 |
| 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 & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database 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 (New) 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 | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | M. Balduccini et al. CASP solutions for planning in hybrid domains |
| EISSN | 1475-3081 |
| EndPage | 633 |
| ExternalDocumentID | 10_1017_S1471068417000187 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 3V. 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS 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 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 M0N NIKVX O9- OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFFHD AFZFC AKMAY CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c317t-e1abff95136a3be2b8f9514026872cbdb9f2f40a2f9343c4e8f506e4406d894b3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000407039000007&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 | Fri Jul 25 19:55:39 EDT 2025 Sat Nov 29 04:58:36 EST 2025 Tue Nov 18 22:01:36 EST 2025 Wed Mar 13 05:52:03 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | planning Answer set programming hybrid domains |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-e1abff95136a3be2b8f9514026872cbdb9f2f40a2f9343c4e8f506e4406d894b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1925067197 |
| PQPubID | 43613 |
| PageCount | 43 |
| ParticipantIDs | proquest_journals_1925067197 crossref_citationtrail_10_1017_S1471068417000187 crossref_primary_10_1017_S1471068417000187 cambridge_journals_10_1017_S1471068417000187 |
| PublicationCentury | 2000 |
| PublicationDate | 20170700 2017-07-00 20170701 |
| PublicationDateYYYYMMDD | 2017-07-01 |
| PublicationDate_xml | – month: 07 year: 2017 text: 20170700 |
| PublicationDecade | 2010 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationTitleAlternate | Theory and Practice of Logic Programming |
| PublicationYear | 2017 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068417000187_ref39 S1471068417000187_ref37 S1471068417000187_ref38 S1471068417000187_ref36 S1471068417000187_ref33 S1471068417000187_ref34 S1471068417000187_ref31 S1471068417000187_ref32 Reiter (S1471068417000187_ref55) 2001 S1471068417000187_ref30 S1471068417000187_ref28 S1471068417000187_ref29 S1471068417000187_ref27 S1471068417000187_ref25 S1471068417000187_ref22 S1471068417000187_ref23 S1471068417000187_ref20 S1471068417000187_ref21 Katriel (S1471068417000187_ref35) 2006 S1471068417000187_ref60 Balduccini (S1471068417000187_ref5) 2013; 13 S1471068417000187_ref9 S1471068417000187_ref8 S1471068417000187_ref7 S1471068417000187_ref6 S1471068417000187_ref4 S1471068417000187_ref3 S1471068417000187_ref2 S1471068417000187_ref1 S1471068417000187_ref17 S1471068417000187_ref18 S1471068417000187_ref59 S1471068417000187_ref15 S1471068417000187_ref16 S1471068417000187_ref13 S1471068417000187_ref57 S1471068417000187_ref14 S1471068417000187_ref58 S1471068417000187_ref11 S1471068417000187_ref56 S1471068417000187_ref12 S1471068417000187_ref53 S1471068417000187_ref54 S1471068417000187_ref10 S1471068417000187_ref51 S1471068417000187_ref52 Fox (S1471068417000187_ref24) 2006; 27 S1471068417000187_ref50 Coles (S1471068417000187_ref19) 2012; 44 S1471068417000187_ref49 S1471068417000187_ref46 S1471068417000187_ref47 S1471068417000187_ref44 S1471068417000187_ref45 S1471068417000187_ref42 Nau (S1471068417000187_ref48) 2004 S1471068417000187_ref43 S1471068417000187_ref40 S1471068417000187_ref41 Fox (S1471068417000187_ref26) 2012; 44 |
| References_xml | – ident: S1471068417000187_ref33 doi: 10.1145/41625.41635 – ident: S1471068417000187_ref20 – ident: S1471068417000187_ref14 doi: 10.1109/TIME.2000.856584 – ident: S1471068417000187_ref31 doi: 10.1145/2562059.2562130 – ident: S1471068417000187_ref59 doi: 10.1007/3-540-45873-5_34 – ident: S1471068417000187_ref49 doi: 10.1023/A:1018930122475 – ident: S1471068417000187_ref7 – ident: S1471068417000187_ref41 doi: 10.1145/2562059.2562137 – ident: S1471068417000187_ref3 – ident: S1471068417000187_ref47 – ident: S1471068417000187_ref11 – ident: S1471068417000187_ref28 doi: 10.1007/BF03037169 – ident: S1471068417000187_ref1 doi: 10.1145/2883817.2883849 – volume: 44 start-page: 1 year: 2012 ident: S1471068417000187_ref19 article-title: COLIN: Planning with continuous linear numeric change publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.3608 – ident: S1471068417000187_ref15 – start-page: 169 volume-title: Handbook of Constraint Programming year: 2006 ident: S1471068417000187_ref35 – ident: S1471068417000187_ref53 – ident: S1471068417000187_ref38 – volume-title: Automated Planning: Theory and Practice year: 2004 ident: S1471068417000187_ref48 – ident: S1471068417000187_ref4 doi: 10.1007/s10472-006-9026-1 – ident: S1471068417000187_ref39 doi: 10.1016/j.artint.2013.10.004 – volume-title: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems year: 2001 ident: S1471068417000187_ref55 doi: 10.7551/mitpress/4074.001.0001 – ident: S1471068417000187_ref25 doi: 10.1609/icaps.v21i1.13453 – ident: S1471068417000187_ref46 doi: 10.1007/s10472-009-9116-y – ident: S1471068417000187_ref13 doi: 10.1007/978-3-319-08867-9_22 – ident: S1471068417000187_ref43 doi: 10.1007/978-3-642-60085-2_17 – ident: S1471068417000187_ref10 – ident: S1471068417000187_ref21 doi: 10.1007/s10489-011-0306-z – ident: S1471068417000187_ref44 doi: 10.1016/S1574-6526(06)80016-7 – ident: S1471068417000187_ref58 doi: 10.1016/S1574-6526(06)80015-5 – ident: S1471068417000187_ref18 – ident: S1471068417000187_ref56 – ident: S1471068417000187_ref45 – volume: 44 start-page: 335 year: 2012 ident: S1471068417000187_ref26 article-title: Plan-based policies for efficient multiple battery load management publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.3643 – ident: S1471068417000187_ref52 doi: 10.1609/icaps.v26i1.13777 – ident: S1471068417000187_ref42 doi: 10.1145/2461328.2461380 – ident: S1471068417000187_ref9 – ident: S1471068417000187_ref60 – ident: S1471068417000187_ref30 doi: 10.1109/LICS.1996.561342 – ident: S1471068417000187_ref51 – ident: S1471068417000187_ref22 doi: 10.1609/icaps.v19i1.13352 – ident: S1471068417000187_ref36 – ident: S1471068417000187_ref17 doi: 10.1007/3-540-63912-8_81 – ident: S1471068417000187_ref34 doi: 10.1109/ICRA.2011.5980479 – ident: S1471068417000187_ref23 – ident: S1471068417000187_ref6 doi: 10.1017/CBO9780511543357 – ident: S1471068417000187_ref50 doi: 10.1017/S1471068412000142 – ident: S1471068417000187_ref8 doi: 10.1007/11562931_7 – ident: S1471068417000187_ref27 – ident: S1471068417000187_ref37 doi: 10.1109/ICRA.2014.6907292 – ident: S1471068417000187_ref32 doi: 10.1109/ICTAI.2004.120 – ident: S1471068417000187_ref29 doi: 10.1016/0743-1066(93)90035-F – ident: S1471068417000187_ref2 – ident: S1471068417000187_ref54 doi: 10.1007/s10009-012-0233-2 – ident: S1471068417000187_ref12 – ident: S1471068417000187_ref40 doi: 10.1016/S0004-3702(02)00186-8 – ident: S1471068417000187_ref16 – ident: S1471068417000187_ref57 doi: 10.1016/j.artint.2005.04.001 – volume: 27 start-page: 235 year: 2006 ident: S1471068417000187_ref24 article-title: Modelling mixed discrete-continuous domains for planning publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.2044 – volume: 13 year: 2013 ident: S1471068417000187_ref5 article-title: Integration schemas for constraint answer set programming: A case study publication-title: Theory and Practice of Logic Programming |
| SSID | ssj0016324 |
| Score | 2.186741 |
| Snippet | Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 591 |
| SubjectTerms | Constraints Mathematical models Regular Papers Solvers Viability |
| Title | CASP solutions for planning in hybrid domains |
| URI | https://www.cambridge.org/core/product/identifier/S1471068417000187/type/journal_article https://www.proquest.com/docview/1925067197 |
| Volume | 17 |
| WOSCitedRecordID | wos000407039000007&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/eLvHCXMwpV3NS8MwFA-6efDi_MTpHDl4EoNrkjXJSebYEJRR_GJ4GUma4kC7uU7B_96kS8uGsIuXQtMGHsnLey95L78fAOdS6pC3HcqnMBrRGDOkGCHIugIRh9Jwk2d0X-7ZYMCHQxH5A7fMl1UWNjE31PFEuzPyKxuJtK1lDQS7nn4ixxrlsqueQmMTVAOMA6fndwyVWQQHRZ7fLmKuuofTIqvpIKNdo2tz-HSOmG4ZW2HVR62a6Nzv9Gv_lXgX7PiIE3YWKrIHNky6D2oFmwP0i_sAoG7nMYKlKkIbzcKppzSC4xS-_TixYTz5kOM0OwTP_d5T9xZ5MgWkbYgwRyaQKklsPEVCSZTBirsXu3sMOcNaxUokOKEtiRNBKNHU8MRKb6h1-DEXVJEjUEknqTkGkFImsdQmFJJQ62SFspuSRIUqEBRTHtfBZTmUI78kstGinIyN_ox8HbSK0R5pD0zu-DHe13W5KLtMF6gc635uFPOzJE05OSfrP5-Cbew8eV6h2wCV-ezLnIEt_T0fZ7MmqN70BtFDM9c7-4zar7-32tjS |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bS8MwFD54A31xXvEyNQ_6Iga3NGuSBxHxwmRzDLwgvtQkTXGg3dymsj_lbzTp2jIR9rYHH5s2bci595x8B2BfSu3zikP5FEZjGhKGFfM8bE2BCH1puEkyug911mjwx0fRnILv7CyMK6vMdGKiqMO2dv_Ij60nUrGatSzYaecdu65RLruatdAYskXNDL5syNY7ub6w9D0g5Ory7ryK064CWFtb2cemLFUUWcfC86WnDFHcXdgwyueMaBUqEZGIliSJhEc9TQ2P7IcNtZYv5IIqz753GmYptcGSlZ9m5SnPWjjo8-Q0E3PVRJxmWVQHUe0G3ZjDw3ON8EaxHH7bxN8mIbFzV4X_tkNLsJh61OhsKALLMGXiFShk3SpQqrxWAZ-f3TZRLmrIeuuok7ZsQq0YvQzcNqGw_SZbcW8N7iey6HWYidux2QBEKZNEauML6VHrRAhlg65I-aosKKE83ISjnHRBKvK9YFgux4I_lN6EUkbdQKfA667_x-u4KYf5lM4QdWTcw8WMH0ZWkzPD1vjbezBfvbupB_XrRm0bFojzWpJq5CLM9LsfZgfm9Ge_1evuJryO4HnSrPMDZlgzUQ |
| 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=CASP+solutions+for+planning+in+hybrid+domains&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=BALDUCCINI%2C+MARCELLO&rft.au=MAGAZZENI%2C+DANIELE&rft.au=MARATEA%2C+MARCO&rft.au=LEBLANC%2C+EMILY+C.&rft.date=2017-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=17&rft.issue=4&rft.spage=591&rft.epage=633&rft_id=info:doi/10.1017%2FS1471068417000187&rft.externalDocID=10_1017_S1471068417000187 |
| 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 |