Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis

Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis

Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few cons...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming 2017-09, Vol.17 (5-6), p.780-799
Hauptverfasser: CUTERI, BERNARDO, DODARO, CARMINE, RICCA, FRANCESCO, SCHÜLLER, PETER
Format: Artikel
Sprache:eng
Schlagworte:
Empirical analysis
Regular Papers
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 799
container_issue 5-6
container_start_page 780
container_title Theory and practice of logic programming
container_volume 17
creator CUTERI, BERNARDO
DODARO, CARMINE
RICCA, FRANCESCO
SCHÜLLER, PETER
description Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.
doi_str_mv 10.1017/S1471068417000254
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1947583638</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S1471068417000254</cupid><sourcerecordid>1947583638</sourcerecordid><originalsourceid>FETCH-LOGICAL-c317t-10e39fc63fe3f6a2a47abf60d27ebaa6628846aeac65556a89a9365d74822d53</originalsourceid><addsrcrecordid>eNp1UE1Lw0AUXETBWv0B3ha8Gt233_FWil8gKLT38JpsypY0G3dTof56U9tDQTy9x7yZYd4Qcg3sDhiY-xlIA0xbCYYxxpU8IaMBUplgFk5_d8h293NykdKKMdCCyxGZTUOb-oi-7dMtbfB7S8tjJETaxdDhEvsQE_Utncw-aArNl2-XD3TSUrfufPQlNhRbbLbJp0tyVmOT3NVhjsn86XE-fcne3p9fp5O3rBRg-gyYE3ldalE7UWvkKA0uas0qbtwCUWturdTosNRKKY02x1xoVRlpOa-UGJObve0Q8HPjUl-swiYOGVIB-fC6FVrYgQV7VhlDStHVRRf9GuO2AFbsqiv-VDdoxEGD60X01dIdWf-r-gE9n3AL</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1947583638</pqid></control><display><type>article</type><title>Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis</title><source>Cambridge University Press Journals Complete</source><creator>CUTERI, BERNARDO ; DODARO, CARMINE ; RICCA, FRANCESCO ; SCHÜLLER, PETER</creator><creatorcontrib>CUTERI, BERNARDO ; DODARO, CARMINE ; RICCA, FRANCESCO ; SCHÜLLER, PETER</creatorcontrib><description>Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.</description><identifier>ISSN: 1471-0684</identifier><identifier>EISSN: 1475-3081</identifier><identifier>DOI: 10.1017/S1471068417000254</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Empirical analysis ; Regular Papers</subject><ispartof>Theory and practice of logic programming, 2017-09, Vol.17 (5-6), p.780-799</ispartof><rights>Copyright © Cambridge University Press 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c317t-10e39fc63fe3f6a2a47abf60d27ebaa6628846aeac65556a89a9365d74822d53</citedby><cites>FETCH-LOGICAL-c317t-10e39fc63fe3f6a2a47abf60d27ebaa6628846aeac65556a89a9365d74822d53</cites><orcidid>0000-0002-5617-5286 ; 0000-0002-1837-126X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S1471068417000254/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,780,784,27924,27925,55628</link.rule.ids></links><search><creatorcontrib>CUTERI, BERNARDO</creatorcontrib><creatorcontrib>DODARO, CARMINE</creatorcontrib><creatorcontrib>RICCA, FRANCESCO</creatorcontrib><creatorcontrib>SCHÜLLER, PETER</creatorcontrib><title>Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis</title><title>Theory and practice of logic programming</title><addtitle>Theory and Practice of Logic Programming</addtitle><description>Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.</description><subject>Empirical analysis</subject><subject>Regular Papers</subject><issn>1471-0684</issn><issn>1475-3081</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1UE1Lw0AUXETBWv0B3ha8Gt233_FWil8gKLT38JpsypY0G3dTof56U9tDQTy9x7yZYd4Qcg3sDhiY-xlIA0xbCYYxxpU8IaMBUplgFk5_d8h293NykdKKMdCCyxGZTUOb-oi-7dMtbfB7S8tjJETaxdDhEvsQE_Utncw-aArNl2-XD3TSUrfufPQlNhRbbLbJp0tyVmOT3NVhjsn86XE-fcne3p9fp5O3rBRg-gyYE3ldalE7UWvkKA0uas0qbtwCUWturdTosNRKKY02x1xoVRlpOa-UGJObve0Q8HPjUl-swiYOGVIB-fC6FVrYgQV7VhlDStHVRRf9GuO2AFbsqiv-VDdoxEGD60X01dIdWf-r-gE9n3AL</recordid><startdate>201709</startdate><enddate>201709</enddate><creator>CUTERI, BERNARDO</creator><creator>DODARO, CARMINE</creator><creator>RICCA, FRANCESCO</creator><creator>SCHÜLLER, PETER</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-5617-5286</orcidid><orcidid>https://orcid.org/0000-0002-1837-126X</orcidid></search><sort><creationdate>201709</creationdate><title>Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis</title><author>CUTERI, BERNARDO ; DODARO, CARMINE ; RICCA, FRANCESCO ; SCHÜLLER, PETER</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c317t-10e39fc63fe3f6a2a47abf60d27ebaa6628846aeac65556a89a9365d74822d53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Empirical analysis</topic><topic>Regular Papers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>CUTERI, BERNARDO</creatorcontrib><creatorcontrib>DODARO, CARMINE</creatorcontrib><creatorcontrib>RICCA, FRANCESCO</creatorcontrib><creatorcontrib>SCHÜLLER, PETER</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Theory and practice of logic programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>CUTERI, BERNARDO</au><au>DODARO, CARMINE</au><au>RICCA, FRANCESCO</au><au>SCHÜLLER, PETER</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis</atitle><jtitle>Theory and practice of logic programming</jtitle><addtitle>Theory and Practice of Logic Programming</addtitle><date>2017-09</date><risdate>2017</risdate><volume>17</volume><issue>5-6</issue><spage>780</spage><epage>799</epage><pages>780-799</pages><issn>1471-0684</issn><eissn>1475-3081</eissn><abstract>Answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S1471068417000254</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0002-5617-5286</orcidid><orcidid>https://orcid.org/0000-0002-1837-126X</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1471-0684
ispartof Theory and practice of logic programming, 2017-09, Vol.17 (5-6), p.780-799
issn 1471-0684
1475-3081
language eng
recordid cdi_proquest_journals_1947583638
source Cambridge University Press Journals Complete
subjects Empirical analysis
Regular Papers
title Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T20%3A22%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Constraints,%20lazy%20constraints,%20or%20propagators%20in%20ASP%20solving:%20An%20empirical%20analysis&rft.jtitle=Theory%20and%20practice%20of%20logic%20programming&rft.au=CUTERI,%20BERNARDO&rft.date=2017-09&rft.volume=17&rft.issue=5-6&rft.spage=780&rft.epage=799&rft.pages=780-799&rft.issn=1471-0684&rft.eissn=1475-3081&rft_id=info:doi/10.1017/S1471068417000254&rft_dat=%3Cproquest_cross%3E1947583638%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1947583638&rft_id=info:pmid/&rft_cupid=10_1017_S1471068417000254&rfr_iscdi=true