How to Build Your Own ASP-based System?
Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. Howev...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 23; H. 1; S. 299 - 361 |
|---|---|
| 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 Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP’s ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP’s machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system
clingo
can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on
clingo
’s reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating
clingo
via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is
clingo
’s new
Application
class that allows us to draw on
clingo
’s infrastructure by customizing processes similar to the one in
clingo
. For instance, we may apply manipulations to programs’ abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is
clingo
’s intermediate format,
aspif
, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how
clingo
can be extended by difference constraints and how guess-and-check programming can be implemented with both meta and application programming. |
|---|---|
| AbstractList | Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP’s ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP’s machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system
clingo
can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on
clingo
’s reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating
clingo
via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is
clingo
’s new
Application
class that allows us to draw on
clingo
’s infrastructure by customizing processes similar to the one in
clingo
. For instance, we may apply manipulations to programs’ abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is
clingo
’s intermediate format,
aspif
, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how
clingo
can be extended by difference constraints and how guess-and-check programming can be implemented with both meta and application programming. Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP’s ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP’s machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system clingo can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on clingo’s reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating clingo via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is clingo’s new Application class that allows us to draw on clingo’s infrastructure by customizing processes similar to the one in clingo. For instance, we may apply manipulations to programs’ abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is clingo’s intermediate format, aspif, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how clingo can be extended by difference constraints and how guess-and-check programming can be implemented with both meta and application programming. |
| Author | ROMERO, JAVIER WANKO, PHILIPP KAMINSKI, ROLAND SCHAUB, TORSTEN |
| Author_xml | – sequence: 1 givenname: ROLAND orcidid: 0000-0002-1361-6045 surname: KAMINSKI fullname: KAMINSKI, ROLAND – sequence: 2 givenname: JAVIER orcidid: 0000-0001-5546-9939 surname: ROMERO fullname: ROMERO, JAVIER – sequence: 3 givenname: TORSTEN orcidid: 0000-0002-7456-041X surname: SCHAUB fullname: SCHAUB, TORSTEN – sequence: 4 givenname: PHILIPP orcidid: 0000-0003-4986-4881 surname: WANKO fullname: WANKO, PHILIPP |
| BookMark | eNp9kE9Lw0AQxRepYFv9AN4CHjxFZ_ZPdnOSWqoVChWqB09hk-xCSputuxtKv72p9aTgaYaZ95s3vBEZtK41hFwj3CGgvF8hlwiZ4hQBQIA6I8N-JFIGCgffPabH_QUZhbAGwIxRPiS3c7dPokseu2ZTJx-u88ly3yaT1Wta6mDqZHUI0WwfLsm51Ztgrn7qmLw_zd6m83SxfH6ZThZpxRSNqVTISpBQG52jVaUQIPMaqeGa28pgXnItGbUclZGGZ0LbilW1rVkmDCrNxuTmdHfn3WdnQizW_U9tb1lQlVOWcSqyXoUnVeVdCN7YYuebrfaHAqE45lH8yaNn5C-maqKOjWuj183mH_ILfJVibg |
| CitedBy_id | crossref_primary_10_4204_EPTCS_416_38 crossref_primary_10_1017_S1471068421000296 crossref_primary_10_1093_logcom_exae036 crossref_primary_10_3390_electronics13071404 crossref_primary_10_1017_S1471068425100264 crossref_primary_10_4204_EPTCS_416_19 crossref_primary_10_1016_j_artint_2024_104276 crossref_primary_10_1017_S1471068425100094 crossref_primary_10_3390_a16040179 crossref_primary_10_1016_j_artint_2023_104023 crossref_primary_10_3233_IA_240019 crossref_primary_10_1007_s10766_024_00763_2 crossref_primary_10_1080_13875868_2024_2324875 crossref_primary_10_1017_S1471068424000449 |
| Cites_doi | 10.24963/kr.2020/20 10.1017/S1471068416000284 10.1017/CBO9781139342124 10.1007/978-3-030-20528-7_19 10.1145/1183278.1183279 10.1145/502807.502810 10.1007/s13218-018-0528-x 10.1007/978-1-4615-1567-8_12 10.1017/S1471068418000054 10.1007/978-3-319-61033-7_6 10.1017/S1471068415000150 10.1007/s10472-009-9116-y 10.1017/CBO9780511543357 10.1017/S1471068417000138 10.1609/aimag.v37i3.2673 10.1017/S1471068418000455 10.1145/383779.383783 10.1145/2967973.2968594 10.1017/S1471068417000242 10.1007/978-3-642-20832-4_8 10.1007/BFb0054795 10.3233/AIC-2011-0491 10.1007/978-3-319-23264-5 10.1007/978-3-319-23264-5_5 10.1007/11814948_19 10.1017/S1471068403001753 10.1007/BFb0023801 10.1145/1149114.1149117 10.24963/ijcai.2020/234 10.1016/S0004-3702(02)00187-X 10.1016/j.artint.2019.04.004 10.1007/BF01536399 10.1007/978-3-319-11558-0 10.1007/s13218-018-0535-y 10.1007/978-3-540-89982-2_23 10.1016/j.artint.2012.04.001 10.1017/S1471068416000211 10.1017/S1471068418000558 10.1007/978-3-319-11558-0_12 10.1017/S1471068411000548 10.1609/aimag.v37i3.2672 10.1007/978-3-319-23264-5_15 10.1017/S1471068402001539 10.3233/IA-170104 10.1007/3-540-63255-7_32 10.1007/3-540-45241-9_12 10.1017/S1471068420000046 10.1007/978-3-319-61660-5_19 10.1007/978-3-319-11558-0_37 10.1007/978-3-540-24605-3_37 10.1007/978-3-030-20528-7 10.1017/S1471068411000329 10.1017/S1471068405002577 10.1007/978-3-030-24658-7 10.1017/S1471068420000228 10.1145/1217856.1217859 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s), 2021. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| 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/S1471068421000508 |
| 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 Local Electronic Collection Information ProQuest Central Technology Collection ProQuest One Community College ProQuest Central 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 ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) 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 | 361 |
| ExternalDocumentID | 10_1017_S1471068421000508 |
| 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-c382t-7813b070dea91f8b55079d12e4a4fce19b4a732f418e7e465afc3cdfd365e18a3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 27 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000729685200001&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:47:48 EST 2025 Sat Nov 29 04:58:37 EST 2025 Tue Nov 18 21:36:20 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c382t-7813b070dea91f8b55079d12e4a4fce19b4a732f418e7e465afc3cdfd365e18a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-4986-4881 0000-0001-5546-9939 0000-0002-1361-6045 0000-0002-7456-041X |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EF826D6B5BC87BE640227CE3D65FFE18/S1471068421000508a.pdf/div-class-title-how-to-build-your-own-asp-based-system-div.pdf |
| PQID | 2892364256 |
| PQPubID | 43613 |
| PageCount | 63 |
| ParticipantIDs | proquest_journals_2892364256 crossref_primary_10_1017_S1471068421000508 crossref_citationtrail_10_1017_S1471068421000508 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-01 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-01 day: 01 |
| 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 | S1471068421000508_ref28 S1471068421000508_ref64 S1471068421000508_ref21 S1471068421000508_ref65 S1471068421000508_ref22 S1471068421000508_ref66 S1471068421000508_ref23 S1471068421000508_ref67 S1471068421000508_ref68 S1471068421000508_ref24 S1471068421000508_ref25 S1471068421000508_ref69 S1471068421000508_ref26 S1471068421000508_ref27 S1471068421000508_ref60 S1471068421000508_ref61 S1471068421000508_ref62 S1471068421000508_ref63 Calimeri (S1471068421000508_ref20) 2019; 2 S1471068421000508_ref17 S1471068421000508_ref18 S1471068421000508_ref19 S1471068421000508_ref53 Biere (S1471068421000508_ref10) 2009; 185 S1471068421000508_ref54 S1471068421000508_ref55 S1471068421000508_ref11 S1471068421000508_ref12 S1471068421000508_ref56 S1471068421000508_ref13 S1471068421000508_ref57 S1471068421000508_ref14 S1471068421000508_ref58 S1471068421000508_ref15 S1471068421000508_ref59 S1471068421000508_ref1 S1471068421000508_ref16 S1471068421000508_ref90 S1471068421000508_ref91 S1471068421000508_ref50 S1471068421000508_ref51 S1471068421000508_ref52 Dimopoulos (S1471068421000508_ref29) 2018; 3 Gebser (S1471068421000508_ref48) 2012 S1471068421000508_ref42 S1471068421000508_ref86 S1471068421000508_ref87 S1471068421000508_ref43 S1471068421000508_ref44 S1471068421000508_ref88 S1471068421000508_ref89 S1471068421000508_ref45 S1471068421000508_ref46 S1471068421000508_ref47 S1471068421000508_ref49 S1471068421000508_ref2 S1471068421000508_ref3 S1471068421000508_ref4 S1471068421000508_ref80 S1471068421000508_ref81 S1471068421000508_ref5 S1471068421000508_ref82 S1471068421000508_ref6 S1471068421000508_ref7 S1471068421000508_ref83 S1471068421000508_ref40 S1471068421000508_ref84 S1471068421000508_ref8 S1471068421000508_ref41 S1471068421000508_ref9 S1471068421000508_ref85 S1471068421000508_ref39 S1471068421000508_ref75 S1471068421000508_ref31 S1471068421000508_ref76 S1471068421000508_ref32 S1471068421000508_ref33 S1471068421000508_ref77 S1471068421000508_ref78 S1471068421000508_ref34 S1471068421000508_ref79 S1471068421000508_ref35 S1471068421000508_ref36 S1471068421000508_ref37 S1471068421000508_ref38 S1471068421000508_ref70 S1471068421000508_ref71 S1471068421000508_ref72 S1471068421000508_ref73 S1471068421000508_ref30 S1471068421000508_ref74 |
| References_xml | – ident: S1471068421000508_ref17 doi: 10.24963/kr.2020/20 – ident: S1471068421000508_ref58 – ident: S1471068421000508_ref83 – ident: S1471068421000508_ref60 – ident: S1471068421000508_ref30 doi: 10.1017/S1471068416000284 – ident: S1471068421000508_ref54 doi: 10.1017/CBO9781139342124 – ident: S1471068421000508_ref12 – ident: S1471068421000508_ref18 doi: 10.1007/978-3-030-20528-7_19 – ident: S1471068421000508_ref89 doi: 10.1145/1183278.1183279 – ident: S1471068421000508_ref87 – ident: S1471068421000508_ref68 – ident: S1471068421000508_ref27 doi: 10.1145/502807.502810 – ident: S1471068421000508_ref19 – ident: S1471068421000508_ref44 doi: 10.1007/s13218-018-0528-x – ident: S1471068421000508_ref7 doi: 10.1007/978-1-4615-1567-8_12 – ident: S1471068421000508_ref70 – ident: S1471068421000508_ref49 doi: 10.1017/S1471068418000054 – ident: S1471068421000508_ref38 – ident: S1471068421000508_ref62 doi: 10.1007/978-3-319-61033-7_6 – ident: S1471068421000508_ref55 – ident: S1471068421000508_ref42 doi: 10.1017/S1471068415000150 – ident: S1471068421000508_ref71 doi: 10.1007/s10472-009-9116-y – ident: S1471068421000508_ref78 – ident: S1471068421000508_ref6 doi: 10.1017/CBO9780511543357 – ident: S1471068421000508_ref5 doi: 10.1017/S1471068417000138 – ident: S1471068421000508_ref53 doi: 10.1609/aimag.v37i3.2673 – ident: S1471068421000508_ref40 doi: 10.1017/S1471068418000455 – ident: S1471068421000508_ref67 doi: 10.1145/383779.383783 – ident: S1471068421000508_ref41 doi: 10.1145/2967973.2968594 – ident: S1471068421000508_ref59 doi: 10.1017/S1471068417000242 – ident: S1471068421000508_ref80 – ident: S1471068421000508_ref61 doi: 10.1007/978-3-642-20832-4_8 – ident: S1471068421000508_ref84 – ident: S1471068421000508_ref56 doi: 10.1007/BFb0054795 – ident: S1471068421000508_ref45 doi: 10.3233/AIC-2011-0491 – volume: 3 start-page: 477 year: 2018 ident: S1471068421000508_ref29 article-title: plasp 3: Towards effective ASP planning publication-title: Theory and Practice of Logic Programming – ident: S1471068421000508_ref22 doi: 10.1007/978-3-319-23264-5 – ident: S1471068421000508_ref52 – ident: S1471068421000508_ref90 – ident: S1471068421000508_ref3 doi: 10.1007/978-3-319-23264-5_5 – ident: S1471068421000508_ref25 doi: 10.1007/11814948_19 – ident: S1471068421000508_ref34 doi: 10.1017/S1471068403001753 – ident: S1471068421000508_ref76 doi: 10.1007/BFb0023801 – ident: S1471068421000508_ref77 – ident: S1471068421000508_ref64 doi: 10.1145/1149114.1149117 – ident: S1471068421000508_ref26 doi: 10.24963/ijcai.2020/234 – ident: S1471068421000508_ref81 – ident: S1471068421000508_ref8 – ident: S1471068421000508_ref14 – ident: S1471068421000508_ref88 doi: 10.1016/S0004-3702(02)00187-X – volume: 2 start-page: 294 year: 2019 ident: S1471068421000508_ref20 article-title: ASP-Core-2 input language format publication-title: Theory and Practice of Logic Programming 20 – ident: S1471068421000508_ref57 doi: 10.1016/j.artint.2019.04.004 – ident: S1471068421000508_ref85 – ident: S1471068421000508_ref36 doi: 10.1007/BF01536399 – volume: 185 volume-title: Frontiers in Artificial Intelligence and Applications year: 2009 ident: S1471068421000508_ref10 – ident: S1471068421000508_ref39 doi: 10.1007/978-3-319-11558-0 – ident: S1471068421000508_ref35 doi: 10.1007/s13218-018-0535-y – ident: S1471068421000508_ref47 – ident: S1471068421000508_ref43 – ident: S1471068421000508_ref24 – ident: S1471068421000508_ref46 doi: 10.1007/978-3-540-89982-2_23 – ident: S1471068421000508_ref51 doi: 10.1016/j.artint.2012.04.001 – ident: S1471068421000508_ref91 – ident: S1471068421000508_ref86 doi: 10.1017/S1471068416000211 – ident: S1471068421000508_ref31 doi: 10.1017/S1471068418000558 – ident: S1471068421000508_ref11 doi: 10.1007/978-3-319-11558-0_12 – ident: S1471068421000508_ref82 – ident: S1471068421000508_ref33 doi: 10.1017/S1471068411000548 – ident: S1471068421000508_ref63 doi: 10.1609/aimag.v37i3.2672 – ident: S1471068421000508_ref13 doi: 10.1007/978-3-319-23264-5_15 – ident: S1471068421000508_ref28 doi: 10.1017/S1471068402001539 – ident: S1471068421000508_ref21 doi: 10.3233/IA-170104 – ident: S1471068421000508_ref65 – ident: S1471068421000508_ref72 doi: 10.1007/3-540-63255-7_32 – ident: S1471068421000508_ref74 doi: 10.1007/3-540-45241-9_12 – ident: S1471068421000508_ref69 – volume-title: Synthesis Lectures on Artificial Intelligence and Machine Learning year: 2012 ident: S1471068421000508_ref48 – ident: S1471068421000508_ref1 doi: 10.1017/S1471068420000046 – ident: S1471068421000508_ref2 doi: 10.1007/978-3-319-61660-5_19 – ident: S1471068421000508_ref9 doi: 10.1007/978-3-319-11558-0_37 – ident: S1471068421000508_ref23 – ident: S1471068421000508_ref32 doi: 10.1007/978-3-540-24605-3_37 – ident: S1471068421000508_ref4 doi: 10.1007/978-3-030-20528-7 – ident: S1471068421000508_ref16 – ident: S1471068421000508_ref50 doi: 10.1017/S1471068411000329 – ident: S1471068421000508_ref37 doi: 10.1017/S1471068405002577 – ident: S1471068421000508_ref79 – ident: S1471068421000508_ref66 doi: 10.1007/978-3-030-24658-7 – ident: S1471068421000508_ref75 – ident: S1471068421000508_ref15 doi: 10.1017/S1471068420000228 – ident: S1471068421000508_ref73 doi: 10.1145/1217856.1217859 |
| SSID | ssj0016324 |
| Score | 2.430016 |
| Snippet | Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 299 |
| SubjectTerms | Application programming interface Customization Declarative programming Mathematical programming Problem solving Programming languages Workflow |
| Title | How to Build Your Own ASP-based System? |
| URI | https://www.proquest.com/docview/2892364256 |
| Volume | 23 |
| WOSCitedRecordID | wos000729685200001&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/eLvHCXMwpV1bS8MwFA66-eCL84rTOfIgCEJxabImeRqbbAyUWbwxfClpLiBIO7fq_r5JL5Mh7MWXPqQtlJNzyzmn3wfAJaNUYJvKe4ZSB6qtYk9QSawzxAFCMcMin_J9vaeTCZtOeVgW3BblWGXlE3NHrVLpauQ39mDgsM5thO7NPj3HGuW6qyWFxjaoI99HTs_vqLfqIjgo8vzvIuqmexipupoOMtotujUf5RgobD0urbvlPNaMGv_9yn2wV2aZsF-oxQHY0skhaFQMDrA06CNwNU6XMEvhwJFjQ2v5c_iwTGD_KfRceFOwADTvHYOX0fD5duyV1AmexMzPPMoQjq01Ky04Mix2qGVcIV8TQYzUiMdEUOwbgpimmgRdYSSWyigcdDViAp-AWpIm-hRAqqQ9PhtD7L4R4gvOhaKGd7hNTDQLeBN0KsFFssQVd_QWH1ExQEajP7JuguvVK7MCVGPTw61K1FFpX4voV85nm2-fg11HEF8UTVqgls2_9AXYkd_Z-2LeBvXBcBI-tnO1sdew-_YDKA_Deg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JSwMxFH64gV7cxd0cFEEYNEub5CBSl9LSWgUXvI2ZLCBIW9tq8U_5G01mUUTozYPXzMIw7-N7L8nL9wHsCs4V9aV85DgPotomiRTXzJMhLWOcCKrSLt_7Jm-1xMODvB6Dj-IsTGirLDgxJWrT0WGN_NBPDILWuc_QJ92XKLhGhd3VwkIjg0XDvg_9lK1_XD_38d0jpHpxe1aLcleBSFNBBhEXmCYe6MYqiZ1IgqCXNJhYppjTFsuEKU6JY1hYblm5pJym2jhDyyWLhaL-veMwyajgQau_waOvXYsgfZ6eZuKhm0iwYhc1SFSHwTBGcKq5In7mwZ9pIM1t1bn_9lfmYTavolElg_0CjNn2IswVDhUoJ6wl2K91hmjQQafB_Bt5Zuuhq2EbVW6uo5C-DcoE20-W4e5PPncFJtqdtl0FxI3mjDjHPC4ZI0pKZbiTR9IXXlaU5RocFYGKda6bHuw7nuOsQY7Hv2K7Bgdfj3Qz0ZBRN28WoY1z_ujH33FdH315B6Zrt5fNuFlvNTZghvgSLFsg2oSJQe_VbsGUfhs89XvbKVQRPP41Cj4BDCEexQ |
| 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=How+to+Build+Your+Own+ASP-based+System%3F&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=KAMINSKI%2C+ROLAND&rft.au=ROMERO%2C+JAVIER&rft.au=SCHAUB%2C+TORSTEN&rft.au=WANKO%2C+PHILIPP&rft.date=2023-01-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=1&rft.spage=299&rft.epage=361&rft_id=info:doi/10.1017%2FS1471068421000508&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068421000508 |
| 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 |