{"title":"Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics","authors":"A. Avron, B. Konikowska, A. Zamansky","doi":"10.1109/LICS.2012.20","DOIUrl":null,"url":null,"abstract":"This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"5 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 27th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2012.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28
Abstract
This paper makes a substantial step towards automatization of Para consistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of Para consistent logics known as Logics of Formal (In)consistency. The method relies on the use of non-deterministic semantics for these logics.