Signed Systems for Paraconsistent Reasoning

We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of...

Full description

Saved in:
Bibliographic Details
Published in:Journal of automated reasoning 1998-04, Vol.20 (1-2), p.191-213
Main Authors: Besnard, Ph, Schaub, T
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c258t-baf69aa9c673086077c0665e257fa882f86d3dae3cf12dcb03482a715b60b5d23
cites
container_end_page 213
container_issue 1-2
container_start_page 191
container_title Journal of automated reasoning
container_volume 20
creator Besnard, Ph
Schaub, T
description We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations. Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.[PUBLICATION ABSTRACT]
doi_str_mv 10.1023/A:1005957026440
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_26742391</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2971367141</sourcerecordid><originalsourceid>FETCH-LOGICAL-c258t-baf69aa9c673086077c0665e257fa882f86d3dae3cf12dcb03482a715b60b5d23</originalsourceid><addsrcrecordid>eNpdkE1LxDAURYMoWEfXbguCG6m-5CUvqbthGD9gQHF0XdI0HTp0Em3ahf_egq5cXbgcDpfL2CWHWw4C75b3HECVSoMgKeGIZVxpLIA0HLMMOJlCS8RTdpbSHgCQQ5mxm223C77Jt99p9IeUt3HIX-1gXQypm6sw5m_ephi6sDtnJ63tk7_4ywX7eFi_r56Kzcvj82q5KZxQZixq21JpbelIIxgCrR0QKS-Ubq0xojXUYGM9upaLxtWA0giruaoJatUIXLDrX-_nEL8mn8bq0CXn-94GH6dUCdJSYMln8OofuI_TEOZtFUc1vyAlGfwByc9QmA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1356444468</pqid></control><display><type>article</type><title>Signed Systems for Paraconsistent Reasoning</title><source>Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List</source><creator>Besnard, Ph ; Schaub, T</creator><creatorcontrib>Besnard, Ph ; Schaub, T</creatorcontrib><description>We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations. Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.[PUBLICATION ABSTRACT]</description><identifier>ISSN: 0168-7433</identifier><identifier>EISSN: 1573-0670</identifier><identifier>DOI: 10.1023/A:1005957026440</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><ispartof>Journal of automated reasoning, 1998-04, Vol.20 (1-2), p.191-213</ispartof><rights>Kluwer Academic Publishers 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c258t-baf69aa9c673086077c0665e257fa882f86d3dae3cf12dcb03482a715b60b5d23</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Besnard, Ph</creatorcontrib><creatorcontrib>Schaub, T</creatorcontrib><title>Signed Systems for Paraconsistent Reasoning</title><title>Journal of automated reasoning</title><description>We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations. Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.[PUBLICATION ABSTRACT]</description><issn>0168-7433</issn><issn>1573-0670</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNpdkE1LxDAURYMoWEfXbguCG6m-5CUvqbthGD9gQHF0XdI0HTp0Em3ahf_egq5cXbgcDpfL2CWHWw4C75b3HECVSoMgKeGIZVxpLIA0HLMMOJlCS8RTdpbSHgCQQ5mxm223C77Jt99p9IeUt3HIX-1gXQypm6sw5m_ephi6sDtnJ63tk7_4ywX7eFi_r56Kzcvj82q5KZxQZixq21JpbelIIxgCrR0QKS-Ubq0xojXUYGM9upaLxtWA0giruaoJatUIXLDrX-_nEL8mn8bq0CXn-94GH6dUCdJSYMln8OofuI_TEOZtFUc1vyAlGfwByc9QmA</recordid><startdate>19980401</startdate><enddate>19980401</enddate><creator>Besnard, Ph</creator><creator>Schaub, T</creator><general>Springer Nature B.V</general><scope>7SC</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</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>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>19980401</creationdate><title>Signed Systems for Paraconsistent Reasoning</title><author>Besnard, Ph ; Schaub, T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c258t-baf69aa9c673086077c0665e257fa882f86d3dae3cf12dcb03482a715b60b5d23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Besnard, Ph</creatorcontrib><creatorcontrib>Schaub, T</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; 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>ProQuest Engineering 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><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; 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 China</collection><collection>Engineering Collection</collection><jtitle>Journal of automated reasoning</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Besnard, Ph</au><au>Schaub, T</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Signed Systems for Paraconsistent Reasoning</atitle><jtitle>Journal of automated reasoning</jtitle><date>1998-04-01</date><risdate>1998</risdate><volume>20</volume><issue>1-2</issue><spage>191</spage><epage>213</epage><pages>191-213</pages><issn>0168-7433</issn><eissn>1573-0670</eissn><abstract>We present a novel approach to paraconsistent reasoning, that is, to reasoning from inconsistent information. The basic idea is the following. We transform an inconsistent theory into a consistent one by renaming all literals occurring in the theory. Then, we restore some of the original contents of the theory by introducing progressively formal equivalences linking the original literals to their renamings. This is done as long as consistency is preserved. The restoration of the original contents of the theory is done by appeal to default logic. The overall approach provides us with a family of paraconsistent consequence relations. Our approach is semantical because it works at the level of the propositions; it deals with the semantical link between a proposition and its negation. The approach is therefore independent of the combination of the connectives that are actually applied to the propositions in order to form entire formulas.[PUBLICATION ABSTRACT]</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1023/A:1005957026440</doi><tpages>23</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0168-7433
ispartof Journal of automated reasoning, 1998-04, Vol.20 (1-2), p.191-213
issn 0168-7433
1573-0670
language eng
recordid cdi_proquest_miscellaneous_26742391
source Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List
title Signed Systems for Paraconsistent Reasoning
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T00%3A12%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Signed%20Systems%20for%20Paraconsistent%20Reasoning&rft.jtitle=Journal%20of%20automated%20reasoning&rft.au=Besnard,%20Ph&rft.date=1998-04-01&rft.volume=20&rft.issue=1-2&rft.spage=191&rft.epage=213&rft.pages=191-213&rft.issn=0168-7433&rft.eissn=1573-0670&rft_id=info:doi/10.1023/A:1005957026440&rft_dat=%3Cproquest%3E2971367141%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c258t-baf69aa9c673086077c0665e257fa882f86d3dae3cf12dcb03482a715b60b5d23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1356444468&rft_id=info:pmid/&rfr_iscdi=true