ASP modulo CSP: The clingcon system
We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an ex...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 12; H. 4-5; S. 485 - 503 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, UK
Cambridge University Press
01.07.2012
|
| Schlagworte: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude. |
|---|---|
| AbstractList | Abstract We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude. [PUBLICATION ABSTRACT] We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude. We present the hybrid ASP solver clingcon , combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets . A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude. |
| Author | OSTROWSKI, MAX SCHAUB, TORSTEN |
| Author_xml | – sequence: 1 givenname: MAX surname: OSTROWSKI fullname: OSTROWSKI, MAX organization: Institut für Informatik, Universität Potsdam – sequence: 2 givenname: TORSTEN surname: SCHAUB fullname: SCHAUB, TORSTEN organization: Institut für Informatik, Universität Potsdam |
| BookMark | eNp9kD1rwzAQhkVJoUnaH9DNkKWLW50-LLtbCP2CQAPObmRJTh1sK5XsIf--SpOhpLTTHXfPc7zcBI062xmEbgHfAwbxkAMTgJOUAcEYAyMXaBxGPKY4hdF3D_Fhf4Um3m8DklDCxmg2z1dRa_XQ2GiRrx6j9YeJVFN3G2W7yO99b9prdFnJxpubU52i9fPTevEaL99f3hbzZawYJH3MEqF4JoxIueZVqQ03RNNEJhnHGlcZ1zgBJklFeMk1UxKUqEquSMoUZRWdorvj2Z2zn4PxfdHWXpmmkZ2xgy9AcMpSmmVpQGdn6NYOrgvhCsCcUUFFSgIljpRy1ntnqkLVvexr2_VO1k1Ai8Pvil-_CyacmTtXt9Lt_3XoyZFt6Wq9MT9D_WV9Ac2xfcM |
| CitedBy_id | crossref_primary_10_1017_S1471068418000455 crossref_primary_10_1017_S1471068417000254 crossref_primary_10_1016_j_artint_2013_10_004 crossref_primary_10_1017_S1471068412000233 crossref_primary_10_1017_S1471068417000187 crossref_primary_10_1017_S1471068422000400 crossref_primary_10_1093_logcom_ext065 crossref_primary_10_1016_j_artint_2020_103402 crossref_primary_10_1017_S1471068418000558 crossref_primary_10_1017_S1471068417000138 crossref_primary_10_1017_S1471068418000054 crossref_primary_10_1017_S1471068415000113 crossref_primary_10_1017_S1471068416000569 crossref_primary_10_1007_s10845_017_1333_3 crossref_primary_10_3390_electronics11121888 crossref_primary_10_1080_13875868_2024_2324875 crossref_primary_10_1609_aimag_v37i3_2672 crossref_primary_10_1007_s10472_023_09914_6 crossref_primary_10_1609_aimag_v37i3_2673 crossref_primary_10_3390_a16040185 crossref_primary_10_1017_S1471068422000072 |
| Cites_doi | 10.1007/978-3-540-70545-1_27 10.1145/1217856.1217859 10.1016/0004-3702(86)90083-4 10.1017/CBO9780511543357 10.1007/s10472-009-9118-9 10.1007/11814948_17 10.1007/s10472-009-9116-y 10.1287/ijoc.3.2.157 10.1017/S1471068411000329 10.1007/BF03037169 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2012 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2012 |
| 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/S1471068412000142 |
| 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 (New) 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 | Computer Science Database Computer and Information Systems Abstracts 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 |
| EISSN | 1475-3081 |
| EndPage | 503 |
| ExternalDocumentID | 2768100291 10_1017_S1471068412000142 |
| Genre | Feature |
| 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 PUEGO |
| ID | FETCH-LOGICAL-c416t-467c597e785d5fbde5e2d36a6950d0f95d0614a2f25b5d4ca1c7fb5c284c34f3 |
| IEDL.DBID | P5Z |
| ISICitedReferencesCount | 49 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000308365000005&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 Sep 05 10:21:16 EDT 2025 Fri Jul 25 03:54:52 EDT 2025 Tue Nov 18 22:20:56 EST 2025 Sat Nov 29 04:58:34 EST 2025 Wed Mar 13 05:51:25 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4-5 |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c416t-467c597e785d5fbde5e2d36a6950d0f95d0614a2f25b5d4ca1c7fb5c284c34f3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1054373782 |
| PQPubID | 43613 |
| PageCount | 19 |
| ParticipantIDs | proquest_miscellaneous_1753483998 proquest_journals_1054373782 crossref_citationtrail_10_1017_S1471068412000142 crossref_primary_10_1017_S1471068412000142 cambridge_journals_10_1017_S1471068412000142 |
| PublicationCentury | 2000 |
| PublicationDate | 20120700 2012-07-00 20120701 |
| PublicationDateYYYYMMDD | 2012-07-01 |
| PublicationDate_xml | – month: 07 year: 2012 text: 20120700 |
| 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 | 2012 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068412000142_ref16 S1471068412000142_ref14 S1471068412000142_ref18 van Loon (S1471068412000142_ref31) 1981 Drescher (S1471068412000142_ref11) 2010 S1471068412000142_ref17 S1471068412000142_ref30 S1471068412000142_ref12 S1471068412000142_ref32 Gebser (S1471068412000142_ref13) 2011 Dechter (S1471068412000142_ref10) 2003 Gebser (S1471068412000142_ref15) 2007 Mellarkod (S1471068412000142_ref22) 2008 Dal Palù (S1471068412000142_ref9) 2009 S1471068412000142_ref27 S1471068412000142_ref26 S1471068412000142_ref25 S1471068412000142_ref24 S1471068412000142_ref8 S1471068412000142_ref29 S1471068412000142_ref6 S1471068412000142_ref28 S1471068412000142_ref7 Baselice (S1471068412000142_ref4) 2005 S1471068412000142_ref23 S1471068412000142_ref21 S1471068412000142_ref20 Hill (S1471068412000142_ref19) 2009 S1471068412000142_ref2 S1471068412000142_ref3 S1471068412000142_ref1 Biere (S1471068412000142_ref5) 2009 |
| References_xml | – ident: S1471068412000142_ref1 – ident: S1471068412000142_ref6 doi: 10.1007/978-3-540-70545-1_27 – ident: S1471068412000142_ref17 – start-page: 352 volume-title: Proceedings of LPNMR'11 year: 2011 ident: S1471068412000142_ref13 – ident: S1471068412000142_ref27 doi: 10.1145/1217856.1217859 – ident: S1471068412000142_ref25 doi: 10.1016/0004-3702(86)90083-4 – start-page: 465 volume-title: TPLP year: 2010 ident: S1471068412000142_ref11 – ident: S1471068412000142_ref29 – start-page: 52 volume-title: Proceedings of ICLP'05 year: 2005 ident: S1471068412000142_ref4 – ident: S1471068412000142_ref8 – ident: S1471068412000142_ref21 – ident: S1471068412000142_ref3 doi: 10.1017/CBO9780511543357 – ident: S1471068412000142_ref2 – volume-title: Proceedings of ICLP'09 year: 2009 ident: S1471068412000142_ref19 – start-page: 283 volume-title: European Journal of Operational Research year: 1981 ident: S1471068412000142_ref31 – ident: S1471068412000142_ref26 doi: 10.1007/s10472-009-9118-9 – start-page: 386 volume-title: Proceedings of IJCAI'07 year: 2007 ident: S1471068412000142_ref15 – start-page: 115 volume-title: Answer set programming with constraints using lazy grounding year: 2009 ident: S1471068412000142_ref9 – ident: S1471068412000142_ref16 – ident: S1471068412000142_ref32 doi: 10.1007/11814948_17 – volume-title: Handbook of Satisfiability year: 2009 ident: S1471068412000142_ref5 – ident: S1471068412000142_ref30 – ident: S1471068412000142_ref12 – ident: S1471068412000142_ref23 doi: 10.1007/s10472-009-9116-y – ident: S1471068412000142_ref7 doi: 10.1287/ijoc.3.2.157 – start-page: 15 volume-title: Proceedings of FLOPS'08 year: 2008 ident: S1471068412000142_ref22 – ident: S1471068412000142_ref14 doi: 10.1017/S1471068411000329 – volume-title: Constraint Processing year: 2003 ident: S1471068412000142_ref10 – ident: S1471068412000142_ref28 – ident: S1471068412000142_ref18 doi: 10.1007/BF03037169 – ident: S1471068412000142_ref24 – ident: S1471068412000142_ref20 |
| SSID | ssj0016324 |
| Score | 2.2280045 |
| Snippet | We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming... We present the hybrid ASP solver clingcon , combining the simple modeling language and the high performance Boolean solving capacities of Answer Set... Abstract We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 485 |
| SubjectTerms | Boolean algebra Computer models Learning Logic programming Mathematical models Programming Programming languages Regular Papers Solvers Syntax |
| Title | ASP modulo CSP: The clingcon system |
| URI | https://www.cambridge.org/core/product/identifier/S1471068412000142/type/journal_article https://www.proquest.com/docview/1054373782 https://www.proquest.com/docview/1753483998 |
| Volume | 12 |
| WOSCitedRecordID | wos000308365000005&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: 20241209 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: 20241209 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: 20241209 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/eLvHCXMwpV3NS8MwFH-4zYMX5ydO56joSQx0adO0XmSODUEZxQ0ZXkabDxFmO_fh32_SpmVD2MVrmpSQ95338nsANzYLuJCSIRl7AXKxwCjwPYZwmzmu8hc4z9A-317oYOCPx0FoLtwWpqyy0ImZouYp03fkSrqJRuFRBu1h9o101yidXTUtNCpQ0ygJunVDSN7LLIKGIs9eF1Fd3eO7RVZTQ0brQT3WxlmYgNexFTZt1KaKzuxOv_7fHR_AvvE4rU7OIoewI5IjqBfdHCwj3Mdw3RmG1lfKV9PU6g7De0txkKUfTn6okNnKEZ9PYNTvjbpPyLRQQEx5Wkuk1CBTIYOgPuFExlwQgbnjRV5AbG7LgHAdEUZYYhIT7rKozaiMCVNGS9FKOqdQTdJEnIEVYS_gNmZY2I42aDGNPE4Eodgh0naiBtyV5zcxcrCY5DVkdPLnuBtgF0c8YQaNXDfFmG5bclsumeVQHNsmNwuirO-moEgDrsrPSp50kiRKRLpSc1T85iqvMfDPt__iAvaU82RKd5tQXc5X4hJ22c_yczFvQe2xNwhfW1B5pqiVseUvNhXf6A |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JS8NAFH64gV7cxbqOqBdxIJ1kMokgIi4oraVgEW8hmUWEmqhtFX-U_9E3WYoi9ObB62wMeXvem-8B7DkyVNoYSU3ih9RjmtEw8CVldel66C8olaN93jVFqxXc34ftMfis3sLYsspKJ-aKWmXS_iNH6eYWhQcN2snzC7Vdo2x2tWqhUbBFQ3-8Y8jWO74-R_ruM3Z50Tm7omVXASrR-ehT1AwSvWgtAq64SZTmminXj_2QO8oxIVc2SIqZYTzhypNxXQqTcIl6HK9vXDx2HCY9NxBWrBqCDpMWFvk8f8wkbDFR4FVJVItQbQftWJ3lUQn7DuXw0yT-tAi5mbuc-2cfaB5mS3-anBYCsABjOl2EuapXBSlV1xLsnt62yVOmBt2MnN22jwjKB7HPQh9klpICz3oZOn9x0xWYSLNUrwKJmR8qh0mmHdea60TEvuKaC-Zy47hxDQ6H5IpKKe9FRYWciH5RtwZORdFIlljrtuVHd9SWg-GW5wJoZNTijYoHvt-mYoAa7AynUVvYFFCc6myAazA69dAnDoO10Udsw_RV56YZNa9bjXWYQTexLFLegIn-60BvwpR86z_2XrdyGSAQ_TFLfQHY9jno |
| 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=ASP+modulo+CSP%3A+The+clingcon+system&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=OSTROWSKI%2C+MAX&rft.au=SCHAUB%2C+TORSTEN&rft.date=2012-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=12&rft.issue=4-5&rft.spage=485&rft_id=info:doi/10.1017%2FS1471068412000142&rft.externalDocID=2768100291 |
| 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 |