Ground Nonmonotonic Modal Logic S5: New Results
We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we als...
Gespeichert in:
Veröffentlicht in: | Journal of logic and computation 2005-10, Vol.15 (5), p.787-813 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 813 |
---|---|
container_issue | 5 |
container_start_page | 787 |
container_title | Journal of logic and computation |
container_volume | 15 |
creator | Galindo, Mauricio Osorio Pérez, Juan Antonio Navarro Ramírez, José R. Arrazola Macías, Verónica Borja |
description | We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known FOUR bilattice. We will call this semantic GNM-S5 as a reminder of its origin in the logic S5. Finally we show that, for normal programs, our approach is closely related to theWell-Founded-by-Cases Semantics introduced by Schlipf and the WFS+ proposed by Dix. We prove that GNM-S5 has the properties of classicality and extended cut. While WFS+ also supports classicality it fails to satisfy the extended cut principle, an important property available in other semantics such as stable models. Hence, we claim that GNM-S5 is a good candidate for defining a nonmonotonic semantics closer to the direction of classical logic. |
doi_str_mv | 10.1093/logcom/exi042 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_219240801</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>954627831</sourcerecordid><originalsourceid>FETCH-LOGICAL-c232t-da3e3be643485161474b050eafc67a324f259c1bd7afb1ff3c9e451eccb8402b3</originalsourceid><addsrcrecordid>eNpFkEtLw0AYRQdRsFaX7oP72G9eebjTYhshVqgKwc0wmcyU1DRTZxKs_95IRFf3Lg73wkHoEsM1hpTOGrtRdjfThxoYOUITzCIe0ogWx2gCKedhnJLiFJ15vwUAEmE2QbOls31bBSvb7mxrO9vWKni0lWyC3G6G_sxvgpX-DNba903nz9GJkY3XF785Ra-L-5d5FuZPy4f5bR4qQkkXVpJqWuqIUZZwPDzFrAQOWhoVxZISZghPFS6rWJoSG0NVqhnHWqkyYUBKOkVX4-7e2Y9e-05sbe_a4VIQnBIGCeABCkdIOeu900bsXb2T7ktgED9KxKhEjEr--dp3-vAHS_cuopjGXGTFm1jQdXG3yIjI6DfbCGSZ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219240801</pqid></control><display><type>article</type><title>Ground Nonmonotonic Modal Logic S5: New Results</title><source>Oxford University Press Journals All Titles (1996-Current)</source><creator>Galindo, Mauricio Osorio ; Pérez, Juan Antonio Navarro ; Ramírez, José R. Arrazola ; Macías, Verónica Borja</creator><creatorcontrib>Galindo, Mauricio Osorio ; Pérez, Juan Antonio Navarro ; Ramírez, José R. Arrazola ; Macías, Verónica Borja</creatorcontrib><description>We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known FOUR bilattice. We will call this semantic GNM-S5 as a reminder of its origin in the logic S5. Finally we show that, for normal programs, our approach is closely related to theWell-Founded-by-Cases Semantics introduced by Schlipf and the WFS+ proposed by Dix. We prove that GNM-S5 has the properties of classicality and extended cut. While WFS+ also supports classicality it fails to satisfy the extended cut principle, an important property available in other semantics such as stable models. Hence, we claim that GNM-S5 is a good candidate for defining a nonmonotonic semantics closer to the direction of classical logic.</description><identifier>ISSN: 0955-792X</identifier><identifier>EISSN: 1465-363X</identifier><identifier>DOI: 10.1093/logcom/exi042</identifier><identifier>CODEN: JLCOEU</identifier><language>eng</language><publisher>Oxford: Oxford University Press</publisher><subject>logic programming ; Modal logic S5 ; nonmonotonic reasoning ; semantics of programming ; FOUR bilattice</subject><ispartof>Journal of logic and computation, 2005-10, Vol.15 (5), p.787-813</ispartof><rights>Copyright Oxford University Press(England) Oct 2005</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c232t-da3e3be643485161474b050eafc67a324f259c1bd7afb1ff3c9e451eccb8402b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Galindo, Mauricio Osorio</creatorcontrib><creatorcontrib>Pérez, Juan Antonio Navarro</creatorcontrib><creatorcontrib>Ramírez, José R. Arrazola</creatorcontrib><creatorcontrib>Macías, Verónica Borja</creatorcontrib><title>Ground Nonmonotonic Modal Logic S5: New Results</title><title>Journal of logic and computation</title><addtitle>J Logic Computation</addtitle><description>We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known FOUR bilattice. We will call this semantic GNM-S5 as a reminder of its origin in the logic S5. Finally we show that, for normal programs, our approach is closely related to theWell-Founded-by-Cases Semantics introduced by Schlipf and the WFS+ proposed by Dix. We prove that GNM-S5 has the properties of classicality and extended cut. While WFS+ also supports classicality it fails to satisfy the extended cut principle, an important property available in other semantics such as stable models. Hence, we claim that GNM-S5 is a good candidate for defining a nonmonotonic semantics closer to the direction of classical logic.</description><subject>logic programming</subject><subject>Modal logic S5</subject><subject>nonmonotonic reasoning</subject><subject>semantics of programming</subject><subject>FOUR bilattice</subject><issn>0955-792X</issn><issn>1465-363X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNpFkEtLw0AYRQdRsFaX7oP72G9eebjTYhshVqgKwc0wmcyU1DRTZxKs_95IRFf3Lg73wkHoEsM1hpTOGrtRdjfThxoYOUITzCIe0ogWx2gCKedhnJLiFJ15vwUAEmE2QbOls31bBSvb7mxrO9vWKni0lWyC3G6G_sxvgpX-DNba903nz9GJkY3XF785Ra-L-5d5FuZPy4f5bR4qQkkXVpJqWuqIUZZwPDzFrAQOWhoVxZISZghPFS6rWJoSG0NVqhnHWqkyYUBKOkVX4-7e2Y9e-05sbe_a4VIQnBIGCeABCkdIOeu900bsXb2T7ktgED9KxKhEjEr--dp3-vAHS_cuopjGXGTFm1jQdXG3yIjI6DfbCGSZ</recordid><startdate>200510</startdate><enddate>200510</enddate><creator>Galindo, Mauricio Osorio</creator><creator>Pérez, Juan Antonio Navarro</creator><creator>Ramírez, José R. Arrazola</creator><creator>Macías, Verónica Borja</creator><general>Oxford University Press</general><general>Oxford Publishing Limited (England)</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200510</creationdate><title>Ground Nonmonotonic Modal Logic S5: New Results</title><author>Galindo, Mauricio Osorio ; Pérez, Juan Antonio Navarro ; Ramírez, José R. Arrazola ; Macías, Verónica Borja</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c232t-da3e3be643485161474b050eafc67a324f259c1bd7afb1ff3c9e451eccb8402b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>logic programming</topic><topic>Modal logic S5</topic><topic>nonmonotonic reasoning</topic><topic>semantics of programming</topic><topic>FOUR bilattice</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Galindo, Mauricio Osorio</creatorcontrib><creatorcontrib>Pérez, Juan Antonio Navarro</creatorcontrib><creatorcontrib>Ramírez, José R. Arrazola</creatorcontrib><creatorcontrib>Macías, Verónica Borja</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of logic and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Galindo, Mauricio Osorio</au><au>Pérez, Juan Antonio Navarro</au><au>Ramírez, José R. Arrazola</au><au>Macías, Verónica Borja</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Ground Nonmonotonic Modal Logic S5: New Results</atitle><jtitle>Journal of logic and computation</jtitle><addtitle>J Logic Computation</addtitle><date>2005-10</date><risdate>2005</risdate><volume>15</volume><issue>5</issue><spage>787</spage><epage>813</epage><pages>787-813</pages><issn>0955-792X</issn><eissn>1465-363X</eissn><coden>JLCOEU</coden><abstract>We study logic programs under Gelfond's translation in the context of modal logic S5. We show that for arbitrary logic programs (propositional theories where logic negation is associated with default negation) ground nonmonotonic modal logics between T and S5 are equivalent. Furthermore, we also show that these logics are equivalent to a nonmonotonic logic that we construct using the well known FOUR bilattice. We will call this semantic GNM-S5 as a reminder of its origin in the logic S5. Finally we show that, for normal programs, our approach is closely related to theWell-Founded-by-Cases Semantics introduced by Schlipf and the WFS+ proposed by Dix. We prove that GNM-S5 has the properties of classicality and extended cut. While WFS+ also supports classicality it fails to satisfy the extended cut principle, an important property available in other semantics such as stable models. Hence, we claim that GNM-S5 is a good candidate for defining a nonmonotonic semantics closer to the direction of classical logic.</abstract><cop>Oxford</cop><pub>Oxford University Press</pub><doi>10.1093/logcom/exi042</doi><tpages>27</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0955-792X |
ispartof | Journal of logic and computation, 2005-10, Vol.15 (5), p.787-813 |
issn | 0955-792X 1465-363X |
language | eng |
recordid | cdi_proquest_journals_219240801 |
source | Oxford University Press Journals All Titles (1996-Current) |
subjects | logic programming Modal logic S5 nonmonotonic reasoning semantics of programming FOUR bilattice |
title | Ground Nonmonotonic Modal Logic S5: New Results |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T14%3A08%3A31IST&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=Ground%20Nonmonotonic%20Modal%20Logic%20S5:%20New%20Results&rft.jtitle=Journal%20of%20logic%20and%20computation&rft.au=Galindo,%20Mauricio%20Osorio&rft.date=2005-10&rft.volume=15&rft.issue=5&rft.spage=787&rft.epage=813&rft.pages=787-813&rft.issn=0955-792X&rft.eissn=1465-363X&rft.coden=JLCOEU&rft_id=info:doi/10.1093/logcom/exi042&rft_dat=%3Cproquest_cross%3E954627831%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=219240801&rft_id=info:pmid/&rfr_iscdi=true |