Defeasible Reasoning via Datalog
We address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic DL (∂ || ), but the techniques we use apply to many other defeasible logics. Structural properties of DL (∂ || ) are identified that support efficient...
Gespeichert in:
| Veröffentlicht in: | Theory and practice of logic programming 2023-09, Vol.23 (5), p.986-1028 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1028 |
|---|---|
| container_issue | 5 |
| container_start_page | 986 |
| container_title | Theory and practice of logic programming |
| container_volume | 23 |
| creator | MAHER, MICHAEL J. |
| description | We address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic
DL
(∂
||
), but the techniques we use apply to many other defeasible logics. Structural properties of
DL
(∂
||
) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog¬ implementations. |
| doi_str_mv | 10.1017/S1471068421000387 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2892367344</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2892367344</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1184-65c299f9db4bb2509fa581ea97a5b49e45bead7b24f0cdd57bd5586521521e783</originalsourceid><addsrcrecordid>eNplkFtLAzEQhYMoWKs_wLcFn1dncs-jtN6gUKj6HJJNUrasuzVpBf-9W-ubMDAf5xxm4BByjXCLgOruFblCkJpTBACm1QmZjJKoGWg8_WWsD_45uShlA4CSUT4h1Tym6Erru1itRhj6tl9XX62r5m7numF9Sc6S60q8-ttT8v748DZ7rhfLp5fZ_aJuEDWvpWioMckEz72nAkxyQmN0RjnhuYlc-OiC8pQnaEIQygchtBQUx4lKsym5Od7d5uFzH8vOboZ97seXlmpDmVSM8zGFx1STh1JyTHab2w-Xvy2CPRRh_xXBfgD1G02s</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2892367344</pqid></control><display><type>article</type><title>Defeasible Reasoning via Datalog</title><source>Cambridge University Press Journals Complete</source><creator>MAHER, MICHAEL J.</creator><creatorcontrib>MAHER, MICHAEL J.</creatorcontrib><description>We address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic
DL
(∂
||
), but the techniques we use apply to many other defeasible logics. Structural properties of
DL
(∂
||
) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog¬ implementations.</description><identifier>ISSN: 1471-0684</identifier><identifier>EISSN: 1475-3081</identifier><identifier>DOI: 10.1017/S1471068421000387</identifier><language>eng</language><publisher>Cambridge: Cambridge University Press</publisher><subject>Approximation ; Logic programming ; Logic programs ; Semantics</subject><ispartof>Theory and practice of logic programming, 2023-09, Vol.23 (5), p.986-1028</ispartof><rights>The Author(s), 2021. Published by Cambridge University Press</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1184-65c299f9db4bb2509fa581ea97a5b49e45bead7b24f0cdd57bd5586521521e783</citedby><cites>FETCH-LOGICAL-c1184-65c299f9db4bb2509fa581ea97a5b49e45bead7b24f0cdd57bd5586521521e783</cites><orcidid>0000-0002-1868-2113</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>MAHER, MICHAEL J.</creatorcontrib><title>Defeasible Reasoning via Datalog</title><title>Theory and practice of logic programming</title><description>We address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic
DL
(∂
||
), but the techniques we use apply to many other defeasible logics. Structural properties of
DL
(∂
||
) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog¬ implementations.</description><subject>Approximation</subject><subject>Logic programming</subject><subject>Logic programs</subject><subject>Semantics</subject><issn>1471-0684</issn><issn>1475-3081</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNplkFtLAzEQhYMoWKs_wLcFn1dncs-jtN6gUKj6HJJNUrasuzVpBf-9W-ubMDAf5xxm4BByjXCLgOruFblCkJpTBACm1QmZjJKoGWg8_WWsD_45uShlA4CSUT4h1Tym6Erru1itRhj6tl9XX62r5m7numF9Sc6S60q8-ttT8v748DZ7rhfLp5fZ_aJuEDWvpWioMckEz72nAkxyQmN0RjnhuYlc-OiC8pQnaEIQygchtBQUx4lKsym5Od7d5uFzH8vOboZ97seXlmpDmVSM8zGFx1STh1JyTHab2w-Xvy2CPRRh_xXBfgD1G02s</recordid><startdate>202309</startdate><enddate>202309</enddate><creator>MAHER, MICHAEL J.</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-1868-2113</orcidid></search><sort><creationdate>202309</creationdate><title>Defeasible Reasoning via Datalog</title><author>MAHER, MICHAEL J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1184-65c299f9db4bb2509fa581ea97a5b49e45bead7b24f0cdd57bd5586521521e783</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Approximation</topic><topic>Logic programming</topic><topic>Logic programs</topic><topic>Semantics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>MAHER, MICHAEL J.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Theory and practice of logic programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>MAHER, MICHAEL J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Defeasible Reasoning via Datalog</atitle><jtitle>Theory and practice of logic programming</jtitle><date>2023-09</date><risdate>2023</risdate><volume>23</volume><issue>5</issue><spage>986</spage><epage>1028</epage><pages>986-1028</pages><issn>1471-0684</issn><eissn>1475-3081</eissn><abstract>We address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic
DL
(∂
||
), but the techniques we use apply to many other defeasible logics. Structural properties of
DL
(∂
||
) are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog¬ implementations.</abstract><cop>Cambridge</cop><pub>Cambridge University Press</pub><doi>10.1017/S1471068421000387</doi><tpages>43</tpages><orcidid>https://orcid.org/0000-0002-1868-2113</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1471-0684 |
| ispartof | Theory and practice of logic programming, 2023-09, Vol.23 (5), p.986-1028 |
| issn | 1471-0684 1475-3081 |
| language | eng |
| recordid | cdi_proquest_journals_2892367344 |
| source | Cambridge University Press Journals Complete |
| subjects | Approximation Logic programming Logic programs Semantics |
| title | Defeasible Reasoning via Datalog |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T19%3A49%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Defeasible%20Reasoning%20via%20Datalog&rft.jtitle=Theory%20and%20practice%20of%20logic%20programming&rft.au=MAHER,%20MICHAEL%20J.&rft.date=2023-09&rft.volume=23&rft.issue=5&rft.spage=986&rft.epage=1028&rft.pages=986-1028&rft.issn=1471-0684&rft.eissn=1475-3081&rft_id=info:doi/10.1017/S1471068421000387&rft_dat=%3Cproquest_cross%3E2892367344%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2892367344&rft_id=info:pmid/&rfr_iscdi=true |