An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferen...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming Jg. 20; H. 5; S. 751 - 766 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, UK
Cambridge University Press
01.09.2020
|
| Schlagworte: | |
| ISSN: | 1471-0684, 1475-3081 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka’s framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ$\mathcal L_ \bot ^ + $. |
|---|---|
| AbstractList | In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka’s framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ$\mathcal L_ \bot ^ + $. In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka’s framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin ) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ $\mathcal L_ \bot ^ + $ . |
| Author | Giordano, Laura Theseider Dupré, Daniele |
| Author_xml | – sequence: 1 givenname: Laura orcidid: 0000-0001-9445-7770 surname: Giordano fullname: Giordano, Laura email: laura.giordano@uniupo.it organization: DISIT, Università del Piemonte Orientale, Italy (e-mail: laura.giordano@uniupo.it, dtd@uniupo.it) – sequence: 2 givenname: Daniele surname: Theseider Dupré fullname: Theseider Dupré, Daniele email: laura.giordano@uniupo.it organization: DISIT, Università del Piemonte Orientale, Italy (e-mail: laura.giordano@uniupo.it, dtd@uniupo.it) |
| BookMark | eNp9kE1LAzEQhoNUsH78AG8Bz6uZJLvZHkv9hIJK9bxMs9k2ZZus2ZTivze1gqBoDslk5n1mXuaYDJx3hpBzYJfAQF3NQCpgRSk5S0eUcECGKZVngpUw-Iwh29WPyHHfrxiDQnA5JM9jR8ezJ4pdFzzqJW18oMFg7511C2odRaq906aLGW4xGLretNF2wTQmGBcttrS1i2Xcmt1Nr6en5LDBtjdnX-8Jeb29eZncZ9PHu4fJeJppUbCY6WROqXlTj8BgoRUT-bw26c_LWvGmlo0UTEozAolFyUDnI5RaY15o4JxJcUIu9n2T8beN6WO18pvg0siKSyl5LqFQSQV7lQ6-75Prqgt2jeG9AlbtNlf92lxi1A9G24jRehcD2vZfUnyRuJ4HWy_Mt6m_qQ-h5IH4 |
| CitedBy_id | crossref_primary_10_1017_S1471068420000381 crossref_primary_10_1016_j_artint_2023_104023 crossref_primary_10_1017_S1471068421000284 crossref_primary_10_1017_S1471068422000163 crossref_primary_10_1016_j_ijar_2023_109065 crossref_primary_10_1093_logcom_exab082 |
| Cites_doi | 10.1007/978-3-319-25007-6_21 10.1613/jair.4062 10.1016/j.ijar.2018.08.005 10.3233/FI-2018-1659 10.1007/978-3-642-15675-5_21 10.1016/j.artint.2017.12.005 10.1007/BF00883932 10.1613/jair.2763 10.1609/aaai.v29i1.9398 10.1016/0004-3702(90)90101-5 10.1007/s10472-017-9571-9 10.1017/S1471068420000381 10.1007/BF01536399 10.1007/BF01535841 10.1016/j.artint.2019.04.001 10.1016/j.ins.2018.09.037 10.1145/505372.505373 10.1016/j.artint.2008.04.002 10.3233/FI-2018-1698 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2020. Published by Cambridge University Press |
| Copyright_xml | – notice: The Author(s), 2020. Published by Cambridge University Press |
| 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/S1471068420000381 |
| 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 & Aerospace Database (1962 - current) ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One Community College 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 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 | 766 |
| ExternalDocumentID | 10_1017_S1471068420000381 |
| 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 |
| ID | FETCH-LOGICAL-c360t-c47577bfd91ea6c7035bdebfd28d72fd4f43044e914a6801c59a4cca56c122043 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000571619500012&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 | Fri Jul 25 07:14:37 EDT 2025 Sat Nov 29 04:58:37 EST 2025 Tue Nov 18 21:51:04 EST 2025 Wed Mar 13 05:46:36 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Description Logics Nonmonotonic Reasoning Preferences ASP |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c360t-c47577bfd91ea6c7035bdebfd28d72fd4f43044e914a6801c59a4cca56c122043 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9445-7770 |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6FBD8E96D44319C7515E22B1F796C8BD/S1471068420000381a.pdf/div-class-title-an-asp-approach-for-reasoning-in-a-concept-aware-multipreferential-lightweight-dl-div.pdf |
| PQID | 2444254167 |
| PQPubID | 43613 |
| PageCount | 16 |
| ParticipantIDs | proquest_journals_2444254167 crossref_primary_10_1017_S1471068420000381 crossref_citationtrail_10_1017_S1471068420000381 cambridge_journals_10_1017_S1471068420000381 |
| PublicationCentury | 2000 |
| PublicationDate | 20200900 2020-09-00 20200901 |
| PublicationDateYYYYMMDD | 2020-09-01 |
| PublicationDate_xml | – month: 09 year: 2020 text: 20200900 |
| PublicationDecade | 2020 |
| 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 | 2020 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068420000381_ref8 S1471068420000381_ref9 Kazakov (S1471068420000381_ref34) 2014; 1 S1471068420000381_ref24 S1471068420000381_ref4 S1471068420000381_ref22 S1471068420000381_ref44 S1471068420000381_ref28 S1471068420000381_ref26 Casini (S1471068420000381_ref17) 2013 S1471068420000381_ref27 S1471068420000381_ref3 Baader (S1471068420000381_ref1) 2005 Bonatti (S1471068420000381_ref5) 2015 S1471068420000381_ref31 Giordano (S1471068420000381_ref25) 2018; 1 S1471068420000381_ref32 S1471068420000381_ref10 Britz (S1471068420000381_ref14) 2008 Eiter (S1471068420000381_ref21) 1995; 3 Eiter (S1471068420000381_ref23) 2008; 12 Bonatti (S1471068420000381_ref7) 2009 Pensel (S1471068420000381_ref43) 2018 S1471068420000381_ref19 Casini (S1471068420000381_ref18) 2019 Donini (S1471068420000381_ref20) 2002; 2 Casini (S1471068420000381_ref16) 2010; 6341 S1471068420000381_ref35 Lehmann (S1471068420000381_ref39) 1995; 1 S1471068420000381_ref13 S1471068420000381_ref36 S1471068420000381_ref33 S1471068420000381_ref11 S1471068420000381_ref12 Giordano (S1471068420000381_ref29) 2016; 5 S1471068420000381_ref37 S1471068420000381_ref15 Bonatti (S1471068420000381_ref6) 2011 S1471068420000381_ref38 Baader (S1471068420000381_ref2) 1995; 1 S1471068420000381_ref42 S1471068420000381_ref40 Motik (S1471068420000381_ref41) 2010 Giordano (S1471068420000381_ref30) 2018; 1 |
| References_xml | – ident: S1471068420000381_ref8 doi: 10.1007/978-3-319-25007-6_21 – ident: S1471068420000381_ref38 – ident: S1471068420000381_ref40 – ident: S1471068420000381_ref15 – ident: S1471068420000381_ref32 – ident: S1471068420000381_ref11 – start-page: 415 year: 2013 ident: S1471068420000381_ref17 article-title: Defeasible inheritance-based description logics publication-title: Journal of Artificial Intelligence Research (JAIR) 48 doi: 10.1613/jair.4062 – start-page: 28 year: 2018 ident: S1471068420000381_ref43 article-title: Reasoning in the defeasible description logic EL- computing standard inferences under rational and relevant semantics publication-title: J. Approx. Reasoning 103 doi: 10.1016/j.ijar.2018.08.005 – volume: 1 start-page: 95 year: 2018 ident: S1471068420000381_ref25 article-title: Towards a rational closure for expressive description logics: the case of SHIQ publication-title: Fundam. Inform. 159 doi: 10.3233/FI-2018-1659 – ident: S1471068420000381_ref42 – ident: S1471068420000381_ref28 – ident: S1471068420000381_ref44 – ident: S1471068420000381_ref37 doi: 10.1007/978-3-642-15675-5_21 – ident: S1471068420000381_ref10 doi: 10.1016/j.artint.2017.12.005 – ident: S1471068420000381_ref24 – volume: 1 start-page: 149 year: 1995 ident: S1471068420000381_ref2 article-title: Embedding defaults into terminological knowledge representation formalisms publication-title: J. Autom. Reasoning 14 doi: 10.1007/BF00883932 – start-page: 717 year: 2009 ident: S1471068420000381_ref7 article-title: The Complexity of Circumscription in DLs publication-title: Journal of Artificial Intelligence Research (JAIR) 35 doi: 10.1613/jair.2763 – ident: S1471068420000381_ref13 doi: 10.1609/aaai.v29i1.9398 – ident: S1471068420000381_ref26 – ident: S1471068420000381_ref36 doi: 10.1016/0004-3702(90)90101-5 – ident: S1471068420000381_ref22 – ident: S1471068420000381_ref9 – ident: S1471068420000381_ref19 – year: 2008 ident: S1471068420000381_ref14 – ident: S1471068420000381_ref3 doi: 10.1007/s10472-017-9571-9 – ident: S1471068420000381_ref31 doi: 10.1017/S1471068420000381 – volume: 3 start-page: 289 year: 1995 ident: S1471068420000381_ref21 article-title: On the computational cost of disjunctive logic programming: Propositional case publication-title: Annals of Mathematics and Artificial Intelligence 15 doi: 10.1007/BF01536399 – ident: S1471068420000381_ref12 – ident: S1471068420000381_ref35 – start-page: 719 year: 2011 ident: S1471068420000381_ref6 article-title: Defeasible inclusions in low-complexity dls publication-title: J. Artif. Intell. Res. (JAIR) 42 – volume: 5 start-page: 738 year: 2016 ident: S1471068420000381_ref29 article-title: ASP for minimal entailment in a rational extension of SROEL publication-title: TPLP 16 – ident: S1471068420000381_ref33 – volume: 1 start-page: 61 year: 1995 ident: S1471068420000381_ref39 article-title: Another perspective on default reasoning publication-title: Ann. Math. Artif. Intell. 15, doi: 10.1007/BF01535841 – ident: S1471068420000381_ref4 doi: 10.1016/j.artint.2019.04.001 – start-page: 588 year: 2019 ident: S1471068420000381_ref18 article-title: A polynomial time subsumption algorithm for nominal safe elo under rational closure publication-title: Inf. Sci. 501 doi: 10.1016/j.ins.2018.09.037 – start-page: 1 year: 2015 ident: S1471068420000381_ref5 article-title: A new semantics for overriding in description logics publication-title: Artif. Intell. 222 – volume: 2 start-page: 177 year: 2002 ident: S1471068420000381_ref20 article-title: Description logics of minimal knowledge and negation as failure publication-title: ACM Transactions on Computational Logic (ToCL) 3 doi: 10.1145/505372.505373 – volume: 1 start-page: 1 year: 2014 ident: S1471068420000381_ref34 article-title: The incredible ELK publication-title: J. Autom. Reasoning 53 – volume: 12 start-page: 1495 year: 2008 ident: S1471068420000381_ref23 article-title: Combining answer set programming with description logics for the semantic web publication-title: Artif. Intell. 172 doi: 10.1016/j.artint.2008.04.002 – ident: S1471068420000381_ref27 – volume: 1 start-page: 135 year: 2018 ident: S1471068420000381_ref30 article-title: Defeasible Reasoning in SROEL from Rational Entailment to Rational Closure publication-title: Fundam. Inform. 161 doi: 10.3233/FI-2018-1698 – volume: 6341 year: 2010 ident: S1471068420000381_ref16 – start-page: 5 year: 2010 ident: S1471068420000381_ref41 article-title: Reconciling Description Logics and rules publication-title: J. ACM 57 – year: 2005 ident: S1471068420000381_ref1 |
| SSID | ssj0016324 |
| Score | 2.4108806 |
| Snippet | In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 751 |
| SubjectTerms | Declarative programming Inclusions Lightweight Mathematical programming Original Article Reasoning Semantics |
| Title | An ASP approach for reasoning in a concept-aware multipreferential lightweight DL |
| URI | https://www.cambridge.org/core/product/identifier/S1471068420000381/type/journal_article https://www.proquest.com/docview/2444254167 |
| Volume | 20 |
| WOSCitedRecordID | wos000571619500012&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: 20241207 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: 20241207 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: 20241207 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/eLvHCXMwpV3LS8MwGA-6efDifOJ0jhw8icE-0qY9yXwMwTHqk-Fl5AmD0c1tun_fJE03h7CLl0LTBkK-L987vw-A89jjgaRMaN8kkQgr4iMqEg95QinBUsKZxdJ775BuN-n10swF3KaurLKUiVZQixE3MfIrrYY0e2nzgVyPP5HpGmWyq66Fxiao-kHgGz5_JGiRRTBQ5PZ2ETHVPQkus5oGMtoMmjFzVcVky35jK6zqqFURbfVOu_bfFe-CHWdxwlbBIntgQ-b7oFZ2c4DucB-Ap1YOWy8ZLFHGoTZnoSlZtwFbOMghhby45IjonE4kLIoRXaMSLSmGcGhc_bmNtsK7ziF4a9-_3j4g13AB8TD2ZohjEhHClEh9SWOuhUHEhNTvQSJIoARWOPQwlqmPaaxVG49SijULRDHX2-_h8AhU8lEujwHEQgqsfU8_MABmKmY0YYyzmHERapNA1cHlYrv77thM-0XJGen_oU4deCVF-tyBl5seGsN1Uy4WU8YFcse6nxslDZerWRLwZP3nU7AdGDfclp41QGU2-ZJnYIt_zwbTSRNUb-672XPT8qZ-ZtHHD7tM5vk |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JS8NAFH64gV7cxd056EUMJnGSSQ4ixQXFWiouiJc4W0AoUdtq8U_5G30vS1WE3jx4zCQTMpk3b3_fA9gMXe1bqQzaJpF1eCo8R5rIdVyTpkbFQqscS--2LhqN6O4ubg7BR1ULQ2mVFU_MGbV50uQj30UxhOSF6oM4eH5xqGsURVerFhoFWZzb9x6abJ39syPc3y3fPzm-Pjx1yq4Cjt4L3a6juQiEUKmJPStDjRQfKGPx2o-M8FPDU44mPrexx2WI_FsHseS4ziDUnk-VpPjeYRjFr_GoVUQzuO9HLQj6PK9mEpRNFPEqikoQ1TRIY1QaQ9G571gOP2XiT5GQy7mTqf_2h6ZhstSoWa04AjMwZLNZmKq6VbCSec3BZS1jtasmq1DUGarrjFLyc4c0e8yYZLoo4nRkT7YtK5Ity0YsyAlbrEWujF7uTWZH9Xm4-ZOFLcBI9pTZRWDcWMPRtvZ8AmhLQyUjpbQKlTZ7qPKkS7DT396kZAudpEipE8kvalgCt6KARJfg7NQjpDVoynZ_ynOBTDLo4dWKZr6-5otglgff3oDx0-uLelI_a5yvwIRPLoc8zW4VRrrtV7sGY_qt-9hpr-fngcHDX5PXJ1D9Qdg |
| 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=An+ASP+approach+for+reasoning+in+a+concept-aware+multipreferential+lightweight+DL&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=Giordano%2C+Laura&rft.au=Theseider+Dupr%C3%A9%2C+Daniele&rft.date=2020-09-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=20&rft.issue=5&rft.spage=751&rft.epage=766&rft_id=info:doi/10.1017%2FS1471068420000381&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068420000381 |
| 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 |