Paraconsistent Logic Programming in Three and Four-Valued Logics
From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emerg...
Uloženo v:
| Vydáno v: | The bulletin of symbolic logic Ročník 28; číslo 2; s. 260 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, USA
Cambridge University Press
01.06.2022
|
| Témata: | |
| ISSN: | 1079-8986, 1943-5894 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic. Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature. Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira. E-mail: kecso10@yahoo.com.br URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632 |
|---|---|
| AbstractList | From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic.
Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (
LFI
s), this thesis intends to resume the research of Rodrigues and place it in the specific context of
LFI
s with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [
Studia Logica
(2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the
ad hoc
approaches to this question found in the literature.
Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira.
E-mail
:
kecso10@yahoo.com.br
URL
:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632 From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic.Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature.Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira.E-mail: kecso10@yahoo.com.brURL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632 From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic. Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature. Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira. E-mail: kecso10@yahoo.com.br URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632 |
| Author | Oliveira, Kleidson Êglicio Carvalho da Silva |
| Author_xml | – sequence: 1 givenname: Kleidson Êglicio Carvalho da Silva surname: Oliveira fullname: Oliveira, Kleidson Êglicio Carvalho da Silva organization: University of Campinas, Brazil, 2017 |
| BookMark | eNpt0MtKAzEUBuAgFWyrK19gwKWk5ja57JRiVSjYRXUbcptxSiepSbvw7Z3SghtX5yw-_nP4J2AUUwwA3GI0wwiLB1u2M4IInlF2AcZYMQprqdho2JFQUCrJr8CklA1CmHFWj8HjymTjUixd2Ye4r5ap7Vy1yqnNpu-72FZdrNZfOYTKRF8t0iHDT7M9BH-i5RpcNmZbws15TsHH4nk9f4XL95e3-dMSOkwVg4RyzxUKNUcBeyoEYY4xaWXTuDpIZBQl1iuPQ-0ssUgI4XDtraDKIFRTOgV3p9xdTt-HUPZ6M_wSh5OacImJkJLyQd2flMuplBwavctdb_KPxkgfK9JDRfpYkaZs0PCsTW9z59vwF_qf_wX0KWiO |
| ContentType | Journal Article |
| Copyright | The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic |
| Copyright_xml | – notice: The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic |
| DBID | AAYXX CITATION 3V. 7XB 8FE 8FG 8FK 8G5 AABKS ABJCF ABSDQ ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ GUQSH HCIFZ L6V M2O M7S MBDVC PADUT PGAAH PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1017/bsl.2021.34 |
| DatabaseName | CrossRef ProQuest Central (Corporate) ProQuest Central (purchase pre-March 2016) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Research Library (Alumni) Philosophy Collection Materials Science & Engineering Collection Philosophy Database ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Technology collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Engineering Collection ProQuest - Research Library Engineering Database Research Library (Corporate) Research Library China ProQuest One Religion & Philosophy 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 Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef Research Library Prep ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Central China ProQuest One Religion & Philosophy Philosophy Collection ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Research Library China Engineering Collection Engineering Database ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Philosophy Database |
| DatabaseTitleList | CrossRef Research Library Prep |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Philosophy |
| EISSN | 1943-5894 |
| EndPage | 260 |
| ExternalDocumentID | 10_1017_bsl_2021_34 |
| GroupedDBID | -~X 09C 09E 0R~ 23N 2AX 3V. 5GY 6OB 8FE 8FG 8G5 AAAZR AABES AABKS AABWE AACJH AAEED AAGFV AAKTX AANRG AARAB AASVR AAUKB ABBHK ABFAN ABJCF ABJNI ABMYL ABQTM ABROB ABSDQ ABTAH ABUWG ABXAU ABXSQ ABYWD ABZCX ABZUI ACBMC ACCHT ACETC ACGFS ACIPV ACIWK ACMTB ACNCT ACQFJ ACTMH ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZWT ADACV ADDNB ADFEC ADGEJ ADKIL ADOCW ADODI ADOVH ADOVT ADULT ADVJH AEBAK AEBPU AEHGV AELPN AENCP AENEX AENGE AEUPB AEYYC AFDVO AFFTP AFFUJ AFKQG AFKRA AFLVW AFVYC AFXKK AGABE AGBYD AGJUD AGLWM AGOOT AGTJU AHQXX AHRGI AI. AIBGX AIGNW AIHIV AIOIP AJCYY AJPFC AJQAS AKZCZ ALMA_UNASSIGNED_HOLDINGS ANPLD APXXL AQJOH ARZZG AS~ ATUCA AUXHV AYIQA AZQEC BBLKV BCGOX BENPR BESQT BGLVJ BJBOZ BLZWO BMAJL BPHCQ BQFHP CBIIA CCPQU CCQAD CCUQV CFAFE CFBFF CGQII CHEAL CJCSC CS3 DOHLZ DQDLB DSRWC DU5 DWQXO EBS ECEWR EFSUC EGQIC EJD FEDTE FRP FXEWX GNUQQ GUQSH HCIFZ HGD HQ6 HVGLF HZ~ H~9 I.7 I.9 IH6 IOEEP IOO JAAYA JAC JBMMH JBZCM JENOY JHFFW JHPGK JKQEH JLEZI JLXEF JMS JPL JQKCU JSODD JST KAFGG KCGVB KFECR L6V LHUNA LW7 M2O M7S M7~ MVM NIKVX NZEOI O9- OK1 P2P PADUT PQQKQ PROAC PTHSS RBU RCA RNS ROL RPE S6U SA0 SAAAG T9M TN5 TR2 UT1 VH1 WFFJZ WHG ZCG ZDLDU ZJOSE ZMEZD ZY4 ZYDXJ AAFWJ AATMM AAWIL AAXMD AAYXX AAZSN ABAWQ ABGDZ ABVKB ABVZP ABXHF ACDLN ACHJO ACRPL ADMHG ADMLS ADNMO AEMFK AFFHD AFZFC AGLNM AGQPQ AIHAF AKMAY ALRMG CITATION IPSME PGAAH PHGZM PHGZT PQGLB RBR 7XB 8FK AECCQ MBDVC PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c1394-236d690e560e1d37724c448b8ffc5e80a932bd9d1e5cb2b0777c15db739a00533 |
| IEDL.DBID | BENPR |
| ISSN | 1079-8986 |
| IngestDate | Fri Jul 25 11:51:59 EDT 2025 Sat Nov 29 03:54:07 EST 2025 Wed Mar 13 05:53:59 EDT 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | 03B53 Logic programming Many-valued logics Paraconsistent logic |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1394-236d690e560e1d37724c448b8ffc5e80a932bd9d1e5cb2b0777c15db739a00533 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/68E09C93C424E931F3167EFE513E9723/S1079898621000342a.pdf/div-class-title-paraconsistent-logic-programming-in-three-and-four-valued-logics-div.pdf |
| PQID | 2681278836 |
| PQPubID | 2046291 |
| PageCount | 1 |
| ParticipantIDs | proquest_journals_2681278836 crossref_primary_10_1017_bsl_2021_34 cambridge_journals_10_1017_bsl_2021_34 |
| PublicationCentury | 2000 |
| PublicationDate | 20220600 2022-06-00 20220601 |
| PublicationDateYYYYMMDD | 2022-06-01 |
| PublicationDate_xml | – month: 06 year: 2022 text: 20220600 |
| PublicationDecade | 2020 |
| PublicationPlace | New York, USA |
| PublicationPlace_xml | – name: New York, USA – name: New York |
| PublicationTitle | The bulletin of symbolic logic |
| PublicationTitleAlternate | Bull. symb. log |
| PublicationYear | 2022 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| SSID | ssj0014645 |
| Score | 2.2495692 |
| Snippet | From the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 260 |
| SubjectTerms | Artificial intelligence Deduction Logic programming Mathematical logic Reasoning Semantics Thesis Abstracts |
| Title | Paraconsistent Logic Programming in Three and Four-Valued Logics |
| URI | https://www.cambridge.org/core/product/identifier/S1079898621000342/type/journal_article https://www.proquest.com/docview/2681278836 |
| Volume | 28 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1943-5894 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0014645 issn: 1079-8986 databaseCode: M7S dateStart: 20160301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1943-5894 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0014645 issn: 1079-8986 databaseCode: BENPR dateStart: 20160301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1943-5894 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0014645 issn: 1079-8986 databaseCode: M2O dateStart: 20160301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5s9aAHH1XxTQ7F22qzeZ980eKlNWiV3sK-CgVNa9MK_ntn8mgpiBcvOSTLEnZ2Hrsz830ATW4Et43wmXZRm1wvUEziOya4RG_vCXRKbk42EfR64WAQxeWFW1aWVVY2MTfUeqzojvyaE1AWntcc_2byyYg1irKrJYVGDdYJqcytw_p9uxc_L_IIlLcrqg4jFkahX3boEWi0zCjzwO0r4kxe4iqs-qdV85z7nM7Of_92F7bLaNO6K7bHHqyZtAFb3QVUa9aAzbgiM_jeh9uY4JupZhaFn84sYmJWVlzUcH2gl7NGqdVH8RtLpNrq4PzsTbzPjS6GZgfw2mn3Hx5ZybHAFMZ-LuOOr_GAbDDwMbZ2MNZ2FZ7YZDgcKs-ELYHxndSRto2nJJetIAiU7WkZOJHI-3gPoZ6OU3MElk_oeFL4ojUMXWEbQtJziHgCFVG1PO8YLhernJSakiVFlVmQoDgSEkfiuMfQrESQTArMjd-HnVVrv5xuufAnf38-hU1OnQz5hcoZ1GfTuTmHDfU1G2XTi3IfXUCty5_oGbz8AETe0K4 |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB58gXrwLT6q7kG9rTab90FU1KKopWAVb3FfBUHTaqrSP-VvdCZpWgTx5sFrsiwkMzuPnZnvA9gWVgrHyoAbD0-T54eaK3zGpVDo7X2JTsnLySbCej26v48bI_BZzsJQW2VpE3NDbdqa7sj3BQFlYb7mBoedF06sUVRdLSk0CrW4tL0PTNmyg4tTlO-OELWz5sk577MKcI3RjseFGxhMCS26eusYF6NLT2OOoqJWS_s2qkqMaJSJjWN9rYSqhmGoHd-o0I1lPrmK-47CuEfWP28VvBlULahKWPQ4xjyKo6A_D0gQ1SqjOodw9oiheYji8N0bfncGuYerzf63fzMHM_1Ymh0Xyj8PIzZdgOnrARBttgBTjZKqobcIRw0Cp6aOYFTttMuIZ1qzRtGh9ow-nD2mrInKbZlMDavh_vxOPr1ZUyzNluD2T75nGcbSdmpXgAWE_adkIKutyJOOJZxAl2g10Mzoqu-vwu5AqknfDmRJ0UMXJij-hMSfuN4qbJciTzoFosjPyyqlrIfbDQW99vvrLZg8b15fJVcX9ct1mBI0s5FfHVVgrPv6ZjdgQr93H7PXzVyDGTz8tVp8ATLrKEM |
| 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=Paraconsistent+Logic+Programming+in+Three+and+Four-Valued+Logics&rft.jtitle=The+bulletin+of+symbolic+logic&rft.au=Oliveira%2C+Kleidson+%C3%8Aglicio+Carvalho+da+Silva&rft.date=2022-06-01&rft.pub=Cambridge+University+Press&rft.issn=1079-8986&rft.eissn=1943-5894&rft.volume=28&rft.issue=2&rft.spage=260&rft.epage=260&rft_id=info:doi/10.1017%2Fbsl.2021.34&rft.externalDocID=10_1017_bsl_2021_34 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1079-8986&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1079-8986&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1079-8986&client=summon |