Anti-unification in Constraint Logic Programming
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often called a most specific generalization, that is a gen...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 19; číslo 5-6; s. 773 - 789 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.09.2019
|
| 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 | Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often called a most specific generalization, that is a generalization that captures a maximal amount of shared structure. In this work we address the problem of anti-unification in CLP, where goals can be seen as unordered sets of atoms and/or constraints. We show that while the concept of a most specific generalization can easily be defined in this context, computing it becomes an NP-complete problem. We subsequently introduce a generalization algorithm that computes a well-defined abstraction whose computation can be bound to a polynomial execution time. Initial experiments show that even a naive implementation of our algorithm produces acceptable generalizations in an efficient way. |
|---|---|
| AbstractList | Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often called a most specific generalization, that is a generalization that captures a maximal amount of shared structure. In this work we address the problem of anti-unification in CLP, where goals can be seen as unordered sets of atoms and/or constraints. We show that while the concept of a most specific generalization can easily be defined in this context, computing it becomes an NP-complete problem. We subsequently introduce a generalization algorithm that computes a well-defined abstraction whose computation can be bound to a polynomial execution time. Initial experiments show that even a naive implementation of our algorithm produces acceptable generalizations in an efficient way. |
| Author | VANHOOF, WIM YERNAUX, GONZAGUE |
| Author_xml | – sequence: 1 givenname: GONZAGUE orcidid: 0000-0001-6430-8168 surname: YERNAUX fullname: YERNAUX, GONZAGUE email: gonzague.yernaux@unamur.be organization: University of Namur, Belgium Namur Digital Institute (e-mail: gonzague.yernaux@unamur.be) – sequence: 2 givenname: WIM surname: VANHOOF fullname: VANHOOF, WIM email: gonzague.yernaux@unamur.be organization: University of Namur, Belgium Namur Digital Institute (e-mail: gonzague.yernaux@unamur.be) |
| BookMark | eNp9kE1LAzEQhoNUsFZ_gLcFz6uZJJtNjqX4BQUF9bwk2eyS0k1qkh78924_QFD0NMPM-8y8M-do4oO3CF0BvgEM9e0rsBowFwwkxhiEOEHTsVSVFAuY7HMod_0zdJ7SapRwStgU4bnPrtx61zmjsgu-cL5YBJ9yVM7nYhl6Z4qXGPqohsH5_gKddmqd7OUxztD7_d3b4rFcPj88LebL0lCocwmCG9YSbnVFpSUauKGWWYlJNdY7U9VCqopIyTtoVS2xhKrV2kqmrcaC0xm6PszdxPCxtSk3q7CNflzZEIoxJ4wzMarqg8rEkFK0XWNc3t-x879uADe79zS_3jOS8IPcRDeo-PkvQ4-MGnR0bW-_Tf1NfQHpPnZL |
| CitedBy_id | crossref_primary_10_1007_s10703_023_00412_3 |
| Cites_doi | 10.1016/0743-1066(94)90033-7 10.3233/FI-2013-845 10.1145/271510.271525 10.1016/j.jcss.2005.06.005 10.1016/j.entcs.2005.11.015 |
| ContentType | Journal Article |
| Copyright | Cambridge University Press 2019 |
| Copyright_xml | – notice: Cambridge University Press 2019 |
| 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/S1471068419000188 |
| 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 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 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) 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 | Anti-unification in Constraint Logic Programming G. Yernaux and W. Vanhoof |
| EISSN | 1475-3081 |
| EndPage | 789 |
| ExternalDocumentID | 10_1017_S1471068419000188 |
| 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 AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD 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 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 WYP ZYDXJ AAYXX ABGDZ ABXHF AFFHD AKMAY CITATION IPYYG PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS PUEGO Q9U |
| ID | FETCH-LOGICAL-c317t-186c4d26eb539e2b16c3e4e9025c4dfc5789a52996f1da790915dbbe94beb0863 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000487090500010&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 23:53:24 EDT 2025 Sat Nov 29 04:58:36 EST 2025 Tue Nov 18 22:20:15 EST 2025 Tue Jan 21 06:25:19 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5-6 |
| Keywords | Anti-unification (most specific) generalization CLP program analysis |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-186c4d26eb539e2b16c3e4e9025c4dfc5789a52996f1da790915dbbe94beb0863 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-6430-8168 |
| PQID | 2300624648 |
| PQPubID | 43613 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_2300624648 crossref_citationtrail_10_1017_S1471068419000188 crossref_primary_10_1017_S1471068419000188 cambridge_journals_10_1017_S1471068419000188 |
| PublicationCentury | 2000 |
| PublicationDate | 20190900 2019-09-00 20190901 |
| PublicationDateYYYYMMDD | 2019-09-01 |
| PublicationDate_xml | – month: 09 year: 2019 text: 20190900 |
| 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 | 2019 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068419000188_ref6 S1471068419000188_ref4 S1471068419000188_ref3 S1471068419000188_ref10 S1471068419000188_ref2 Syso (S1471068419000188_ref18) 1982; 1 S1471068419000188_ref1 Gange (S1471068419000188_ref7) 2015; 4 Khardon (S1471068419000188_ref11) 2006; 1 Leuschel (S1471068419000188_ref12) 1998; 1 S1471068419000188_ref14 S1471068419000188_ref15 Fioravanti (S1471068419000188_ref5) 2013; 4 Jaffar (S1471068419000188_ref9) 1998; 1 Sørensen (S1471068419000188_ref16) 1999 S1471068419000188_ref13 Gutiérrez-Naranjo (S1471068419000188_ref8) 2003 S1471068419000188_ref17 |
| References_xml | – ident: S1471068419000188_ref6 – start-page: 115 year: 2003 ident: S1471068419000188_ref8 – ident: S1471068419000188_ref14 – ident: S1471068419000188_ref1 – ident: S1471068419000188_ref15 – start-page: 246 volume-title: Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School year: 1999 ident: S1471068419000188_ref16 – ident: S1471068419000188_ref10 doi: 10.1016/0743-1066(94)90033-7 – ident: S1471068419000188_ref4 – volume: 4 start-page: 483 year: 2013 ident: S1471068419000188_ref5 article-title: Controlling polyvariance for specialization-based verification publication-title: Fundam. Inform. 124 doi: 10.3233/FI-2013-845 – ident: S1471068419000188_ref17 – ident: S1471068419000188_ref3 – ident: S1471068419000188_ref13 – volume: 1 start-page: 208 year: 1998 ident: S1471068419000188_ref12 article-title: Controlling generalization amd polyvariance in partial deduction of normal logic programs publication-title: ACM Trans. Program. Lang. Syst. 20, doi: 10.1145/271510.271525 – volume: 1 start-page: 1 year: 1998 ident: S1471068419000188_ref9 article-title: The semantics of constraint logic programs publication-title: The Journal of Logic Programming 37 – volume: 4 start-page: 526 year: 2015 ident: S1471068419000188_ref7 article-title: Horn clauses as an intermediate representation for program analysis and transformation publication-title: TPLP 15 – volume: 1 start-page: 72 year: 2006 ident: S1471068419000188_ref11 article-title: The subsumption lattice and query learning publication-title: Journal of Computer and System Sciences 72 doi: 10.1016/j.jcss.2005.06.005 – volume: 1 start-page: 91 year: 1982 ident: S1471068419000188_ref18 article-title: The subgraph isomorphism problem for outerplanar graphs publication-title: Theoretical Computer Science 17 – ident: S1471068419000188_ref2 doi: 10.1016/j.entcs.2005.11.015 |
| SSID | ssj0016324 |
| Score | 2.2325623 |
| Snippet | Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 773 |
| SubjectTerms | 35th International Conference on Logic Programming Algorithms Computation Logic programming Original Article Polynomials |
| Title | Anti-unification in Constraint Logic Programming |
| URI | https://www.cambridge.org/core/product/identifier/S1471068419000188/type/journal_article https://www.proquest.com/docview/2300624648 |
| Volume | 19 |
| WOSCitedRecordID | wos000487090500010&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: 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: 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 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-6efDifOJ8jB48icGmzaM5yZQNQRhFFIaX0iYpDLSbW-ffb7423RjCLl4KTRvI43sl3-OH0E3g69DXmuIMcj8o5ABbI1bgnNNUhJRFSqQV2IQYjaLxWMbuwm3hwiobmVgJaj1VcEd-b01lnweU0-hh9o0BNQq8qw5CYxe1SRAQoPMXgVdeBChFXmUXCYjuiWjj1YSS0dAIbQRQMwkAr6xrK2zqqE0RXemdYee_Iz5EB87i9Po1iRyhHVMco06D5uA55j5Bfr8oJ3hZQOxQtV3epPAAz7NCkSg9QGVWXlzHc31ZjXeK3oeDt6dn7PAUsLJWQolJxBXVATcZC6UJMsJVaKgBR6Ntz5VlXpkyq594TnQqpDUlmM4yI2lmMnv0Cc9Qq5gW5hx5oWQBNcqerqDEmTKS6Mi-yUxyxnKfd9HdajUTxxWLpI4oE8mfxe8iv1nwRLna5DC5z21dblddZnVhjm0_XzVbtB7Nen8utn--RPvWTHKRZVeoVc6X5hrtqZ9yspj3UPtxMIpfexXp2WfMPn4Bb3_YzQ |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JS8NAFH5oFfRiXXGpmoNexGCWmUnmICIuKGrpQUG8xM5SKGisNlX8U_5G38vSIkJvHjxmkgmTvDdvmbd8ADuBZ0LPGOYqqv1gVAOMRmzkdgRrRyHjsY7aOdhE1GzG9_eyNQFfVS0MpVVWMjEX1OZF0xn5AZrKngiYYPFR79Ul1CiKrlYQGgVbXNnPD3TZ-oeXp0jf3SA4P7s9uXBLVAFXo67MXD8WmplAWMVDaQPlCx1aZinchuMdjSws2xyltOj4ph1JVKjcKGUlU1ahAxDieydhijF0lnD_tPjDMGpBrc_zaqaIsoliVkVRqUU1DdKYTyidPgG9jHo5_NSJP1VCrufO6__tD83DXGlRO8fFFliACZsuQr1Cq3BK4bUE3nGadd1BSrlROTs63dQhvNIcJSNzCHVaO60iX-0ZNfoy3P3Juleglr6kdhWcUPKAWY3eI7Vw01b6JsYrqaTgvOOJNdgfUi8pd30_KTLmouQXsdfAqwic6LL3On3c07gpe8MpvaLxyLiHGxVLjFYz4of18be3Yebi9uY6ub5sXm3ALJqEZRZdA2rZ28BuwrR-z7r9t62c3R14_Gvu-QZoRDN8 |
| 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=Anti-unification+in+Constraint+Logic+Programming&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=YERNAUX%2C+GONZAGUE&rft.au=Vanhoof%2C+Wim&rft.date=2019-09-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=19&rft.issue=5-6&rft.spage=773&rft.epage=789&rft_id=info:doi/10.1017%2FS1471068419000188 |
| 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 |