The Impact of Treewidth on Grounding and Solving of Answer Set Programs
In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavi...
Uložené v:
| Vydané v: | The Journal of artificial intelligence research Ročník 67; s. 35 - 80 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
San Francisco
AI Access Foundation
01.01.2020
|
| Predmet: | |
| ISSN: | 1076-9757, 1076-9757, 1943-5037 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavily influenced by treewidth, given ground input programs that are otherwise uniform, both in size and construction. This observation leads to an important question for ASP, namely, how to design encodings such that the treewidth of the resulting ground program remains small. To this end, we study two classes of disjunctive programs, namely guarded and connection-guarded programs. In order to investigate these classes, we formalize the grounding process using MSO transductions. Our main results show that both classes guarantee that the treewidth of the program after grounding only depends on the treewidth (and the maximum degree, in case of connection-guarded programs) of the input instance. In terms of parameterized complexity, our findings yield corresponding FPT results for answer-set existence for bounded treewidth (and also degree, for connection-guarded programs) of the input instance. We further show that bounding treewidth alone leads to NP-hardness in the data complexity for connection-guarded programs, which indicates that the two classes are fundamentally different. Finally, we show that for both classes, the data complexity remains as hard as in the general case of ASP. |
|---|---|
| AbstractList | In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavily influenced by treewidth, given ground input programs that are otherwise uniform, both in size and construction. This observation leads to an important question for ASP, namely, how to design encodings such that the treewidth of the resulting ground program remains small. To this end, we study two classes of disjunctive programs, namely guarded and connection-guarded programs. In order to investigate these classes, we formalize the grounding process using MSO transductions. Our main results show that both classes guarantee that the treewidth of the program after grounding only depends on the treewidth (and the maximum degree, in case of connection-guarded programs) of the input instance. In terms of parameterized complexity, our findings yield corresponding FPT results for answer-set existence for bounded treewidth (and also degree, for connection-guarded programs) of the input instance. We further show that bounding treewidth alone leads to NP-hardness in the data complexity for connection-guarded programs, which indicates that the two classes are fundamentally different. Finally, we show that for both classes, the data complexity remains as hard as in the general case of ASP. In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavily influenced by treewidth, given ground input programs that are otherwise uniform, both in size and construction. This observation leads to an important question for ASP, namely, how to design encodings such that the treewidth of the resulting ground program remains small. To this end, we study two classes of disjunctive programs, namely guarded and connection-guarded programs. In order to investigate these classes, we formalize the grounding process using MSO transductions. Our main results show that both classes guarantee that the treewidth of the program after grounding only depends on the treewidth (and the maximum degree, in case of connection-guarded programs) of the input instance. In terms of parameterized complexity, our findings yield corresponding FPT results for answer-set existence for bounded treewidth (and also degree, for connection-guarded programs) of the input instance. We further show that bounding treewidth alone leads to NP-hardness in the data complexity for connection-guarded programs, which indicates that the two classes are fundamentally different. Finally, we show that for both classes, the data complexity remains as hard as in the general case of ASP. |
| Author | Moldovan, Marius Woltran, Stefan Bliem, Bernhard Morak, Michael |
| Author_xml | – sequence: 1 givenname: Bernhard surname: Bliem fullname: Bliem, Bernhard – sequence: 2 givenname: Michael surname: Morak fullname: Morak, Michael – sequence: 3 givenname: Marius surname: Moldovan fullname: Moldovan, Marius – sequence: 4 givenname: Stefan surname: Woltran fullname: Woltran, Stefan |
| BookMark | eNptkMFKAzEQhoNUsK3efICAV7dmsptu9liK1oKg0HoOMTvbprRJTVKLb--u9SDiaf6B75-Bb0B6zjsk5BrYCMaQ3220DSMYAQgQZ6QPrBxnVSnK3q98QQYxbhiDquCyT2bLNdL5bq9Nor6hy4B4tHVaU-_oLPiDq61bUe1quvDbjy631MTFIwa6wERfgl8FvYuX5LzR24hXP3NIXh_ul9PH7Ol5Np9OnjKTM0gZ1qAFl5WRRoJkBZbMoC7fKlnzbsUGat5g0TSiLrHiguWVFNrIvAAD3ORDcnO6uw_-_YAxqY0_BNe-VFyIFuas7QwJP1Em-BgDNsrYpJP1LgVttwqY6oSpTpgC9S2sLd3-Ke2D3enw-T_-Bbz7boU |
| CitedBy_id | crossref_primary_10_1016_j_artint_2021_103651 crossref_primary_10_3390_a14030081 |
| ContentType | Journal Article |
| Copyright | 2020. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about |
| Copyright_xml | – notice: 2020. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about |
| DBID | AAYXX CITATION 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS |
| DOI | 10.1613/jair.1.11515 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection 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 ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database (subscription) 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 |
| DatabaseTitle | CrossRef Publicly Available Content Database Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1076-9757 1943-5037 |
| EndPage | 80 |
| ExternalDocumentID | 10_1613_jair_1_11515 |
| GroupedDBID | .DC 29J 2WC 5GY 5VS AAKMM AAKPC AALFJ AAYFX AAYXX ACGFO ACM ADBBV ADBSK ADMLS AEFXT AEJOY AENEX AFFHD AFKRA AFWXC AKRVB ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS BCNDV BENPR BGLVJ CCPQU CITATION E3Z EBS EJD F5P FRJ FRP GROUPED_DOAJ GUFHI HCIFZ K7- KQ8 LHSKQ LPJ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB RNS TR2 XSB 8FE 8FG ABUWG AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c301t-ed1a5289c8c81804e70cea7b98d2804eef1d2fe4ff5d7e92503985ac8341c12c3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000528198400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1076-9757 |
| IngestDate | Sun Jul 13 03:24:09 EDT 2025 Sat Nov 29 05:27:06 EST 2025 Tue Nov 18 22:23:34 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c301t-ed1a5289c8c81804e70cea7b98d2804eef1d2fe4ff5d7e92503985ac8341c12c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/2553982050?pq-origsite=%requestingapplication% |
| PQID | 2553982050 |
| PQPubID | 5160723 |
| PageCount | 46 |
| ParticipantIDs | proquest_journals_2553982050 crossref_citationtrail_10_1613_jair_1_11515 crossref_primary_10_1613_jair_1_11515 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-01-01 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – month: 01 year: 2020 text: 2020-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | San Francisco |
| PublicationPlace_xml | – name: San Francisco |
| PublicationTitle | The Journal of artificial intelligence research |
| PublicationYear | 2020 |
| Publisher | AI Access Foundation |
| Publisher_xml | – name: AI Access Foundation |
| SSID | ssj0019428 |
| Score | 2.3650177 |
| Snippet | In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 35 |
| SubjectTerms | Artificial intelligence Complexity Declarative programming Mathematical programming |
| Title | The Impact of Treewidth on Grounding and Solving of Answer Set Programs |
| URI | https://www.proquest.com/docview/2553982050 |
| Volume | 67 |
| WOSCitedRecordID | wos000528198400002&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: DOA dateStart: 19930101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: K7- dateStart: 19930101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central (subscription) customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: BENPR dateStart: 19930101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: PIMPY dateStart: 19930101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR3LTsJAcKPgwYv4jCiSPejJrLB9sPRk0ICSKGkUEzw1ZR8RQ1qkVX7f2e2CetCLx7aTpp33zM4DoVPFXQGOsCRjyiTxYkeQgPMmYXoyoUtFQIWZM3vHBoP2aBSENuGW2bLKpU40ilqkXOfIG-D6ugGYK795OXsjemuUPl21KzTWUZk6oIT1oSwjq1OEwHOKVjjWIgHzmS18BwvWeI0n8wsKCsPXC3G_m6SfGtmYmV7lvx-4jbasg4k7BUfsoDWZ7KLKcnkDtrK8h26AQXDf9EjiVOHhXMrFROQvOE2wTkiZbhccJwI_plOdddBQnSRb6JfIHIdFYVe2j5563eH1LbFbFQgHYc6JFDT2Icziba77vD3JmlzGbBy0haMvpaLCUdJTyhdMBuAiwW_5MW-DvePU4e4BKiVpIg8RZoD0FuXMbUFUxcYybinwb1TTd7gCt8itovMlYiNuR47rzRfTSIceQIZIkyGikSFDFZ2toGfFqI1f4GpLAkRW4LLoC_tHfz8-RpuODplNFqWGSvn8XZ6gDf6RT7J5HZWvuoPwoW5C87rhJrgX9u_D508bHNFF |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RqNRegEJRKS8fyqkyrJ1knRwQQjxXu6yQupW4hawfYtEqoZvAij_Fb2QmD1oOcOPQYxTLVvKNZ74Ze2YAfjjtGSTClg-FstxPpOGR1i2uqDKhJ0wkTFlntqf6_fDyMrqYgccmF4auVTY6sVTUJtMUI99F6utFaK6C1v7tH05do-h0tWmhUYlF1z5M0WXL9zpHiO-2lCfHg8MzXncV4BqFueDWiCRAN0OHmvKcfata2iZqGIVG0qN1wkhnfecCo2yEFAHXDRIdor7XQmoP5_0Ac74XKtpXXcWfTy0iX1apd6rNIxWo-qI9Wszdm2Q02RGooAJqwPuvCXxpAUqzdrLwv_2QRZivCTQ7qCT-C8zYdAkWmuYUrNZVy3CKG4B1yhxQljk2mFg7HZnimmUpo4Bbmc3DktSwX9mYoio06iDNpzSJLdhFdXEt_wq_3-VzVmA2zVL7DZgSSE6FVl4bvUY1tEnbIX9zrUBqh7TPW4WfDZCxrkuqU2ePcUyuFcIeE-yxiEvYV2H7efRtVUrklXHrDeBxrVDy-C_a399-vQWfzgbnvbjX6XfX4LOk8EAZMVqH2WJyZzfgo74vRvlks5RdBlfvLRtPwK8qYg |
| 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=The+Impact+of+Treewidth+on+Grounding+and+Solving+of+Answer+Set+Programs&rft.jtitle=The+Journal+of+artificial+intelligence+research&rft.au=Bliem%2C+Bernhard&rft.au=Morak%2C+Michael&rft.au=Moldovan%2C+Marius&rft.au=Woltran%2C+Stefan&rft.date=2020-01-01&rft.issn=1076-9757&rft.eissn=1076-9757&rft.volume=67&rft.spage=35&rft.epage=80&rft_id=info:doi/10.1613%2Fjair.1.11515&rft.externalDBID=n%2Fa&rft.externalDocID=10_1613_jair_1_11515 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1076-9757&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1076-9757&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1076-9757&client=summon |