Equivalence between answer-set programs under (partially) fixed input
Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong...
Uložené v:
| Vydané v: | Annals of mathematics and artificial intelligence Ročník 83; číslo 3-4; s. 277 - 295 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Cham
Springer International Publishing
01.08.2018
Springer Springer Nature B.V |
| Predmet: | |
| ISSN: | 1012-2443, 1573-7470 |
| 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 has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong equivalence between two programs holds if they can be faithfully replaced by each other in any context (facts and rules), uniform equivalence amounts to equivalent behavior of programs under any set of facts. Both notions (as well as several variants thereof) have been extensively studied. However, the somewhat reverse notion of equivalence which holds if two programs are equivalent under the addition of any set of proper rules (i.e., all rules except facts) has not been investigated yet. In this paper, we close this gap and give a thorough study of this notion, which we call rule equivalence , and its parameterized version where we allow facts over a given restricted alphabet to appear in the context. This notion of equivalence is thus a relationship between two programs whose input is (partially) fixed but where additional proper rules might still be added. Such a notion might be helpful in debugging of programs. We give full characterization results and a complexity analysis for the propositional case of rule equivalence and its relativized versions. Moreover, we address the problem of program simplification under rule equivalence. Finally, we show that rule equivalence is decidable in the non-ground case. |
|---|---|
| AbstractList | Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong equivalence between two programs holds if they can be faithfully replaced by each other in any context (facts and rules), uniform equivalence amounts to equivalent behavior of programs under any set of facts. Both notions (as well as several variants thereof) have been extensively studied. However, the somewhat reverse notion of equivalence which holds if two programs are equivalent under the addition of any set of proper rules (i.e., all rules except facts) has not been investigated yet. In this paper, we close this gap and give a thorough study of this notion, which we call rule equivalence , and its parameterized version where we allow facts over a given restricted alphabet to appear in the context. This notion of equivalence is thus a relationship between two programs whose input is (partially) fixed but where additional proper rules might still be added. Such a notion might be helpful in debugging of programs. We give full characterization results and a complexity analysis for the propositional case of rule equivalence and its relativized versions. Moreover, we address the problem of program simplification under rule equivalence. Finally, we show that rule equivalence is decidable in the non-ground case. Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong equivalence between two programs holds if they can be faithfully replaced by each other in any context (facts and rules), uniform equivalence amounts to equivalent behavior of programs under any set of facts. Both notions (as well as several variants thereof) have been extensively studied. However, the somewhat reverse notion of equivalence which holds if two programs are equivalent under the addition of any set of proper rules (i.e., all rules except facts) has not been investigated yet. In this paper, we close this gap and give a thorough study of this notion, which we call rule equivalence, and its parameterized version where we allow facts over a given restricted alphabet to appear in the context. This notion of equivalence is thus a relationship between two programs whose input is (partially) fixed but where additional proper rules might still be added. Such a notion might be helpful in debugging of programs. We give full characterization results and a complexity analysis for the propositional case of rule equivalence and its relativized versions. Moreover, we address the problem of program simplification under rule equivalence. Finally, we show that rule equivalence is decidable in the non-ground case. Keywords Answer set programming * Equivalence Mathematics Subject Classification (2010) 68N17 |
| Audience | Academic |
| Author | Woltran, Stefan Bliem, Bernhard |
| Author_xml | – sequence: 1 givenname: Bernhard surname: Bliem fullname: Bliem, Bernhard email: bliem@dbai.tuwien.ac.at organization: Institute of Information SystemsTU Wien – sequence: 2 givenname: Stefan orcidid: 0000-0003-1594-8972 surname: Woltran fullname: Woltran, Stefan organization: Institute of Information SystemsTU Wien |
| BookMark | eNp1kM1LwzAchoNMcE7_AG8FL3rITNLmo8cx5gcMvOg5pM2vI6NLt6R17r83o4InySEhvE9-b55rNPGdB4TuKJlTQuRTpKSQDBMqccmFxPwCTSmXOZaFJJN0JpRhVhT5FbqOcUsIKYUSU7RaHQb3ZVrwNWQV9EcAnxkfjxBwhD7bh24TzC5mg7cQsoe9Cb0zbXt6zBr3DTZzfj_0N-iyMW2E2999hj6fVx_LV7x-f3lbLta4zjnpsaW5qiRQyw03peUlExWpeCUMt0zZ1ChvLFW8UkYKWTaMgaqNVYXkyprK5DN0P76bah0GiL3edkPwaaRmJVWMsFLRlJqPqU36l3a-6fpg6rQs7FydvDUu3S8kFYyKgrEE0BGoQxdjgEbvg9uZcNKU6LNePerVSa8-69U8MWxkYsr6DYS_Kv9DP8y_fpQ |
| Cites_doi | 10.1145/383779.383783 10.1145/1243996.1244000 10.1080/11663081.2013.799318 10.1023/A:1018978005636 10.1145/1149114.1149117 10.1145/2043174.2043195 10.1613/jair.2810 10.1017/S1471068410000542 10.1007/978-3-540-24609-1_18 10.1007/978-3-540-30227-8_17 10.1007/978-3-540-30227-8_16 10.1007/978-3-540-24609-1_10 10.1007/978-3-540-24599-5_16 10.1007/978-3-319-30024-5_6 10.1016/B978-0-934613-40-8.50021-X |
| ContentType | Journal Article |
| Copyright | The Author(s) 2017 COPYRIGHT 2018 Springer The Author(s) 2017. This work is published under http://creativecommons.org/licenses/by/4.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: The Author(s) 2017 – notice: COPYRIGHT 2018 Springer – notice: The Author(s) 2017. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s10472-017-9567-5 |
| DatabaseName | Springer Nature Open Access Journals CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef 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 SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | 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 | Mathematics Computer Science |
| EISSN | 1573-7470 |
| EndPage | 295 |
| ExternalDocumentID | A716216422 10_1007_s10472_017_9567_5 |
| GrantInformation_xml | – fundername: Austrian Science Fund grantid: Y698 funderid: https://doi.org/10.13039/501100002428 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV KOW LAK LLZTM M4Y M7S MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 Z92 ZMTXR ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 8FE 8FG AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c350t-d138b7e1d5a5a9d5926b0b5b6a5d28d9683fd185b8a7679f22e8cad84758daba3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000440108900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1012-2443 |
| IngestDate | Wed Nov 05 14:48:54 EST 2025 Sat Nov 29 10:27:22 EST 2025 Sat Nov 29 05:14:36 EST 2025 Fri Feb 21 02:26:57 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3-4 |
| Keywords | Equivalence 68N17 Answer set programming |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c350t-d138b7e1d5a5a9d5926b0b5b6a5d28d9683fd185b8a7679f22e8cad84758daba3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-1594-8972 |
| OpenAccessLink | https://link.springer.com/10.1007/s10472-017-9567-5 |
| PQID | 2918202981 |
| PQPubID | 2043872 |
| PageCount | 19 |
| ParticipantIDs | proquest_journals_2918202981 gale_infotracacademiconefile_A716216422 crossref_primary_10_1007_s10472_017_9567_5 springer_journals_10_1007_s10472_017_9567_5 |
| PublicationCentury | 2000 |
| PublicationDate | 20180800 2018-8-00 20180801 |
| PublicationDateYYYYMMDD | 2018-08-01 |
| PublicationDate_xml | – month: 8 year: 2018 text: 20180800 |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Cham – name: Dordrecht |
| PublicationTitle | Annals of mathematics and artificial intelligence |
| PublicationTitleAbbrev | Ann Math Artif Intell |
| PublicationYear | 2018 |
| Publisher | Springer International Publishing Springer Springer Nature B.V |
| Publisher_xml | – name: Springer International Publishing – name: Springer – name: Springer Nature B.V |
| References | Eiter, Fink, Woltran (CR9) 2007; 8 Janhunen, Oikarinen, Tompits, Woltran (CR13) 2009; 35 CR4 Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, Scarcello (CR20) 2006; 7 Lifschitz, Tang, Turner (CR19) 1999; 25 CR5 Brewka, Eiter, Truszczyński (CR1) 2011; 54 CR8 CR7 Truszczynski, Woltran (CR11) 2009; 9 CR18 CR17 CR15 Woltran (CR10) 2008; 8 CR14 Eiter, Fink, Pu̇hrer, Tompits, Woltran (CR16) 2013; 23 CR12 Lifschitz, Pearce, Valverde (CR2) 2001; 2 Turner (CR3) 2003; 3 Fink (CR6) 2011; 11 9567_CR7 V Lifschitz (9567_CR2) 2001; 2 9567_CR8 9567_CR5 M Fink (9567_CR6) 2011; 11 9567_CR4 G Brewka (9567_CR1) 2011; 54 T Eiter (9567_CR16) 2013; 23 H Turner (9567_CR3) 2003; 3 T Eiter (9567_CR9) 2007; 8 S Woltran (9567_CR10) 2008; 8 T Janhunen (9567_CR13) 2009; 35 9567_CR12 V Lifschitz (9567_CR19) 1999; 25 9567_CR14 9567_CR15 9567_CR17 9567_CR18 M Truszczynski (9567_CR11) 2009; 9 N Leone (9567_CR20) 2006; 7 |
| References_xml | – ident: CR18 – ident: CR4 – ident: CR14 – ident: CR15 – volume: 2 start-page: 526 issue: 4 year: 2001 end-page: 541 ident: CR2 article-title: Strongly equivalent logic programs publication-title: ACM Trans. Comput. Log. doi: 10.1145/383779.383783 – volume: 8 start-page: 17:1 issue: 3 year: 2007 end-page: 17:53 ident: CR9 article-title: Semantical characterizations and complexity of equivalences in answer set programming. publication-title: ACM Trans. Comput. Log doi: 10.1145/1243996.1244000 – volume: 8 start-page: 217 issue: 2 year: 2008 end-page: 234 ident: CR10 article-title: A common view on strong, uniform, and other notions of equivalence in answer-set programming publication-title: TPLP – ident: CR12 – ident: CR17 – volume: 23 start-page: 75 issue: 1–2 year: 2013 end-page: 104 ident: CR16 article-title: Model-based recasting in answer-set programming publication-title: J. Appl. Non-Classical Logics doi: 10.1080/11663081.2013.799318 – volume: 25 start-page: 369 issue: 3–4 year: 1999 end-page: 389 ident: CR19 article-title: Nested expressions in logic programs publication-title: Ann. Math. Artif. Intell. doi: 10.1023/A:1018978005636 – ident: CR5 – ident: CR7 – ident: CR8 – volume: 7 start-page: 499 issue: 3 year: 2006 end-page: 562 ident: CR20 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Trans. Comput. Log. doi: 10.1145/1149114.1149117 – volume: 54 start-page: 92 issue: 12 year: 2011 end-page: 103 ident: CR1 article-title: Answer set programming at a glance publication-title: Commun. ACM doi: 10.1145/2043174.2043195 – volume: 9 start-page: 781 issue: 6 year: 2009 end-page: 819 ident: CR11 article-title: Relativized hyperequivalence of logic programs for modular programming publication-title: TPLP – volume: 3 start-page: 602 issue: 4-5 year: 2003 end-page: 622 ident: CR3 article-title: Strong equivalence made easy: nested expressions and weight constraints publication-title: Theory Pract. Logic Program. – volume: 35 start-page: 813 year: 2009 end-page: 857 ident: CR13 article-title: Modularity aspects of disjunctive stable models publication-title: J. Artif. Intell. Res. (JAIR) doi: 10.1613/jair.2810 – volume: 11 start-page: 171 issue: 2–3 year: 2011 end-page: 202 ident: CR6 article-title: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there publication-title: Theory Pract. Logic Program. doi: 10.1017/S1471068410000542 – ident: 9567_CR12 doi: 10.1007/978-3-540-24609-1_18 – volume: 25 start-page: 369 issue: 3–4 year: 1999 ident: 9567_CR19 publication-title: Ann. Math. Artif. Intell. doi: 10.1023/A:1018978005636 – volume: 7 start-page: 499 issue: 3 year: 2006 ident: 9567_CR20 publication-title: ACM Trans. Comput. Log. doi: 10.1145/1149114.1149117 – ident: 9567_CR7 doi: 10.1007/978-3-540-30227-8_17 – ident: 9567_CR8 doi: 10.1007/978-3-540-30227-8_16 – volume: 11 start-page: 171 issue: 2–3 year: 2011 ident: 9567_CR6 publication-title: Theory Pract. Logic Program. doi: 10.1017/S1471068410000542 – ident: 9567_CR14 – volume: 9 start-page: 781 issue: 6 year: 2009 ident: 9567_CR11 publication-title: TPLP – volume: 35 start-page: 813 year: 2009 ident: 9567_CR13 publication-title: J. Artif. Intell. Res. (JAIR) doi: 10.1613/jair.2810 – volume: 8 start-page: 17:1 issue: 3 year: 2007 ident: 9567_CR9 publication-title: ACM Trans. Comput. Log doi: 10.1145/1243996.1244000 – volume: 2 start-page: 526 issue: 4 year: 2001 ident: 9567_CR2 publication-title: ACM Trans. Comput. Log. doi: 10.1145/383779.383783 – ident: 9567_CR15 doi: 10.1007/978-3-540-24609-1_10 – ident: 9567_CR5 doi: 10.1007/978-3-540-24599-5_16 – ident: 9567_CR18 doi: 10.1007/978-3-319-30024-5_6 – volume: 8 start-page: 217 issue: 2 year: 2008 ident: 9567_CR10 publication-title: TPLP – volume: 23 start-page: 75 issue: 1–2 year: 2013 ident: 9567_CR16 publication-title: J. Appl. Non-Classical Logics doi: 10.1080/11663081.2013.799318 – ident: 9567_CR4 doi: 10.1016/B978-0-934613-40-8.50021-X – ident: 9567_CR17 – volume: 3 start-page: 602 issue: 4-5 year: 2003 ident: 9567_CR3 publication-title: Theory Pract. Logic Program. – volume: 54 start-page: 92 issue: 12 year: 2011 ident: 9567_CR1 publication-title: Commun. ACM doi: 10.1145/2043174.2043195 |
| SSID | ssj0009686 |
| Score | 2.1478815 |
| Snippet | Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations... |
| SourceID | proquest gale crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 277 |
| SubjectTerms | Artificial Intelligence Complex Systems Computer Science Context Declarative programming Equivalence Investigations Logic programs Mathematical programming Mathematics Modularity Problem solving |
| SummonAdditionalLinks | – databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS-UwEB9c9aAHv1bxrR_kIKwfBG3atMlJRJ4Iy8oedsFbSJoUHsjz2Vbd_e93pi_1oYte9tpAUjKT-U0yM78BOAjo06dVVXKP_gDPXKY5gkLOQ6JdEJmXzmdds4ni5kbd3uof8cGtiWmVvU3sDLW_L-mN_FRoohoXWiXnkwdOXaMouhpbaHyChUSIhPT8W8FnpLt51-mRKKw4wljaRzWnpXNZQUkJFMBEWyFf4dJb6_xPmLRDn6vV__3vNViJfie7mCrKOsyF8Qas9j0dWDziG7D8_YXHtfkMw-HD4wh1kcZYTOliCG7PoeZNaFnM7moYlaLV7HBCimjv7v4csWr0O3g2GuP8m_Dravjz8prHxgu8TOVZy32SKleExEsrrfZSi9ydOelyK71QHrc1rTwCvVO2yAtdCRFUaT0CnVTeOptuwfz4fhy2geVOV_gJUdDKrLSZdlaFPLdFibdy4fUAjvttN5Mpv4aZMSmTjAzKyJCMjBzAVxKMobPX1ra0sYQAlyIWK3NBdFh4_xNiALu9NEw8lI2ZiWIAJ708Z8PvLvvl48l2YAm9KDXNCtyF-bZ-DHuwWD61o6be7zTyLy3I5lw priority: 102 providerName: ProQuest |
| Title | Equivalence between answer-set programs under (partially) fixed input |
| URI | https://link.springer.com/article/10.1007/s10472-017-9567-5 https://www.proquest.com/docview/2918202981 |
| Volume | 83 |
| WOSCitedRecordID | wos000440108900004&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: 1573-7470 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: P5Z dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7470 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: K7- dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1573-7470 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: M7S dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7470 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: BENPR dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7470 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB58HfTgW1wfSw6CLwJu2rTJUWVFEJfFF-IlJE0KC7JqW1__3km3dX0e9NJDU5Iymck3YWa-Adhw6NMHaZpQi_4ADU0oKYJCRF1LGsdCy40Ny2YTcacjrq9lt6rjzuts9zokWZ7UH4rdwtinEfiQI1o3H4VxRDvhrfHs_GrItBuV7R09bxVF7ArqUOZPU3wCo69H8rfYaAk5RzP_-tlZmK48TLI_UIk5GHH9eZipuzeQypjnYer0nbE1X4B2--Gxh1rnx0iVvEUQxp5dRnNXkCqPKye-6CwjW_de5fTt7es2SXsvzpJeH-dfhMuj9sXhMa1aLNAk4HsFta1AmNi1LNdcS8sli8ye4SbS3DJhUZZBahHSjdBxFMuUMScSbRHSuLDa6GAJxvp3fbcMJDIyxVeId5qHiQ6l0cJFkY4TvH8zKxuwU8ta3Q-YNNSQM9mLS6G4lBeX4g3Y9LuhvJUVmU50VSyAS3m-KrXvia_wpsdYA9bqDVOV-eWKSc9Lz1A5GrBbb9Bw-NdlV_709SpMovskBumAazBWZI9uHSaSp6KXZ00YP2h3umdNGD2JadPnlJ7js8tvmqW-vgEAHeCR |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQcKBQQWwr4AOIli10nduxDhSrYqtW2Kw5F6s3YsSOtVG23SUrbP8VvZCYPVgXBrQeusWQrmcc3zsx8A_AyYkyfFEXOA8YDPPWp4QgKiseR8VGkQfqQNsMmsulUHx2ZLyvwo--FobLK3ic2jjqc5PSP_IMwRDUujB59XJxymhpF2dV-hEarFpN4eY5Xtmpr7zPK95UQO-PDT7u8myrA80QOax5GifZZHAXppDNBGqH80EuvnAxCB6N0UgREMa9dpjJTCBF17gJ6camD8y7BfW_AzTTRGXH1TzK-JPlVzWRJosziCJtJn0VtW_XSjIogKGGKvklewcHf0eCPtGyDdjtr_9t3ug_3uriabbeG8ABW4nwd1vqZFaxzYetw9-AXT231EMbj07MZ2hqtsa5kjSF4n8eSV7FmXfVaxajVrmRvFmRo7vj48i0rZhcxsNkc938EX6_l1R7D6vxkHp8AU94U-AhR3sk0d6nxTkelXJabYSaCGcC7Xsx20fKH2CVTNOmERZ2wpBNWDuA1KYIl31KXLnddiwQeRSxddpvovvB-K8QANnvp287pVHYp-gG87_VnufzXYzf-vdkLuL17eLBv9_emk6dwByNG3VZAbsJqXZ7FZ3Ar_17PqvJ5Yw0Mvl23Wv0EIGxEbg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dT9swED-xgiZ4gNEN0a0wP0xiH7JKnTixHyvWatO2Cgk29c2yY0eKhEJJUj7-e85tQoGNh4nXOLKj-8jvrLv7HcAHhzF9kKYJtRgP0NCEkiIoRNT1pXEstNzYcD5sIh6PxWQij-s5p2VT7d6kJBc9DZ6lKa96U5v27jW-hbEvKfDpR_R0_gJWQz8zyF_XT_4sWXej-ahHz2FFEceCJq35ry0eANPj3_NfedI5_Iy2nv3hr2CzjjzJYGEq27Di8jZsNVMdSO3kbdj4dcfkWr6G4fBilqE1-jVSF3URhLcrV9DSVaSu7yqJb0YryMepN0V9dnbziaTZtbMky3H_N_B7NDw9-kbr0Qs0CfhhRW0_ECZ2fcs119JyySJzaLiJNLdMWJRrkFqEeiN0HMUyZcyJRFuEOi6sNjrYgVZ-nrtdIJGRKT5CHNQ8THQojRYuinSc4L2cWdmBz43c1XTBsKGWXMpeXArFpby4FO_AgdeM8t5XFTrRdRMBHuV5rNTAE2LhDZCxDnQb5anaLUvFpOerZ1L0O_ClUdZy-clj3_7X2-_h5fHXkfr5ffzjHaxjhCUWFYNdaFXFzO3BWnJZZWWxPzfWW_P45_c |
| 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=Equivalence+between+answer-set+programs+under+%28partially%29+fixed+input&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=Bliem%2C+Bernhard&rft.au=Woltran%2C+Stefan&rft.date=2018-08-01&rft.pub=Springer+International+Publishing&rft.issn=1012-2443&rft.eissn=1573-7470&rft.volume=83&rft.issue=3-4&rft.spage=277&rft.epage=295&rft_id=info:doi/10.1007%2Fs10472-017-9567-5&rft.externalDocID=10_1007_s10472_017_9567_5 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon |