Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches

Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the dev...

Full description

Saved in:

Bibliographic Details
Published in:	Theory and practice of logic programming Vol. 23; no. 1; pp. 195 - 225
Main Author:	LIERLER, YULIYA
Format:	Journal Article
Language:	English
Published:	Cambridge Cambridge University Press 01.01.2023
Subjects:	Automated reasoning Automation Declarative programming Mathematical programming Solvers Traveling salesman problem
ISSN:	1471-0684, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt . It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP.
AbstractList	Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt. It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP. Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt . It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP.
Author	LIERLER, YULIYA
Author_xml	– sequence: 1 givenname: YULIYA orcidid: 0000-0002-6146-623X surname: LIERLER fullname: LIERLER, YULIYA
BookMark	eNp9UMtKAzEUDaJgW_0AdwNudDF685hk6q4UH4WKQutOGDKTpE6ZJjVJEf_etNWNgqv7Oufce24fHVpnNUJnGK4wYHE9w0xg4CUjGACYKA9QL7WKnEKJD3c5zrfzY9QPYQmAOSWsh17HzoboZWtjNrLhQ_tspmP27N3Cy9WqtYubbGKjTlVsnZVdJq3K5l7a0P10LlwiPc7zWgatLrPReu2dbN50OEFHRnZBn37HAXq5u52PH_Lp0_1kPJrmDRE05oYWNSGYA8dMclIDFIylW4eEKGkMYNKUw4LVphCl4orWRgEb6qZmhWKCETpA53vdtPh9o0Oslm7j02mhIkmFclYCTyixRzXeheC1qZo27jxs_XcVhmr7yurPKxMT_2KufbuS_vMfzhcoPXXj
CitedBy_id	crossref_primary_10_1016_j_artint_2024_104276 crossref_primary_10_1017_S1471068422000138 crossref_primary_10_3233_IA_240032 crossref_primary_10_3390_a16040185 crossref_primary_10_1017_S1471068425100264
Cites_doi	10.1016/S0004-3702(02)00186-8 10.1007/978-3-642-02846-5_22 10.1007/978-3-642-04238-6_14 10.1023/A:1018978005636 10.1007/s10009-004-0183-4 10.1023/A:1018930122475 10.1016/j.artint.2013.10.004 10.1016/S0065-2458(03)58003-2 10.1007/s10472-009-9118-9 10.1007/978-3-540-27775-0_6 10.1109/TSE.2008.50 10.1017/S1471068417000102 10.3233/FI-2016-1398 10.1016/j.artint.2012.08.001 10.1145/1217856.1217859 10.1017/S1471068403001923 10.1016/0743-1066(94)90033-7 10.1007/978-1-4615-1567-8_21 10.1007/b94792 10.1017/S1471068410000220 10.1007/978-3-540-72200-7_13 10.1016/S1574-6526(07)03004-0 10.1017/S1471068411000445 10.1007/s10601-016-9257-7 10.1017/S1471068417000242 10.1017/S1471068420000344 10.1109/ICTAI.2010.62 10.1007/978-3-642-02846-5_23 10.1017/S1471068411000494 10.1017/S1471068417000187 10.1017/S1471068411000019 10.1007/978-3-642-27694-1_6 10.1017/S1471068411000214 10.1504/IJDMB.2010.030964 10.1007/11513988_33 10.1007/978-3-030-20528-7_1 10.1007/978-3-642-20895-9_33 10.1017/S1471068417000138 10.1007/b101971 10.1007/978-3-642-22110-1_14 10.1080/09528130701538174 10.1007/s10472-009-9116-y 10.1017/S1471068417000114 10.1007/978-3-540-72200-7_24 10.1007/978-3-540-74970-7_38 10.1007/978-3-642-20895-9_39 10.1016/S1574-6526(07)03002-7 10.1145/35043.35046 10.1007/978-3-540-89982-2_37 10.1007/s10472-007-9076-z 10.1017/S1471068419000450 10.1016/j.artint.2015.09.008 10.1017/S1471068420000265 10.1007/978-3-319-11558-0_37 10.1007/978-3-540-78800-3_24 10.1007/978-3-642-20895-9_46 10.1017/S1471068413000343 10.1145/2043174.2043195 10.3166/jancl.16.35-86 10.1017/S147106841100007X 10.1007/s10664-010-9135-7
ContentType	Journal Article
Copyright	The Author(s), 2021. Published by Cambridge University Press
Copyright_xml	– notice: The Author(s), 2021. 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/S1471068421000478
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 - QC ProQuest Central Database Suite (ProQuest) 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 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
EISSN	1475-3081
EndPage	225
ExternalDocumentID	10_1017_S1471068421000478
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 PUEGO Q9U
ID	FETCH-LOGICAL-c273t-f35b22160614a62b00544068922daff012c8954bf578d6d3bfd049ecb45d47423
IEDL.DBID	K7-
ISICitedReferencesCount	10
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000792145300001&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 Sep 07 03:29:00 EDT 2025 Sat Nov 29 04:58:37 EST 2025 Tue Nov 18 21:23:39 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c273t-f35b22160614a62b00544068922daff012c8954bf578d6d3bfd049ecb45d47423
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-6146-623X
PQID	2892364806
PQPubID	43613
PageCount	31
ParticipantIDs	proquest_journals_2892364806 crossref_citationtrail_10_1017_S1471068421000478 crossref_primary_10_1017_S1471068421000478
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	Lawler (S1471068421000478_ref66) 1985 S1471068421000478_ref46 S1471068421000478_ref47 S1471068421000478_ref48 S1471068421000478_ref49 S1471068421000478_ref42 S1471068421000478_ref44 S1471068421000478_ref45 S1471068421000478_ref40 S1471068421000478_ref41 Banbara (S1471068421000478_ref9) 2015 S1471068421000478_ref57 S1471068421000478_ref58 S1471068421000478_ref59 S1471068421000478_ref53 S1471068421000478_ref54 S1471068421000478_ref55 S1471068421000478_ref56 S1471068421000478_ref50 S1471068421000478_ref51 S1471068421000478_ref52 S1471068421000478_ref102 S1471068421000478_ref101 Fages (S1471068421000478_ref43) 1994; 1 S1471068421000478_ref104 S1471068421000478_ref103 S1471068421000478_ref105 S1471068421000478_ref28 S1471068421000478_ref29 S1471068421000478_ref100 S1471068421000478_ref25 S1471068421000478_ref26 S1471068421000478_ref27 S1471068421000478_ref20 S1471068421000478_ref22 S1471068421000478_ref23 S1471068421000478_ref39 S1471068421000478_ref35 S1471068421000478_ref36 S1471068421000478_ref37 S1471068421000478_ref38 S1471068421000478_ref31 S1471068421000478_ref33 S1471068421000478_ref34 S1471068421000478_ref30 Bomanson (S1471068421000478_ref21) 2020; 21 Palù (S1471068421000478_ref89) 2004; 5 S1471068421000478_ref86 S1471068421000478_ref87 S1471068421000478_ref88 S1471068421000478_ref82 S1471068421000478_ref83 S1471068421000478_ref84 S1471068421000478_ref85 S1471068421000478_ref80 S1471068421000478_ref81 S1471068421000478_ref17 S1471068421000478_ref18 S1471068421000478_ref19 Lifschitz (S1471068421000478_ref75) 2017; 17 S1471068421000478_ref15 S1471068421000478_ref16 S1471068421000478_ref97 S1471068421000478_ref98 S1471068421000478_ref10 S1471068421000478_ref11 S1471068421000478_ref99 S1471068421000478_ref12 S1471068421000478_ref93 Marek (S1471068421000478_ref79) 1999 Clark (S1471068421000478_ref32) 1978 S1471068421000478_ref94 S1471068421000478_ref95 Barrett (S1471068421000478_ref13) 2008 S1471068421000478_ref96 S1471068421000478_ref90 S1471068421000478_ref91 S1471068421000478_ref92 S1471068421000478_ref68 S1471068421000478_ref4 S1471068421000478_ref69 S1471068421000478_ref5 S1471068421000478_ref2 S1471068421000478_ref3 S1471068421000478_ref8 S1471068421000478_ref64 S1471068421000478_ref65 S1471068421000478_ref6 S1471068421000478_ref67 S1471068421000478_ref7 S1471068421000478_ref60 S1471068421000478_ref61 S1471068421000478_ref62 S1471068421000478_ref63 S1471068421000478_ref1 Bromberger (S1471068421000478_ref24) 2015 Barrett (S1471068421000478_ref14) 2014 S1471068421000478_ref76 S1471068421000478_ref77 S1471068421000478_ref78 S1471068421000478_ref71 S1471068421000478_ref72 S1471068421000478_ref73 S1471068421000478_ref74 S1471068421000478_ref70
References_xml	– ident: S1471068421000478_ref6 – ident: S1471068421000478_ref74 doi: 10.1016/S0004-3702(02)00186-8 – ident: S1471068421000478_ref53 doi: 10.1007/978-3-642-02846-5_22 – ident: S1471068421000478_ref57 – ident: S1471068421000478_ref62 doi: 10.1007/978-3-642-04238-6_14 – ident: S1471068421000478_ref76 doi: 10.1023/A:1018978005636 – volume-title: The Logic Programming Paradigm: A 25-Year Perspective year: 1999 ident: S1471068421000478_ref79 – ident: S1471068421000478_ref95 – ident: S1471068421000478_ref91 doi: 10.1007/s10009-004-0183-4 – ident: S1471068421000478_ref82 doi: 10.1023/A:1018930122475 – ident: S1471068421000478_ref69 doi: 10.1016/j.artint.2013.10.004 – ident: S1471068421000478_ref40 – ident: S1471068421000478_ref63 – start-page: 737 volume-title: Handbook of Satisfiability year: 2008 ident: S1471068421000478_ref13 – ident: S1471068421000478_ref19 doi: 10.1016/S0065-2458(03)58003-2 – ident: S1471068421000478_ref83 doi: 10.1007/s10472-009-9118-9 – ident: S1471068421000478_ref102 – ident: S1471068421000478_ref41 doi: 10.1007/978-3-540-27775-0_6 – ident: S1471068421000478_ref33 doi: 10.1109/TSE.2008.50 – ident: S1471068421000478_ref7 doi: 10.1017/S1471068417000102 – ident: S1471068421000478_ref98 – ident: S1471068421000478_ref77 – ident: S1471068421000478_ref20 doi: 10.3233/FI-2016-1398 – ident: S1471068421000478_ref39 – ident: S1471068421000478_ref93 doi: 10.1016/j.artint.2012.08.001 – ident: S1471068421000478_ref86 doi: 10.1145/1217856.1217859 – ident: S1471068421000478_ref45 doi: 10.1017/S1471068403001923 – ident: S1471068421000478_ref58 doi: 10.1016/0743-1066(94)90033-7 – ident: S1471068421000478_ref31 – volume: 1 start-page: 51 year: 1994 ident: S1471068421000478_ref43 article-title: Consistency of Clark’s completion and existence of stable models publication-title: Journal of Methods of Logic in Computer Science – ident: S1471068421000478_ref84 doi: 10.1007/978-1-4615-1567-8_21 – ident: S1471068421000478_ref97 – ident: S1471068421000478_ref42 doi: 10.1007/b94792 – ident: S1471068421000478_ref78 – volume: 5 start-page: 2004 year: 2004 ident: S1471068421000478_ref89 article-title: Constraint logic programming approach to protein structure prediction publication-title: BMC Bioinformatics – ident: S1471068421000478_ref22 – ident: S1471068421000478_ref37 doi: 10.1017/S1471068410000220 – volume-title: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization year: 1985 ident: S1471068421000478_ref66 – ident: S1471068421000478_ref61 – ident: S1471068421000478_ref50 doi: 10.1007/978-3-540-72200-7_13 – ident: S1471068421000478_ref96 doi: 10.1016/S1574-6526(07)03004-0 – ident: S1471068421000478_ref105 doi: 10.1017/S1471068411000445 – ident: S1471068421000478_ref100 – ident: S1471068421000478_ref70 doi: 10.1007/s10601-016-9257-7 – ident: S1471068421000478_ref60 doi: 10.1017/S1471068417000242 – ident: S1471068421000478_ref44 doi: 10.1017/S1471068420000344 – ident: S1471068421000478_ref51 doi: 10.1109/ICTAI.2010.62 – ident: S1471068421000478_ref48 doi: 10.1007/978-3-642-02846-5_23 – ident: S1471068421000478_ref101 doi: 10.1017/S1471068411000494 – ident: S1471068421000478_ref104 doi: 10.1017/S1471068417000187 – volume: 17 start-page: 961 year: 2017 ident: S1471068421000478_ref75 article-title: Achievements in answer set programming publication-title: TPLP – ident: S1471068421000478_ref16 – ident: S1471068421000478_ref52 doi: 10.1017/S1471068411000019 – ident: S1471068421000478_ref64 – year: 2015 ident: S1471068421000478_ref9 – year: 2015 ident: S1471068421000478_ref24 – ident: S1471068421000478_ref71 doi: 10.1007/978-3-642-27694-1_6 – ident: S1471068421000478_ref2 – ident: S1471068421000478_ref99 – ident: S1471068421000478_ref73 doi: 10.1017/S1471068411000214 – ident: S1471068421000478_ref90 doi: 10.1504/IJDMB.2010.030964 – ident: S1471068421000478_ref47 – ident: S1471068421000478_ref85 doi: 10.1007/11513988_33 – ident: S1471068421000478_ref1 doi: 10.1007/978-3-030-20528-7_1 – ident: S1471068421000478_ref8 doi: 10.1017/S1471068417000187 – ident: S1471068421000478_ref15 – ident: S1471068421000478_ref38 – ident: S1471068421000478_ref3 doi: 10.1007/978-3-642-20895-9_33 – ident: S1471068421000478_ref67 – ident: S1471068421000478_ref10 doi: 10.1017/S1471068417000138 – ident: S1471068421000478_ref5 – ident: S1471068421000478_ref56 doi: 10.1007/b101971 – ident: S1471068421000478_ref11 doi: 10.1007/978-3-642-22110-1_14 – ident: S1471068421000478_ref36 doi: 10.1080/09528130701538174 – volume-title: Handbook of Model Checking year: 2014 ident: S1471068421000478_ref14 – ident: S1471068421000478_ref80 doi: 10.1007/s10472-009-9116-y – volume: 21 start-page: 33:1 year: 2020 ident: S1471068421000478_ref21 article-title: Applying visible strong equivalence in answer-set program transformations publication-title: Transactions on Computational Logic – ident: S1471068421000478_ref18 – ident: S1471068421000478_ref72 doi: 10.1017/S1471068417000114 – ident: S1471068421000478_ref54 doi: 10.1007/978-3-540-72200-7_24 – ident: S1471068421000478_ref87 – ident: S1471068421000478_ref94 – ident: S1471068421000478_ref35 – ident: S1471068421000478_ref103 – ident: S1471068421000478_ref81 doi: 10.1007/978-3-540-74970-7_38 – ident: S1471068421000478_ref49 doi: 10.1007/978-3-642-20895-9_39 – ident: S1471068421000478_ref55 doi: 10.1016/S1574-6526(07)03002-7 – ident: S1471068421000478_ref65 doi: 10.1145/35043.35046 – ident: S1471068421000478_ref27 doi: 10.1007/978-3-540-89982-2_37 – ident: S1471068421000478_ref26 doi: 10.1007/s10472-007-9076-z – ident: S1471068421000478_ref28 doi: 10.1017/S1471068419000450 – ident: S1471068421000478_ref29 doi: 10.1016/j.artint.2015.09.008 – ident: S1471068421000478_ref88 – year: 1978 ident: S1471068421000478_ref32 – ident: S1471068421000478_ref25 doi: 10.1017/S1471068420000265 – ident: S1471068421000478_ref17 doi: 10.1007/978-3-319-11558-0_37 – ident: S1471068421000478_ref34 doi: 10.1007/978-3-540-78800-3_24 – ident: S1471068421000478_ref30 doi: 10.1007/978-3-642-20895-9_46 – ident: S1471068421000478_ref4 doi: 10.1017/S1471068413000343 – ident: S1471068421000478_ref23 doi: 10.1145/2043174.2043195 – ident: S1471068421000478_ref59 doi: 10.3166/jancl.16.35-86 – ident: S1471068421000478_ref68 – ident: S1471068421000478_ref92 doi: 10.1017/S147106841100007X – ident: S1471068421000478_ref46 doi: 10.1007/s10664-010-9135-7 – ident: S1471068421000478_ref12
SSID	ssj0016324
Score	2.3441498
Snippet	Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such...
SourceID	proquest crossref
SourceType	Aggregation Database Enrichment Source Index Database
StartPage	195
SubjectTerms	Automated reasoning Automation Declarative programming Mathematical programming Solvers Traveling salesman problem
Title	Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
URI	https://www.proquest.com/docview/2892364806
Volume	23
WOSCitedRecordID	wos000792145300001&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: 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 advanced technologies & aerospace journals 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: 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/eLvHCXMwpV3LS8MwGA-6efDifOJ0jhw8qBBc0_QxLzJlQxFHkQlDhJLmAcLs5lr13zdfm05F2MVLD3lA8_jyy_fI90PomCrtKNFRhDJpFBSXa8ITzycuCwzgOiJ0hC7IJoLhMByPu5E1uGU2rLI6E4uDWk4F2MjPjWIAuc7Djn85eyPAGgXeVUuhsYrqDqUO7PO7gCy8CJCKvHhdFEB0T8gqryakjIZCKKNg4GbAsvYTl34fywXWDBr__ctNtGFvmbhXbosttKLSbdSoGBywFegd9Ax8nQVLRI57afYJdSrHURm09Wpg7QLf2oQShc0Q81TiAt8mVcnJ1HS6HxHAQ3mKezZJucp20eOgP7q-IZZvgQhzicmJdr3EzKIPSiL3KQgoM3hvhkQl19pAmQi7Hku0kXLpSzfR0ugXSiTMkww8vnuolk5TtY-wUhTozHRH-IoF3AkFN_dGJqXP4U2KaqJONduxsMnIYbSTuIw6C-I_C9REZ4suszITx7LGrWp9YiuUWfy9OAfLqw_ROrDKl5aWFqrl83d1hNbER_6SzduoftUfRg_tYq-Zb-Q9fQGBYdgU
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1ZS8NAEB68QF-sJ97ug4IKwWa7ORREilpa1NKHCiJCTPYAQVNtosU_5W90JkdVBN988HU3u5Dsl_lmZnfnA9ji2thaVrXFhcIApRYaK4wc16oJDwnXlr4tTSY24bXb_vX1QWcE3su7MHSssrSJmaFWPUk58n0MDKjWuV91j5-eLVKNot3VUkIjh8W5fhtgyJYctU5xfbc5b5x1T5pWoSpgSaTq1DI1J-LcdikUCl1OMBTIajg9V6ExaLClf-CIyCCWlatqkVHoRWsZCUcJ2tfEeUdhXAgMlvD_6Tg3w10LKn2e3Wby6DSRL8pdVCpRTY3UximhLkjV7SsPfqeBjNsalf_2VWZguvCiWT2H_SyM6HgOKqVCBSsM1jzckh5ppoKRsnqcDKhPp6yTH0p7RNo-ZK2iYEaWE2VhrFjG3w9ly04PB112LeJ7tcvqRRF2nSzA1Z-84yKMxb1YLwHTmpNcm6lKVwsvtH0Zol8slHJDunOjl6Farm4gi2Lr9LYPQX6qzgt-AGIZ9oZDnvJKI789vFbiISiMThJ8gmHl9-5NmGx2Ly-Ci1b7fBWmOPpteVZpDcbS_otehwn5mt4n_Y0M3wzu_ho6H7NsMB0
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=Constraint+Answer+Set+Programming%3A+Integrational+and+Translational+%28or+SMT-based%29+Approaches&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=LIERLER%2C+YULIYA&rft.date=2023-01-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=1&rft.spage=195&rft.epage=225&rft_id=info:doi/10.1017%2FS1471068421000478&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068421000478
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