Interdefinability of defeasible logic and logic programming under the well-founded semantics
We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to th...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 13; H. 1; S. 107 - 142 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, UK
Cambridge University Press
01.01.2013
|
| Schlagworte: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond–Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories. |
|---|---|
| AbstractList | We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories. Abstract We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the ambiguity propagating defeasible logic ADL correspond to those of the well-founded semantics for normal logic programs, and so it turns out that the two formalisms are closely related. Using the same translation of logic programs into defeasible theories, the semantics for the ambiguity blocking defeasible logic NDL can be seen as indirectly providing an ambiguity blocking semantics for logic programs. We also provide antimonotone operators for both ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic programs. For defeasible theories without defeaters or priorities on rules, the operator for ADL corresponds to the GL operator and so can be seen as partially capturing the consequences according to ADL. Similarly, the operator for NDL captures the consequences according to NDL, though in this case no restrictions on theories apply. Both operators can be used to define stable model semantics for defeasible theories. [PUBLICATION ABSTRACT] |
| Author | MAIER, FREDERICK |
| Author_xml | – sequence: 1 givenname: FREDERICK surname: MAIER fullname: MAIER, FREDERICK email: fred@knoesis.org organization: Kno.e.sis Center, Department of Computer Science & Engineering, Wright State University, 3640 Colonel Glenn Hwy, Dayton, OH 45435, USA (e-mail: fred@knoesis.org, fmaier@uga.edu) |
| BookMark | eNp9kEtLxDAUhYMoqKM_wF3BjZtqbpMm7VLEFwy4UMGFUNL0Zoy0iSYZxH9vRmchiq7uI-e7OZxdsum8Q0IOgB4DBXlyC1wCFQ0HoJRyeNggO3lVl4w2sPnZQ7l63ya7MT5TCoJVfIc8XruEYUBjnertaNN74U2RZ1TR9iMWo19YXSg3rLuX4BdBTZN1i2LpBgxFesLiDcexNH61GIqIk3LJ6rhHtowaI-6v64zcX5zfnV2V85vL67PTealZy1KptGgHhrRXtWyxqWptoKkFqwetKzBGNMC11D2o2hgmocVK9koINLLlTaPZjBx93c3mXpcYUzfZqLMl5dAvYwcMasE5hypLD39In_0yuOyug0rI_HmTk5kR-aXSwccY0HTaJpWsdykoO3ZAu1Xq3a_UMwk_yJdgJxXe_2XYmlFTH-ywwG-m_qQ-AKFMlZs |
| CitedBy_id | crossref_primary_10_1017_S1471068417000266 crossref_primary_10_1017_S1471068421000387 |
| Cites_doi | 10.1016/0004-3702(80)90014-4 10.1007/BF00881799 10.1016/0004-3702(90)90057-7 10.1145/116825.116838 10.1145/191843.191927 10.1145/371316.371517 10.1023/A:1010551204574 10.1007/11853886_26 10.1093/logcom/3.4.379 10.1145/321978.321991 10.1613/jair.284 10.1093/oso/9780198537472.003.0007 10.1016/0743-1066(87)90007-0 10.1007/978-94-015-8851-5_12 10.2140/pjm.1955.5.285 10.1002/int.20147 10.1017/S1471068406002778 10.1080/09528139008953720 10.1007/BF03037169 10.1093/logcom/14.5.675 10.1007/s11229-009-9492-1 10.1142/S0218213001000623 10.1016/0004-3702(91)90061-N 10.1007/978-3-540-87803-2_5 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2011 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2011 |
| 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/S147106841100041X |
| 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 Journals Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student Proquest 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 | Computer and Information Systems Abstracts Computer Science Database CrossRef |
| 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 | F. Maier Interdefinability of defeasible logic and logic programming under the WFS |
| EISSN | 1475-3081 |
| EndPage | 142 |
| ExternalDocumentID | 2861210701 10_1017_S147106841100041X |
| Genre | Feature |
| 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 AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT 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 IPYYG 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 WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFFHD AFZFC AKMAY CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U PUEGO |
| ID | FETCH-LOGICAL-c393t-ac69d3e0ba579e825cf185635dcc21ff6814c7cb1a5ff3719e27ba66ef79488c3 |
| IEDL.DBID | P5Z |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000313293200004&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 | Thu Sep 04 16:01:54 EDT 2025 Sun Nov 09 08:42:59 EST 2025 Tue Nov 18 22:10:24 EST 2025 Sat Nov 29 04:58:34 EST 2025 Wed Mar 13 05:53:19 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | well-founded semantics logic programming ambiguity blocking and propagation defeasible logic stable model semantics |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c393t-ac69d3e0ba579e825cf185635dcc21ff6814c7cb1a5ff3719e27ba66ef79488c3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8AA2783562F626B04275989C1B41DAE8/S147106841100041Xa.pdf/div-class-title-interdefinability-of-defeasible-logic-and-logic-programming-under-the-well-founded-semantics-div.pdf |
| PQID | 1267825816 |
| PQPubID | 43613 |
| PageCount | 36 |
| ParticipantIDs | proquest_miscellaneous_1315644412 proquest_journals_1267825816 crossref_citationtrail_10_1017_S147106841100041X crossref_primary_10_1017_S147106841100041X cambridge_journals_10_1017_S147106841100041X |
| PublicationCentury | 2000 |
| PublicationDate | 20130100 2013-01-00 20130101 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – month: 01 year: 2013 text: 20130100 |
| 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 | 2013 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | Nute (S147106841100041X_ref32) 1994 S147106841100041X_ref18 Nute (S147106841100041X_ref34) 1999 S147106841100041X_ref38 Nute (S147106841100041X_ref31) 1986 S147106841100041X_ref39 S147106841100041X_ref14 S147106841100041X_ref15 S147106841100041X_ref37 S147106841100041X_ref13 S147106841100041X_ref33 Nute (S147106841100041X_ref36) 1989 Billington (S147106841100041X_ref10) 2005 Marek (S147106841100041X_ref30) 1989 Antoniou (S147106841100041X_ref2) 2001 Antoniou (S147106841100041X_ref6) 2000 Maher (S147106841100041X_ref25) 1999 S147106841100041X_ref9 S147106841100041X_ref29 S147106841100041X_ref27 S147106841100041X_ref28 S147106841100041X_ref5 S147106841100041X_ref8 Billington (S147106841100041X_ref12) 2007 S147106841100041X_ref26 S147106841100041X_ref7 S147106841100041X_ref23 Governatori (S147106841100041X_ref21) 2000 S147106841100041X_ref24 Brewka (S147106841100041X_ref16) 1996; 4 S147106841100041X_ref1 S147106841100041X_ref43 S147106841100041X_ref4 S147106841100041X_ref22 S147106841100041X_ref41 Antoniou (S147106841100041X_ref3) 2000 S147106841100041X_ref42 S147106841100041X_ref20 Nute (S147106841100041X_ref35) 2003 Billington (S147106841100041X_ref11) 2005 Gelfond (S147106841100041X_ref19) 1988 Brewka (S147106841100041X_ref17) 2001 Syrjänen (S147106841100041X_ref40) 2001 |
| References_xml | – ident: S147106841100041X_ref37 doi: 10.1016/0004-3702(80)90014-4 – ident: S147106841100041X_ref7 doi: 10.1007/BF00881799 – ident: S147106841100041X_ref23 doi: 10.1016/0004-3702(90)90057-7 – ident: S147106841100041X_ref39 – ident: S147106841100041X_ref43 doi: 10.1145/116825.116838 – ident: S147106841100041X_ref38 doi: 10.1145/191843.191927 – ident: S147106841100041X_ref4 doi: 10.1145/371316.371517 – start-page: 121 volume-title: Proc. of 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '01) year: 2001 ident: S147106841100041X_ref17 – start-page: 796 volume-title: Proc. of 18th Australian Joint Conference on Artificial Intelligence (AUS–AI '05) year: 2005 ident: S147106841100041X_ref10 – ident: S147106841100041X_ref15 doi: 10.1023/A:1010551204574 – ident: S147106841100041X_ref28 doi: 10.1007/11853886_26 – start-page: 27 volume-title: Proc. of 6th Pacific Rim international conference on Artificial intelligence (PRICAI '00) year: 2000 ident: S147106841100041X_ref21 – ident: S147106841100041X_ref8 doi: 10.1093/logcom/3.4.379 – start-page: 151 volume-title: Proc. of 14th International Conference on Applications of Prolog (INAP '01) year: 2003 ident: S147106841100041X_ref35 – ident: S147106841100041X_ref42 doi: 10.1145/321978.321991 – start-page: 459 volume-title: Proc. of 14th European Conference on Artificial Intelligence (ECAI '00) year: 2000 ident: S147106841100041X_ref6 – start-page: 1070 volume-title: Proc. of 5th International Conference on Logic Programming (ICLP '88) year: 1988 ident: S147106841100041X_ref19 – start-page: 256 volume-title: Proc. of 20th International Joint Conference on Artifical Intelligence (IJCAI '07) year: 2007 ident: S147106841100041X_ref12 – volume: 4 start-page: 19 year: 1996 ident: S147106841100041X_ref16 article-title: Well-founded semantics for extended logic programs with dynamic preferences publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.284 – ident: S147106841100041X_ref9 – start-page: 353 volume-title: Handbook of Logic for Artificial Intelligence and Logic Programming year: 1994 ident: S147106841100041X_ref32 doi: 10.1093/oso/9780198537472.003.0007 – volume-title: LDR: A Logic for Defeasible Resasoning year: 1986 ident: S147106841100041X_ref31 – start-page: 434 volume-title: Proc. of 6th International Conference Logic Programming and Nonmonotonic Reasoning (LPNMR '01) year: 2001 ident: S147106841100041X_ref40 – ident: S147106841100041X_ref24 doi: 10.1016/0743-1066(87)90007-0 – ident: S147106841100041X_ref33 doi: 10.1007/978-94-015-8851-5_12 – ident: S147106841100041X_ref41 doi: 10.2140/pjm.1955.5.285 – ident: S147106841100041X_ref1 doi: 10.1002/int.20147 – ident: S147106841100041X_ref5 doi: 10.1017/S1471068406002778 – ident: S147106841100041X_ref14 doi: 10.1080/09528139008953720 – ident: S147106841100041X_ref20 doi: 10.1007/BF03037169 – start-page: 69 volume-title: Proc. of Tübingen Workshop on Semantic Networks and Nonmonotonic Reasoning year: 1989 ident: S147106841100041X_ref36 – start-page: 405 volume-title: Proc. of 17th National Conference on Artificial Intelligence (AAAI '00 year: 2000 ident: S147106841100041X_ref3 – ident: S147106841100041X_ref22 doi: 10.1093/logcom/14.5.675 – start-page: 243 volume-title: Proc. of 1989 North American Conference on Logic Programming (NACLP '89) year: 1989 ident: S147106841100041X_ref30 – start-page: 812 volume-title: Proc. of 18th Australian Joint Conference on Artificial Intelligence (AUS–AI '05) year: 2005 ident: S147106841100041X_ref11 – start-page: 201 volume-title: Norms, Logics and Information Systems year: 1999 ident: S147106841100041X_ref34 – ident: S147106841100041X_ref27 doi: 10.1007/s11229-009-9492-1 – ident: S147106841100041X_ref26 doi: 10.1142/S0218213001000623 – ident: S147106841100041X_ref29 doi: 10.1016/0004-3702(91)90061-N – start-page: 299 volume-title: Proc. of 16th National Conference on Artificial Intelligence (AAAI '99) year: 1999 ident: S147106841100041X_ref25 – ident: S147106841100041X_ref18 – ident: S147106841100041X_ref13 doi: 10.1007/978-3-540-87803-2_5 – start-page: 13 volume-title: Proc. of 14th Australian Joint Conference on Artificial Intelligence (AUS-AI '01) year: 2001 ident: S147106841100041X_ref2 |
| SSID | ssj0016324 |
| Score | 1.9710864 |
| Snippet | We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under... Abstract We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction.... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 107 |
| SubjectTerms | Ambiguity Constrictions Formalism Logic Logic programming Operators Regular Papers Semantics Translations |
| Title | Interdefinability of defeasible logic and logic programming under the well-founded semantics |
| URI | https://www.cambridge.org/core/product/identifier/S147106841100041X/type/journal_article https://www.proquest.com/docview/1267825816 https://www.proquest.com/docview/1315644412 |
| Volume | 13 |
| WOSCitedRecordID | wos000313293200004&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: 20241213 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: 20241213 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: 20241213 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/eLvHCXMwpV1bS-QwFD542Yd98bIXnFWHLOyTbNi2aXN5EhVFUIZhUZBlYUjTBATt6HRc2H-_53TSuiLMiy-lTdOS9uRcODn5PoBvDsNcm-QVLwQe8txLbkOScCNpgjjpnGsh8y_VaKRvbsw4JtyaWFbZ2cTWUFdTRznyH2mGZjUrdCoPHx45sUbR6mqk0FiFdUJJIOqGcfGrX0UgKPJ2d5Gi6h6dd6uaBBlNjdRGkGlJTpCNz9gKL33USxPd-p2zzbeOeAs2YsTJjhZTZBtWfP0BNjs2BxaV-yP8bpODlQ-0nYoqZv-yaWB47S2qzZ1nrZVktq7iWSztukfnx2gr2oxhMMkoGcgDkTX5ijX-HiV365pPcH12enVyziP3AnfCiDm3TppK-KS0hTIeP8MF9OwYnVQOxRuC1GnulCtTW4QgVGp8pkorpQ-o4Fo78RnW6mntd4AZG0otLYZKpc21EEaXWljiuPdKVqYYwPf-z0-iBjWTRfWZmrwS1ACSTjgTF3HMiU7jbtkjB_0jDwsQj2Wd9zpx_jeaXpYD-NrfRk2k5RVb--kT9hEEvIPhZfZl-St24X3WkmpQImcP1uazJ78P79yf-W0zG8L68elo_HMIqxeKD9sJ_Q_kfPdp |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RqFQuhb7EUkpdqb1UtZrEiR8HhCoeAu121QOVOFRKHceWkCALm6UVf6q_sTPZJC1C2hsHLlHiOJYTf56Z2DPfALx3aObaKC15JvCQpl5yG6KIG0kAcdI511Dmj9R4rE9Pzbcl-NPFwpBbZScTG0FdThytkX-OExSrSaZjuXt5xSlrFO2udik05rAY-pvf-MtW7xzv4_h-SJLDg5O9I95mFeBOGDHj1klTCh8VNlPGY5MuoM5CvVs67HgIUsepU66IbRaCULHxiSqslD4gdLV2Att9BCup0Irm1VDxfteCqM-baCZF3kQ67XZRiaKaCqmMKNqilCgi_3E53NaJt1VCo-cO1x7aF1qHp61Fzb7Mp8AzWPLVc1jrslWwVni9gB_N4mfpA4WLkUfwDZsEhtfeolg496zRAsxWZXvWuq5doHJnFGo3ZWgsM1rs5IGSUfmS1f4CkXnm6pfw_V7e8RUsV5PKbwAzNhRaWjQFC5tqIYwutLAoN2OvZGmyAXzqRzpvJUSdz73rVH4HGAOIOjDkruVpp3Qh54se-dg_cjknKVlUeauDz3-96bEzgHf9bZQ0tH1kKz-5xjqCiIXQfE42FzfxFp4cnXwd5aPj8fA1rCZNAhFatNqC5dn02r-Bx-7X7KyebjfTh8HP-0bjX9EFUtQ |
| 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=Interdefinability+of+defeasible+logic+and+logic+programming+under+the+well-founded+semantics&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=Maier%2C+Frederick&rft.date=2013-01-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=13&rft.issue=1&rft.spage=107&rft.epage=142&rft_id=info:doi/10.1017%2FS147106841100041X&rft.externalDBID=NO_FULL_TEXT |
| 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 |