Failure tabled constraint logic programming by interpolation
We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 13; H. 4-5; S. 593 - 607 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, UK
Cambridge University Press
01.07.2013
|
| 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 a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions. |
|---|---|
| AbstractList | We present a new execution strategy for constraint logic programs called
Failure Tabled CLP
. Similarly to
Tabled CLP
our strategy records certain derivations in order to prune further derivations. However, our method only learns from
failed derivations
. This allows us to compute
interpolants
rather than
constraint projection
for generation of
reuse conditions
. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions. We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions. Abstract We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions. [PUBLICATION ABSTRACT] |
| Author | GANGE, GRAEME SCHACHTE, PETER SØNDERGAARD, HARALD STUCKEY, PETER J. NAVAS, JORGE A. |
| Author_xml | – sequence: 1 givenname: GRAEME surname: GANGE fullname: GANGE, GRAEME email: gkgange@unimelb.edu.au organization: Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia (e-mail: gkgange@unimelb.edu.au, jorge.navas@unimelb.edu.au, schachte@unimelb.edu.au, harald@unimelb.edu.au, pstuckey@unimelb.edu.au) – sequence: 2 givenname: JORGE A. surname: NAVAS fullname: NAVAS, JORGE A. email: gkgange@unimelb.edu.au organization: Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia (e-mail: gkgange@unimelb.edu.au, jorge.navas@unimelb.edu.au, schachte@unimelb.edu.au, harald@unimelb.edu.au, pstuckey@unimelb.edu.au) – sequence: 3 givenname: PETER surname: SCHACHTE fullname: SCHACHTE, PETER email: gkgange@unimelb.edu.au organization: Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia (e-mail: gkgange@unimelb.edu.au, jorge.navas@unimelb.edu.au, schachte@unimelb.edu.au, harald@unimelb.edu.au, pstuckey@unimelb.edu.au) – sequence: 4 givenname: HARALD surname: SØNDERGAARD fullname: SØNDERGAARD, HARALD email: gkgange@unimelb.edu.au organization: Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia (e-mail: gkgange@unimelb.edu.au, jorge.navas@unimelb.edu.au, schachte@unimelb.edu.au, harald@unimelb.edu.au, pstuckey@unimelb.edu.au) – sequence: 5 givenname: PETER J. surname: STUCKEY fullname: STUCKEY, PETER J. email: gkgange@unimelb.edu.au organization: Department of Computing and Information Systems, The University of Melbourne, Victoria 3010, Australia (e-mail: gkgange@unimelb.edu.au, jorge.navas@unimelb.edu.au, schachte@unimelb.edu.au, harald@unimelb.edu.au, pstuckey@unimelb.edu.au) |
| BookMark | eNp9kD9PwzAQxS1UJNrCB2CLxMISuIsTO5FYUEUBqRIDMEeO40SunLjYydBvj_tnQEUw3enu_U7v3YxMetsrQq4R7hCQ379jyhFYniIFAMqLMzINoyymkONk32O821-QmfdrAGQ0SafkYSm0GZ2KBlEZVUfS9n5wQvdDZGyrZbRxtnWi63TfRtU2CgvlNtaIQdv-kpw3wnh1daxz8rl8-li8xKu359fF4yqWNIMhVgnPMsY4YwmnTEJd5DVQLCraFDSpQFCpagYSUtFgonLaiJqlqJBhLhVN6JzcHu4GM1-j8kPZaS-VMaJXdvQlMo5pBjSEn5ObE-najq4P7kpMKQupsyQPKn5QSWe9d6oppR72kXbZTYlQ7r5a_vpqIPGE3DjdCbf9l6FHRnSV03Wrfpj6k_oGtUWIWQ |
| CitedBy_id | crossref_primary_10_1016_j_scico_2017_01_002 crossref_primary_10_1017_S1471068421000211 |
| Cites_doi | 10.2307/2963593 10.1145/1594834.1480898 10.7551/mitpress/5625.001.0001 10.3233/SAT190086 10.1007/s10009-007-0044-z 10.1145/131295.131299 10.1007/978-3-642-31424-7_61 10.1017/S1471068411000457 |
| ContentType | Journal Article |
| Copyright | Copyright © 2013 [GRAEME GANGE, JORGE A. NAVAS, PETER SCHACHTE, HARALD SØNDERGAARD and PETER J. STUCKEY] |
| Copyright_xml | – notice: Copyright © 2013 [GRAEME GANGE, JORGE A. NAVAS, PETER SCHACHTE, HARALD SØNDERGAARD and PETER J. STUCKEY] |
| 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/S1471068413000379 |
| 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 ProQuest Technology Collection ProQuest One ProQuest Central Korea 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 One Academic 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 and Information Systems Abstracts Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central Database Suite (ProQuest) url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Failure tabled constraint logic programming by interpolation G. Gange et al. |
| EISSN | 1475-3081 |
| EndPage | 607 |
| ExternalDocumentID | 3081351151 10_1017_S1471068413000379 |
| 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-c350t-e2755667662736c0d98d0319b3f932b0a3ced60c04af12e83fad641e1618ce323 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000324926400010&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 06:07:20 EDT 2025 Sun Nov 09 07:08:44 EST 2025 Tue Nov 18 22:01:36 EST 2025 Sat Nov 29 04:58:35 EST 2025 Wed Mar 13 05:43:07 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4-5 |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c350t-e2755667662736c0d98d0319b3f932b0a3ced60c04af12e83fad641e1618ce323 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1436163528 |
| PQPubID | 43613 |
| PageCount | 15 |
| ParticipantIDs | proquest_miscellaneous_1671450341 proquest_journals_1436163528 crossref_citationtrail_10_1017_S1471068413000379 crossref_primary_10_1017_S1471068413000379 cambridge_journals_10_1017_S1471068413000379 |
| PublicationCentury | 2000 |
| PublicationDate | 20130700 2013-07-00 20130701 |
| PublicationDateYYYYMMDD | 2013-07-01 |
| PublicationDate_xml | – month: 07 year: 2013 text: 20130700 |
| 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 | 2013 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068413000379_ref9 S1471068413000379_ref7 S1471068413000379_ref8 S1471068413000379_ref5 S1471068413000379_ref6 S1471068413000379_ref3 S1471068413000379_ref23 S1471068413000379_ref24 S1471068413000379_ref4 S1471068413000379_ref1 S1471068413000379_ref22 S1471068413000379_ref2 S1471068413000379_ref20 S1471068413000379_ref25 S1471068413000379_ref26 Griggio (S1471068413000379_ref10) 2012; 8 S1471068413000379_ref12 S1471068413000379_ref13 S1471068413000379_ref11 S1471068413000379_ref18 S1471068413000379_ref19 S1471068413000379_ref16 S1471068413000379_ref17 S1471068413000379_ref14 Marriott (S1471068413000379_ref21) 1998 S1471068413000379_ref15 |
| References_xml | – ident: S1471068413000379_ref7 doi: 10.2307/2963593 – ident: S1471068413000379_ref5 – ident: S1471068413000379_ref12 – ident: S1471068413000379_ref14 – ident: S1471068413000379_ref3 – ident: S1471068413000379_ref9 – ident: S1471068413000379_ref18 – ident: S1471068413000379_ref1 – ident: S1471068413000379_ref16 – ident: S1471068413000379_ref24 – ident: S1471068413000379_ref11 doi: 10.1145/1594834.1480898 – ident: S1471068413000379_ref22 – ident: S1471068413000379_ref20 – ident: S1471068413000379_ref13 – ident: S1471068413000379_ref6 – ident: S1471068413000379_ref4 – volume-title: Introduction to Constraint Logic Programming year: 1998 ident: S1471068413000379_ref21 doi: 10.7551/mitpress/5625.001.0001 – ident: S1471068413000379_ref8 – ident: S1471068413000379_ref19 – volume: 8 start-page: 1 year: 2012 ident: S1471068413000379_ref10 article-title: A practical approach to satisfiability modulo linear integer arithmetic. publication-title: Journal on Satisfiability, Boolean Modeling and Computation doi: 10.3233/SAT190086 – ident: S1471068413000379_ref2 doi: 10.1007/s10009-007-0044-z – ident: S1471068413000379_ref26 doi: 10.1145/131295.131299 – ident: S1471068413000379_ref23 – ident: S1471068413000379_ref17 doi: 10.1007/978-3-642-31424-7_61 – ident: S1471068413000379_ref25 – ident: S1471068413000379_ref15 doi: 10.1017/S1471068411000457 |
| SSID | ssj0016324 |
| Score | 2.0155764 |
| Snippet | We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations... We present a new execution strategy for constraint logic programs called Failure Tabled CLP . Similarly to Tabled CLP our strategy records certain derivations... Abstract We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 593 |
| SubjectTerms | Derivation Failure Interpolation Logic programming Projection Redundant Regular Papers Reuse Strategy |
| Title | Failure tabled constraint logic programming by interpolation |
| URI | https://www.cambridge.org/core/product/identifier/S1471068413000379/type/journal_article https://www.proquest.com/docview/1436163528 https://www.proquest.com/docview/1671450341 |
| Volume | 13 |
| WOSCitedRecordID | wos000324926400010&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: 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: 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 Central Database Suite (ProQuest) 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/eLvHCXMwpV3NS8MwFH_4dfDi_MTpHBE8icW0-WgHgqhseBpDFIaX0eYDBrpNVwX_e_PatDqEXbz0kCYlzUvee8n75f0AzqS0ERM8DIyzBwG3NA2Sjo4CLpXbDmkad4QtyCbifj8ZDjsDf-A297DKSicWilpPFZ6RXzq7Lp3vIKLkevYWIGsURlc9hcYqrIeRU8IYlI2DOoqAqciL20UxonsSXkU1MWU0FmIZhnMoQyTXT26FRRu1qKILu9Nr_LfH27DlPU5yU06RHVgxk11oVGwOxC_uPbjqpWPEqJMcb1NpotBzRAKJnBT6kXgo16szdiT7IuOSoavE0u3DU6_7eHcfeG6FQDFBcyeaWAjEt0rnv0hFdSfReKEpY9Z5dBlNmTJaUkV5asPIJMymWvLQYH59ZVjEDmBtMp2YQyBh6vZQOnW-obKcqyxTykRCScssj6nOmnBRj-zIr5D5qESXxaM_gmgCrQZ_pHyecvzbl2VNzusmszJJx7LKrUpcv3pTy6oJp_Vrt9IwfJJOzPTD1ZFxyAV1Zv9o-SeOYTMqSDMQ1NuCtfz9w5zAhvrMx_P3NqzfdvuDh3YxVd1zIJ6_ATLZ6no |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1La9tAEB6ME2gvebQpcZu0W2gvpaIr7UMSJIS2iUmwa0xJIDdV2gcYEtm1lZb8qf7G7OjVmoJvPuS62hW7mtn5ZjXfzgC8k9IGTHDfMw4PPG5p6kWxDjwulTsOaRrGwpbFJsLRKLq-jscd-NPchUFaZWMTS0Otpwr_kX9yuC6d7yCC6GT208OqURhdbUpoVGoxMPe_3ZFtcXxx6uT7Pgj6Z5dfz726qoCnmKCFm1QoBDI7pUNuqaiOI41XeTJmnS-T0ZQpoyVVlKfWD0zEbKol9w1mlleGYaIDZ_I3OONSdGHjy9lo_L2NW2Dy8_I-U4h8oog3cVRMUo2N2IYBJMqQO_Y3m8MyKi6DQol0_e3H9o12YKv2qcnnahPsQsfkz2C7qVdBavP1HI766QRZ-KTA-2KaKPSNsURGQUoEIDVZ7dbBOcnuyaSqQVaxBffgai1reAHdfJqbfSB-6k6JOnXer7KcqyxTygRCScssD6nOevCxlWRS24BFUvHnwuQ_wfeANsJOVJ2JHVd7s2rIh3bIrEpDsqrzQaMe_8ym1Y0evG0fO1uCAaI0N9M710eGPhfUOTYvV7_iDTw5v_w2TIYXo8EreBqUJUKQwnwA3WJ-Zw5hU_0qJov563qDEPixbn17AMOORFM |
| 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=Failure+tabled+constraint+logic+programming+by+interpolation&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=GANGE%2C+GRAEME&rft.au=NAVAS%2C+JORGE+A.&rft.au=SCHACHTE%2C+PETER&rft.au=S%C3%98NDERGAARD%2C+HARALD&rft.date=2013-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=13&rft.issue=4-5&rft.spage=593&rft.epage=607&rft_id=info:doi/10.1017%2FS1471068413000379&rft.externalDocID=10_1017_S1471068413000379 |
| 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 |