Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first st...
Saved in:
| Published in: | Theory and practice of logic programming Vol. 23; no. 2; pp. 444 - 467 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
01.03.2023
|
| Subjects: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. Logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the noncontradictory inference principle. Attacks are then represented by combining this new implication with strong negation.
Under consideration in Theory and Practice of Logic Programming (TPLP). |
|---|---|
| AbstractList | In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. Logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the noncontradictory inference principle. Attacks are then represented by combining this new implication with strong negation.
Under consideration in Theory and Practice of Logic Programming (TPLP). In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. Logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the noncontradictory inference principle. Attacks are then represented by combining this new implication with strong negation. Under consideration in Theory and Practice of Logic Programming (TPLP). |
| Author | FARIÑAS DEL CERRO, LUIS FANDINNO, JORGE |
| Author_xml | – sequence: 1 givenname: JORGE orcidid: 0000-0002-3917-8717 surname: FANDINNO fullname: FANDINNO, JORGE – sequence: 2 givenname: LUIS surname: FARIÑAS DEL CERRO fullname: FARIÑAS DEL CERRO, LUIS |
| BookMark | eNplkM9KAzEQxoNUsFUfwFvA82r-b9bbUqwKRQvtfcmmybKlm9QkpXjzNXw9n8TUevM0w3w_Zr75JmDkvDMA3GB0hxEu75eYlRgJyQhBCGHMzsA4j3hBkcSj3x4XR_0CTGLcZERQwsZgUbcxBaUTrEO3H4xLKvXeQeXWsHbxYAJcmgQXwXdBDUPvuge4Ong4U9pE6C18Ndvo3ffnV4Rz3_X6CpxbtY3m-q9egtXscTV9LuZvTy_Tel5oImQquJQtsQJrqZDlrVTack5wq3m2TysqiLCVXZdc5V8krhBjqlTZta4qjVp6CW5Pa3fBv-9NTM3G74PLFxsiK0IFKyuZKXyidPAxBmObXegHFT4ajJpjbs2_3OgPtnlgxQ |
| Cites_doi | 10.1016/j.artint.2011.06.003 10.1016/j.jal.2013.03.009 10.1007/978-3-642-21940-5_12 10.1093/jigpal/jzw012 10.1017/S1471068408003323 10.1007/978-3-540-32254-2_5 10.1145/383779.383783 10.1093/logcom/13.3.319 10.1007/978-3-319-14726-0_17 10.1016/j.apal.2004.06.012 10.1016/1385-7258(72)90053-4 10.1145/116825.116838 10.1007/978-3-642-41524-1_7 10.1002/malq.19690151602 10.1016/0004-3702(80)90014-4 10.1016/j.artint.2012.04.001 10.1016/0004-3702(91)90013-A 10.1016/0004-3702(94)00041-X 10.1145/502807.502810 10.1016/S0306-4379(01)00020-5 10.1007/s11225-009-9218-x 10.1016/j.artint.2009.02.001 10.1093/jigpal/jzv033 10.1016/j.ijar.2014.12.004 10.1007/978-3-540-75526-5_4 10.2307/2274105 10.1007/BF02123283 10.1007/BF02121114 10.1007/s11225-009-9211-4 10.1007/978-3-319-90050-6_9 10.1016/j.ijar.2010.05.004 10.1007/s11787-014-0110-8 10.1007/978-3-642-33362-0_7 10.1007/BF03037169 10.1093/logcom/5.3.265 10.1093/logcom/exr033 10.1093/logcom/13.3.405 10.1016/0304-3975(89)90126-6 10.1016/j.artint.2016.01.011 10.1145/2043174.2043195 10.1007/s11225-005-8472-9 10.1007/978-3-540-30227-8_15 10.2307/2268973 10.1007/s10472-006-9028-z 10.1017/CBO9780511543357 10.1017/S1471068419000139 10.1007/s10472-007-9075-0 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2022. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (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), 2022. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| 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/S1471068422000114 |
| 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 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 |
| EISSN | 1475-3081 |
| EndPage | 467 |
| ExternalDocumentID | 10_1017_S1471068422000114 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYXX ABBXD ABGDZ ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABXHF ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AFFHD AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKMAY 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 CITATION 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 NIKVX O9- OYBOY P2P P62 PHGZM PHGZT PQGLB PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WYP ZYDXJ 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c268t-588b2f61c8a0f5b8acf5521bc5000393626f9fd75a114819044a7a016c99c0b3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000792359700001&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 | Mon Jul 14 08:11:53 EDT 2025 Sat Nov 29 04:58:37 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c268t-588b2f61c8a0f5b8acf5521bc5000393626f9fd75a114819044a7a016c99c0b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-3917-8717 |
| OpenAccessLink | https://doi.org/10.1017/s1471068422000114 |
| PQID | 2892364798 |
| PQPubID | 43613 |
| PageCount | 24 |
| ParticipantIDs | proquest_journals_2892364798 crossref_primary_10_1017_S1471068422000114 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-03-00 20230301 |
| PublicationDateYYYYMMDD | 2023-03-01 |
| PublicationDate_xml | – month: 03 year: 2023 text: 2023-03-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Cambridge |
| PublicationPlace_xml | – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationYear | 2023 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068422000114_ref18 S1471068422000114_ref19 Nelson (S1471068422000114_ref50) 1959 Nieves (S1471068422000114_ref52) 2008; 4 Brewka (S1471068422000114_ref15) 2013 Odintsov (S1471068422000114_ref55) 2005 S1471068422000114_ref51 S1471068422000114_ref10 S1471068422000114_ref54 S1471068422000114_ref53 S1471068422000114_ref12 S1471068422000114_ref56 S1471068422000114_ref11 S1471068422000114_ref14 S1471068422000114_ref58 S1471068422000114_ref57 S1471068422000114_ref13 S1471068422000114_ref16 Akama (S1471068422000114_ref1) 1987; 1 S1471068422000114_ref41 S1471068422000114_ref40 S1471068422000114_ref2 S1471068422000114_ref42 S1471068422000114_ref3 S1471068422000114_ref45 S1471068422000114_ref4 S1471068422000114_ref44 S1471068422000114_ref5 S1471068422000114_ref47 S1471068422000114_ref6 S1471068422000114_ref7 S1471068422000114_ref46 S1471068422000114_ref49 S1471068422000114_ref8 S1471068422000114_ref9 S1471068422000114_ref48 S1471068422000114_ref39 da Costa (S1471068422000114_ref26) 1974 S1471068422000114_ref72 Toni (S1471068422000114_ref69) 2011 S1471068422000114_ref71 S1471068422000114_ref30 S1471068422000114_ref74 Caminada (S1471068422000114_ref76) 2009; 2–3 Pearce (S1471068422000114_ref59) 1996 S1471068422000114_ref73 S1471068422000114_ref32 S1471068422000114_ref75 S1471068422000114_ref31 S1471068422000114_ref34 S1471068422000114_ref33 S1471068422000114_ref36 S1471068422000114_ref35 S1471068422000114_ref38 S1471068422000114_ref37 S1471068422000114_ref29 Cayrol (S1471068422000114_ref23) 2021 S1471068422000114_ref28 Kamide (S1471068422000114_ref43) 2015 Cabalar (S1471068422000114_ref17) 2017 Tseitin (S1471068422000114_ref70) 1968 S1471068422000114_ref61 S1471068422000114_ref60 S1471068422000114_ref63 S1471068422000114_ref62 S1471068422000114_ref21 S1471068422000114_ref65 S1471068422000114_ref64 S1471068422000114_ref20 S1471068422000114_ref67 S1471068422000114_ref22 S1471068422000114_ref66 S1471068422000114_ref25 S1471068422000114_ref24 S1471068422000114_ref68 S1471068422000114_ref27 |
| References_xml | – ident: S1471068422000114_ref5 – ident: S1471068422000114_ref56 doi: 10.1016/j.artint.2011.06.003 – ident: S1471068422000114_ref6 doi: 10.1016/j.jal.2013.03.009 – ident: S1471068422000114_ref41 doi: 10.1007/978-3-642-21940-5_12 – ident: S1471068422000114_ref35 doi: 10.1093/jigpal/jzw012 – ident: S1471068422000114_ref33 doi: 10.1017/S1471068408003323 – start-page: 57 volume-title: NMELP 1996, Selected Papers year: 1996 ident: S1471068422000114_ref59 – ident: S1471068422000114_ref74 – ident: S1471068422000114_ref9 doi: 10.1007/978-3-540-32254-2_5 – ident: S1471068422000114_ref45 doi: 10.1145/383779.383783 – volume: 4 start-page: 527 year: 2008 ident: S1471068422000114_ref52 article-title: Preferred extensions as stable models publication-title: TPLP 8 – start-page: 234 year: 1968 ident: S1471068422000114_ref70 article-title: On the complexity of derivation in the propositional calculus publication-title: Zapiski nauchnykh seminarov LOMI 8 – volume: 1 start-page: 18 year: 1987 ident: S1471068422000114_ref1 article-title: Constructive predicate logic with strong negation and model theory publication-title: Notre Dame Journal of Formal Logic 29 – ident: S1471068422000114_ref73 doi: 10.1093/logcom/13.3.319 – ident: S1471068422000114_ref72 doi: 10.1093/logcom/13.3.319 – start-page: 497 year: 1974 ident: S1471068422000114_ref26 article-title: On the theory of inconsistent formal systems publication-title: Notre Dame Journal of Formal Logic 15 – ident: S1471068422000114_ref30 doi: 10.1007/978-3-319-14726-0_17 – ident: S1471068422000114_ref58 doi: 10.1016/j.apal.2004.06.012 – ident: S1471068422000114_ref46 doi: 10.1016/1385-7258(72)90053-4 – ident: S1471068422000114_ref71 doi: 10.1145/116825.116838 – ident: S1471068422000114_ref31 doi: 10.1007/978-3-642-41524-1_7 – ident: S1471068422000114_ref68 doi: 10.1002/malq.19690151602 – ident: S1471068422000114_ref65 doi: 10.1016/0004-3702(80)90014-4 – ident: S1471068422000114_ref38 doi: 10.1016/j.artint.2012.04.001 – ident: S1471068422000114_ref75 – start-page: 164 volume-title: Argumentation and Answer Set Programming year: 2011 ident: S1471068422000114_ref69 – ident: S1471068422000114_ref63 doi: 10.1016/0004-3702(91)90013-A – ident: S1471068422000114_ref47 – ident: S1471068422000114_ref16 – ident: S1471068422000114_ref22 – ident: S1471068422000114_ref29 doi: 10.1016/0004-3702(94)00041-X – ident: S1471068422000114_ref64 – ident: S1471068422000114_ref27 doi: 10.1145/502807.502810 – ident: S1471068422000114_ref44 doi: 10.1016/S0306-4379(01)00020-5 – ident: S1471068422000114_ref57 – ident: S1471068422000114_ref28 – ident: S1471068422000114_ref11 – ident: S1471068422000114_ref21 doi: 10.1007/s11225-009-9218-x – ident: S1471068422000114_ref48 doi: 10.1016/j.artint.2009.02.001 – ident: S1471068422000114_ref34 – start-page: 624 volume-title: EPIA 2017, Proceedings year: 2017 ident: S1471068422000114_ref17 – volume-title: Proof Theory of N4-Related Paraconsistent Logics year: 2015 ident: S1471068422000114_ref43 – ident: S1471068422000114_ref37 doi: 10.1093/jigpal/jzv033 – start-page: 803 volume-title: IJCAI 2013, Proceedings year: 2013 ident: S1471068422000114_ref15 – ident: S1471068422000114_ref20 doi: 10.1016/j.ijar.2014.12.004 – start-page: 343 volume-title: LPNMR 2005, Proceedings year: 2005 ident: S1471068422000114_ref55 – ident: S1471068422000114_ref51 doi: 10.1007/978-3-540-75526-5_4 – ident: S1471068422000114_ref2 doi: 10.2307/2274105 – volume: 2–3 start-page: 383 year: 2009 ident: S1471068422000114_ref76 article-title: Complete extensions in argumentation coincide with 3-valued stable models in logic programming publication-title: Studia Logica 93 – ident: S1471068422000114_ref66 doi: 10.1007/BF02123283 – ident: S1471068422000114_ref42 doi: 10.1007/BF02121114 – ident: S1471068422000114_ref36 doi: 10.1007/s11225-009-9211-4 – ident: S1471068422000114_ref24 doi: 10.1007/978-3-319-90050-6_9 – ident: S1471068422000114_ref10 – ident: S1471068422000114_ref8 doi: 10.1016/j.ijar.2010.05.004 – ident: S1471068422000114_ref53 doi: 10.1007/s11787-014-0110-8 – start-page: 208 year: 1959 ident: S1471068422000114_ref50 article-title: Negation and separation of concepts in constructive systems publication-title: Constructivity in Mathematics – ident: S1471068422000114_ref32 doi: 10.1007/978-3-642-33362-0_7 – start-page: 1573 year: 2021 ident: S1471068422000114_ref23 article-title: Valid attacks in argumentation frameworks with recursive attacks publication-title: Annals of Mathematics and Artificial Intelligence 89 – ident: S1471068422000114_ref40 doi: 10.1007/BF03037169 – ident: S1471068422000114_ref39 – ident: S1471068422000114_ref67 doi: 10.1093/logcom/5.3.265 – ident: S1471068422000114_ref25 doi: 10.1007/978-3-319-90050-6_9 – ident: S1471068422000114_ref19 doi: 10.1093/logcom/exr033 – ident: S1471068422000114_ref13 doi: 10.1093/logcom/13.3.405 – ident: S1471068422000114_ref12 doi: 10.1016/0304-3975(89)90126-6 – ident: S1471068422000114_ref3 doi: 10.1016/j.artint.2016.01.011 – ident: S1471068422000114_ref14 doi: 10.1145/2043174.2043195 – ident: S1471068422000114_ref54 doi: 10.1007/s11225-005-8472-9 – ident: S1471068422000114_ref61 doi: 10.1007/978-3-540-30227-8_15 – ident: S1471068422000114_ref62 – ident: S1471068422000114_ref49 doi: 10.2307/2268973 – ident: S1471068422000114_ref60 doi: 10.1007/s10472-006-9028-z – ident: S1471068422000114_ref7 doi: 10.1017/CBO9780511543357 – ident: S1471068422000114_ref4 doi: 10.1017/S1471068419000139 – ident: S1471068422000114_ref18 doi: 10.1007/s10472-007-9075-0 |
| SSID | ssj0016324 |
| Score | 2.2872987 |
| Snippet | In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Index Database |
| StartPage | 444 |
| SubjectTerms | Declarative programming Equilibrium Inference Language Logic programming Mathematical programming Principles Semantics |
| Title | Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic |
| URI | https://www.proquest.com/docview/2892364798 |
| Volume | 23 |
| WOSCitedRecordID | wos000792359700001&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: 20241208 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: 20241208 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: 20241208 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/eLvHCXMwpV07T8MwELagZWChPEWhVB6YkCKa1G4cFlRQKyRQFKEOFUvkJ2JoUpqUrvwN_h6_BF8eoAqJhcWD48G6nO993yF0zpXpk74yjnGVdIjR3AmMF9ilT2Tgc-XqAmf2wQ9DNp0GURVwy6qyylomFoJapRJi5JfWMSiwzgN2PX91YGoUZFerERqbqOl6ngt8fu8731kEgCIvuot8qO5hpM5qAmQ0bMKe5xVmEVnXS-tiudA149Z_b7mLdiorEw9LtthDGzrZR616ggOuHvQBioYCQh0yt0efl7OqDynBPFF4mGQrOKtzHJVFXDOr5q7wZJXiMRRy4dTgUAPa4-f7R4ZharM8RJPxaHJ751QzFhzpDVjuUMaEZwauZLxnqGBcGmo1upC0bNu1_o4JjPIpB8fJWg-EcJ9b0sogkD3RP0KNJE30McJMDQDuUUsqBNE9zn0jAK3OmoSGGmXa6KImcDwvkTTissTMj3_9jTbq1PSNq0eVxT_EPfn78ynahqnwZalYBzXyxVKfoS35lr9kiy5q3ozC6LFb8IpdI_r0BTo3xmg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NSsNAEB60Cnqx_mK16h70IgTbdNNsBJGilhZr6KEH8RI2-yMeTLRJLd58DR_Cl_JJ3MmPIoI3D15y2CyBZCbzzezMfAOwz6Vu0ZbUlm5KYVGtuOVp2zOXFhWey2VTZTyzA9f32fW1N5yBt7IXBssqS5uYGWoZCzwjPzKBQcZ17rHTh0cLp0ZhdrUcoZGrxaV6npqQLTnpnxv5Hth292J01rOKqQKWsNsstRzGQlu3m4LxhnZCxoV2DIaFwskbVY2Hrz0tXYdjqGDwklLucuMZCc8TjbBlHjsLc5SaWMn8PkPn5jNpgcznWTOTi8VEjJZJVGSoxkVcs-3MC6PfYfA7CmTQ1q3-s4-yDEuFD006udKvwIyKVqFazqcghblag2EnxIMckZqtt5P7ossqIjySpBMlU9yrUjLMS9TuDYgfk9E0Jl0sUyOxJr5CLsv3l9eE4ExqsQ6jv3itDahEcaQ2gTDZRjJLJZwwpKrBuatD5OIzDq92tNQ1OCzlGTzkPCFBXkDnBj-EX4N6Kc6gMBlJ8CXLrd9v78FCb3Q1CAZ9_3IbFm3jdeVFcXWopOOJ2oF58ZTeJePdTD0JBH8s-Q9hgB3h |
| 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=Abstract+Argumentation+and+Answer+Set+Programming%3A+Two+Faces+of+Nelson%E2%80%99s+Logic&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FANDINNO%2C+JORGE&rft.au=LUIS+FARI%C3%91AS+DEL+CERRO&rft.date=2023-03-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=2&rft.spage=444&rft.epage=467&rft_id=info:doi/10.1017%2FS1471068422000114 |
| 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 |