Partial Compilation of ASP Programs
Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on...
Uložené v:
| Vydané v: | arXiv.org |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Ithaca
Cornell University Library, arXiv.org
24.07.2019
|
| Predmet: | |
| ISSN: | 2331-8422 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground\&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems. |
|---|---|
| AbstractList | Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground\&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems. |
| Author | Cuteri, Bernardo Ricca, Francesco Dodaro, Carmine Schüller, Peter |
| Author_xml | – sequence: 1 givenname: Bernardo surname: Cuteri fullname: Cuteri, Bernardo – sequence: 2 givenname: Carmine surname: Dodaro fullname: Dodaro, Carmine – sequence: 3 givenname: Francesco surname: Ricca fullname: Ricca, Francesco – sequence: 4 givenname: Peter surname: Schüller fullname: Schüller, Peter |
| BookMark | eNotj81Kw0AURgdRsNY-gLtA14l37uTOz7IEtULBgN2XG5yRlDRTZ1Lx8Q3o6tsczuG7E9djHL0QDxKq2hLBI6ef_ruSDkwlodbuSixQKVnaGvFWrHI-AgBqg0RqIdYtp6nnoWji6dwPPPVxLGIoNu9t0ab4mfiU78VN4CH71f8uxf75ad9sy93by2uz2ZVMCKVVQTLIznmFwJacppqVM2yUIym9BnAEtcUgLdsP58jPSOiMJQxd0Gop1n_ac4pfF5-nwzFe0jgXD4haGTm_APUL7Qo_zA |
| ContentType | Paper |
| Copyright | 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.1907.10469 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database 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 Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials 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 Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | 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 | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a520-83f1a01b9e320a859654a397a739511e600950482f18a8d995e965fb7852fbf63 |
| IEDL.DBID | BENPR |
| IngestDate | Mon Jun 30 09:30:23 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a520-83f1a01b9e320a859654a397a739511e600950482f18a8d995e965fb7852fbf63 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2263713310?pq-origsite=%requestingapplication% |
| PQID | 2263713310 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2263713310 |
| PublicationCentury | 2000 |
| PublicationDate | 20190724 |
| PublicationDateYYYYMMDD | 2019-07-24 |
| PublicationDate_xml | – month: 07 year: 2019 text: 20190724 day: 24 |
| PublicationDecade | 2010 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2019 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.6944962 |
| SecondaryResourceType | preprint |
| Snippet | Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Combinatorial analysis Declarative programming Logic programming Mathematical programming |
| Title | Partial Compilation of ASP Programs |
| URI | https://www.proquest.com/docview/2263713310 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60VfDkGx-1LOg1djeb7CYnUbEoaAm2SD2VZDeBgrR1txZ_vpPtVg-CF48hOeQ1ky8z38wAXFDEFHmsE2LTyBKmGfckAEqoM9IwbpitYmFeHtNeTwyHUtUGt7KmVa50YqWo82nmbeQdhAmx_1BF4dXsnfiqUd67WpfQWIemz1TGGtC8ueup528rC01SxMzx0p1ZJe_q6OJzvLjEdzCt_JvylxKuXpbu9n_ntANNpWe22IU1O9mDzYrRmZX7cK78pdBvgZf48ZLxFkxdcN1XgVqSssoDGHTvBrf3pK6IQDTHb56IXaTDyEgb01ALLhPONAIK7b1tUWQTD5hQJKmLhBa5lNziEGdSwXHvXRIfQmMyndgjCLgIDWI7nhuu8YSEcNqg9GaO5tZnBTyG1mrJo_pWl6Of9Z783X0KWwgsfHQUoawFjXnxYc9gI1vMx2XRrg-p7XmWfWyphyf1-gXqB5vk |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NS8NAEB1qq-jJb_yoGlCPsckmm2wOIqKWltYSaJHewibZhYK0NalVf5T_0dlNowfBWw-eE8IyO3nzZufNDsAFQU6ROtwzhW8L0-UuVSIAYhIZB7FLY1foXpinrt_rseEwCCvwWfbCKFlliYkaqNNJos7IG0gTHJVQ2dbN9MVUU6NUdbUcoVG4RUd8vGHKll-373F_LwlpPgzuWuZiqoDJKaZKzJE2t-w4EA6xOKOBR12OQZmripVtC0-RDnRrIm3GWRoEVOArMvYZxfVLz8HPrkDNVeCvlYL97yMd4vlI0J2idqpvCmvw7H00v8Kg6-tiavAL8XUYa27-MwNsQS3kU5FtQ0WMd2BNq1WTfBfOQ-Xw_NlQaDYq1HzGRBq3_dAIC8FZvgeDZSxrH6rjyVgcgEGZFSNvpWlMOXofY5LHiEyJJKlQNx4eQr20cLT4Y_Pox7xHfz8-g_XW4LEbddu9zjFsIIFSXWAmcetQnWWv4gRWk_lslGen2jsMiJa8GV9KN--A |
| 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=Partial+Compilation+of+ASP+Programs&rft.jtitle=arXiv.org&rft.au=Cuteri%2C+Bernardo&rft.au=Dodaro%2C+Carmine&rft.au=Ricca%2C+Francesco&rft.au=Sch%C3%BCller%2C+Peter&rft.date=2019-07-24&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1907.10469 |