On relation between constraint answer set programming and satisfiability modulo theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these t...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 17; číslo 4; s. 559 - 590 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.07.2017
|
| Témata: | |
| ISSN: | 1471-0684, 1475-3081 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the precise formal relation between them. We believe that this work will boost the cross-fertilization of the theoretical foundations and the existing solving methods in both areas. As a step in this direction, we provide a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiability modulo theories solvers for computing answer sets of constraint answer set programs. |
|---|---|
| AbstractList | Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the precise formal relation between them. We believe that this work will boost the cross-fertilization of the theoretical foundations and the existing solving methods in both areas. As a step in this direction, we provide a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiability modulo theories solvers for computing answer sets of constraint answer set programs. |
| Author | LIERLER, YULIYA SUSMAN, BENJAMIN |
| Author_xml | – sequence: 1 givenname: YULIYA surname: LIERLER fullname: LIERLER, YULIYA email: ylierler@unomaha.edu organization: Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182, USA (e-mails: ylierler@unomaha.edu, bsusman@unomaha.edu) – sequence: 2 givenname: BENJAMIN surname: SUSMAN fullname: SUSMAN, BENJAMIN email: ylierler@unomaha.edu organization: Department of Computer Science, University of Nebraska at Omaha, Omaha, NE 68182, USA (e-mails: ylierler@unomaha.edu, bsusman@unomaha.edu) |
| BookMark | eNp9kE1LAzEQhoMo2FZ_gLeA59XMZrPZPUrxCwo9qOBtySbZmrKb1CSl9N-bfhxE0dMMM-8zM--M0al1ViN0BeQGCPDbFyg4kLIqgBNCAIoTNEolllFSwek-h2zXP0fjEJZJUtK8GKH3ucVe9yIaZ3Gr40Zri6WzIXphbMTCho32OOiIV94tvBgGYxeprHBIUOiMaE1v4hYPTq17h-OHdt7ocIHOOtEHfXmME_T2cP86fcpm88fn6d0skxR4zJjkTOek7nKtKIiuErxmjOZ1IUEVCsq6ooKyqqWCFZQLrdqKSiHaXMlkSdEJuj7MTed9rnWIzdKtvU0rG6hzRsqyJjSp-EElvQvB666RJu5N73z2DZBm98bm1xsTCT_IlTeD8Nt_GXpkxNB6oxb621F_Ul9ChoYs |
| CitedBy_id | crossref_primary_10_1017_S1471068422000400 crossref_primary_10_1017_S1471068422000047 crossref_primary_10_1017_S1471068421000478 |
| Cites_doi | 10.1007/978-3-319-23264-5_13 10.1007/978-3-540-27775-0_6 10.1007/978-3-540-89982-2_37 10.1007/s10472-009-9116-y 10.1109/FMCAD.2014.6987606 10.1007/11513988_33 10.1017/S1471068403001923 10.1007/978-3-642-22110-1_14 10.7551/mitpress/5625.001.0001 10.1007/978-3-540-72200-7_9 10.1007/978-1-4615-1567-8_21 10.1007/978-3-540-72200-7_24 10.1017/S1471068413000343 10.1142/S0218194096000053 10.1016/j.artint.2013.10.004 10.1007/s10472-009-9118-9 10.1007/978-1-4684-3384-5_11 10.1023/A:1018978005636 10.1007/3-540-45635-X_24 10.1017/S1471068417000102 10.1007/978-3-642-02846-5_22 10.1017/S1471068411000445 |
| 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/S1471068417000114 |
| 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 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 ProQuest advanced technologies & aerospace journals 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 | 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 |
| DocumentTitleAlternate | On relation between CASP and SMT Y. Lierler and B. Susman |
| EISSN | 1475-3081 |
| EndPage | 590 |
| ExternalDocumentID | 10_1017_S1471068417000114 |
| 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-5c75e209f2ed31af8a79553294c1d4d16983a358b3a5437aedb83caab2dc471d3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000407039000006&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 Jul 13 05:18:59 EDT 2025 Sat Nov 29 04:58:36 EST 2025 Tue Nov 18 21:51:30 EST 2025 Wed Mar 13 05:52:03 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | satisfiability modulo theories constraint satisfaction processing constraint answer set programming |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-5c75e209f2ed31af8a79553294c1d4d16983a358b3a5437aedb83caab2dc471d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1925066903 |
| PQPubID | 43613 |
| PageCount | 32 |
| ParticipantIDs | proquest_journals_1925066903 crossref_citationtrail_10_1017_S1471068417000114 crossref_primary_10_1017_S1471068417000114 cambridge_journals_10_1017_S1471068417000114 |
| 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 | S1471068417000114_ref5 S1471068417000114_ref4 S1471068417000114_ref1 S1471068417000114_ref3 S1471068417000114_ref2 S1471068417000114_ref9 S1471068417000114_ref21 S1471068417000114_ref42 S1471068417000114_ref8 S1471068417000114_ref40 S1471068417000114_ref25 S1471068417000114_ref24 S1471068417000114_ref23 S1471068417000114_ref22 S1471068417000114_ref29 Eiter (S1471068417000114_ref15) 2012; 12 S1471068417000114_ref28 S1471068417000114_ref27 S1471068417000114_ref26 Gebser (S1471068417000114_ref20) 2014 Barrett (S1471068417000114_ref6) 2008 Carlsson (S1471068417000114_ref11) 2014 Wielemaker (S1471068417000114_ref41) 2012; 12 S1471068417000114_ref10 S1471068417000114_ref32 S1471068417000114_ref31 Marriott (S1471068417000114_ref34) 1998 S1471068417000114_ref30 S1471068417000114_ref14 S1471068417000114_ref36 S1471068417000114_ref35 S1471068417000114_ref13 S1471068417000114_ref12 S1471068417000114_ref33 S1471068417000114_ref39 S1471068417000114_ref17 S1471068417000114_ref16 S1471068417000114_ref38 S1471068417000114_ref37 Barrett (S1471068417000114_ref7) 2014 S1471068417000114_ref19 Fages (S1471068417000114_ref18) 1994; 1 |
| References_xml | – ident: S1471068417000114_ref9 doi: 10.1007/978-3-319-23264-5_13 – ident: S1471068417000114_ref39 – ident: S1471068417000114_ref16 doi: 10.1007/978-3-540-27775-0_6 – ident: S1471068417000114_ref10 doi: 10.1007/978-3-540-89982-2_37 – ident: S1471068417000114_ref35 doi: 10.1007/s10472-009-9116-y – ident: S1471068417000114_ref26 doi: 10.1109/FMCAD.2014.6987606 – volume: 12 start-page: 659 volume-title: Theory and Practice of Logic Programming year: 2012 ident: S1471068417000114_ref15 – ident: S1471068417000114_ref24 – ident: S1471068417000114_ref29 – ident: S1471068417000114_ref38 doi: 10.1007/11513988_33 – ident: S1471068417000114_ref19 doi: 10.1017/S1471068403001923 – ident: S1471068417000114_ref5 – ident: S1471068417000114_ref30 – ident: S1471068417000114_ref4 doi: 10.1007/978-3-642-22110-1_14 – ident: S1471068417000114_ref1 – volume-title: Programming with Constraints: An Introduction year: 1998 ident: S1471068417000114_ref34 doi: 10.7551/mitpress/5625.001.0001 – ident: S1471068417000114_ref14 doi: 10.1007/978-3-540-72200-7_9 – ident: S1471068417000114_ref37 doi: 10.1007/978-1-4615-1567-8_21 – ident: S1471068417000114_ref22 doi: 10.1007/978-3-540-72200-7_24 – volume-title: SICStus PROLOG User's Manual 4.3 year: 2014 ident: S1471068417000114_ref11 – ident: S1471068417000114_ref40 – volume: 12 start-page: 67 volume-title: Theory and Practice of Logic Programming year: 2012 ident: S1471068417000114_ref41 – volume: 1 start-page: 51 year: 1994 ident: S1471068417000114_ref18 article-title: Consistency of Clark's completion and existence of stable models publication-title: Journal of Methods of Logic in Computer Science – ident: S1471068417000114_ref13 – ident: S1471068417000114_ref2 doi: 10.1017/S1471068413000343 – ident: S1471068417000114_ref23 doi: 10.1142/S0218194096000053 – ident: S1471068417000114_ref28 doi: 10.1016/j.artint.2013.10.004 – start-page: 737 volume-title: Handbook of Satisfiability year: 2008 ident: S1471068417000114_ref6 – ident: S1471068417000114_ref36 doi: 10.1007/s10472-009-9118-9 – ident: S1471068417000114_ref25 – ident: S1471068417000114_ref12 doi: 10.1007/978-1-4684-3384-5_11 – ident: S1471068417000114_ref27 – ident: S1471068417000114_ref32 doi: 10.1023/A:1018978005636 – volume-title: Handbook of Model Checking year: 2014 ident: S1471068417000114_ref7 – start-page: 137 volume-title: Proc. of 14th European Conference Logics in Artificial Intelligence (JELIA), Funchal, Madeira, Portugal year: 2014 ident: S1471068417000114_ref20 – ident: S1471068417000114_ref17 doi: 10.1007/3-540-45635-X_24 – ident: S1471068417000114_ref33 – ident: S1471068417000114_ref3 doi: 10.1017/S1471068417000102 – ident: S1471068417000114_ref21 doi: 10.1007/978-3-642-02846-5_22 – ident: S1471068417000114_ref31 – ident: S1471068417000114_ref42 doi: 10.1017/S1471068411000445 – ident: S1471068417000114_ref8 |
| SSID | ssj0016324 |
| Score | 2.1577122 |
| Snippet | Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 559 |
| SubjectTerms | Arithmetic Fertilization Programming Regular Papers Solvers Terminology |
| Title | On relation between constraint answer set programming and satisfiability modulo theories |
| URI | https://www.cambridge.org/core/product/identifier/S1471068417000114/type/journal_article https://www.proquest.com/docview/1925066903 |
| Volume | 17 |
| WOSCitedRecordID | wos000407039000006&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: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241214 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 advanced technologies & aerospace journals customDbUrl: eissn: 1475-3081 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1475-3081 dateEnd: 20241214 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/eLvHCXMwpV3PS8MwFA66efDi_InTOXLwJBbbvGZJTqLi8DSHKAwvI01SELZ2rpvif2_SpWND2MVLD2kCIS95X5L35XsIXSrBdWphOiAG7AFFQBpwwYxd7qxj4kRHJk7LZBOs1-ODgej7C7fC0yorn1g6ap0rd0d-Y3ci1MKjCOF28hm4rFEuuupTaGyjekSsE3ZBWRYsowhOirx8XcQcu4fHVVTTSUa7Qlfm9OncoWBVW2Edo9ZddIk73cZ_e7yP9vyOE98tpsgB2jLZIWpU2RywX9xHaPCc4amnxmFP38LKbR9dFokZtpj2besXZoY9qWtsYc8Wa1yUTyQ-FpLfP3ic6_kox-UbSXsQP0Zv3cfXh6fA510IlDXRLKCKUUNCkRKjIZIpl0xQCkTEKtKxjjqCgwTKE5A0BiaNTjgoKROilR1VDSeoluWZOUU4NAaIJNAJ7S8nhMMUAKNKguIxGNpE18tRH_rVUwwXzDM2_GOkJgorwwyV1zB3gzDa1ORq2WSyEPDYVLlVmXKlN0s7nm3-fY52iQP9kszbQrXZdG4u0I76sjaYtlH9_rHXf2mXU9R--_T9F0_v6Zs |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTxsxEB5BQIILlLaI8Cg-0EvVVTceO7YPCEELAgEBVVTKbevYXgkJEsgmIP4UvxF71xuBKuXGoVc_Vl57PDO2v_kGYMcoaXNvphPq0B9QFOaJVML57S7ajvVsy7G8TDYhOh3Z7arLGXiuY2ECrLLWiaWitgMT7sh_eE-Ee_OoUty7u09C1qjwulqn0KjE4tQ9PfojW7F78suv71dKjw6vfh4nMatAYvwARgk3gjuaqpw6iy2dSy0U50gVMy3LbKutJGrksoeaMxTa2Z5Eo3WPWuM1uUX_3VmYY8javAFzB4edy9-Td4tAfl7GM4mAJ5KsfkcNJNWhMJQFRrxwDHnN5vDWKr41CqWlO1r-3-boAyxFn5rsV5tgBWZc_yMs1_kqSFRfn6B70SfDCP4jEaBGTHCQQ56MEfFW-9G3L9yIRNjarTfsvtiSogwCua5IzZ_I7cCObwakjAK9dsVn-PMu_7cKjf6g79aApM4h1RTbqa8KVD_CIApuNBrJ0PEmfJ-schb1Q5FV2DqR_SMUTUhrQchMZGkPk3Azrcu3SZe7iqJkWuPNWnRejWYiN-vTq7dh4fjq_Cw7O-mcbsAiDS5OCV3ehMZoOHZbMG8e_HoMv8SNQeDve8vZCxGvRcw |
| 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=On+relation+between+constraint+answer+set+programming+and+satisfiability+modulo+theories&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=LIERLER%2C+YULIYA&rft.au=SUSMAN%2C+BENJAMIN&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=559&rft_id=info:doi/10.1017%2FS1471068417000114 |
| 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 |