首页 > 最新文献

Journal of Logic Language and Information最新文献

英文 中文
Public Announcements, Public Lies and Recoveries. 公开公告,公开谎言和赔偿。
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2022-01-01 Epub Date: 2022-03-17 DOI: 10.1007/s10849-022-09351-4
Kai Li, Jan van Eijck

The paper gives a formal analysis of public lies, explains how public lying is related to public announcement, and describes the process of recoveries from false beliefs engendered by public lying. The framework treats two kinds of public lies: simple lying update and two-step lying, which consists of suggesting that the lie may be true followed by announcing the lie. It turns out that agents' convictions of what is true are immune to the first kind, but can be shattered by the second kind. Next, recovery from public lying is analyzed. Public lies that are accepted by an audience cannot be undone simply by announcing their negation. The paper proposes a recovery process that works well for restoring beliefs about facts but cannot be extended to beliefs about beliefs. The formal machinery of the paper consists of KD45 models and conditional neighbourhood models, with various update procedures on them. Completeness proofs for a number of reasoning systems (converse belief logic, public lies logic, lying and recovery logic, conditional neighbourhood logic, plus its dynamic version) are included.

本文对公众谎言进行了形式分析,解释了公众谎言与公众公告的关系,并描述了公众谎言产生的错误信念的恢复过程。该框架研究了两种公开的谎言:简单的谎言更新和两步谎言,两步谎言包括暗示谎言可能是真的,然后宣布谎言。事实证明,行动者对真实的信念不受第一种信念的影响,但可能被第二种信念所打破。接下来,分析从公开撒谎中恢复。公众所接受的谎言不能仅仅通过宣布否定就被撤销。本文提出了一个恢复过程,它可以很好地恢复关于事实的信念,但不能扩展到关于信念的信念。本文的形式机制由KD45模型和条件邻域模型组成,并对它们进行了各种更新程序。包括一些推理系统的完备性证明(逆信念逻辑、公开谎言逻辑、谎言与恢复逻辑、条件邻域逻辑及其动态版本)。
{"title":"Public Announcements, Public Lies and Recoveries.","authors":"Kai Li,&nbsp;Jan van Eijck","doi":"10.1007/s10849-022-09351-4","DOIUrl":"https://doi.org/10.1007/s10849-022-09351-4","url":null,"abstract":"<p><p>The paper gives a formal analysis of public lies, explains how public lying is related to public announcement, and describes the process of recoveries from false beliefs engendered by public lying. The framework treats two kinds of public lies: simple lying update and two-step lying, which consists of suggesting that the lie may be true followed by announcing the lie. It turns out that agents' convictions of what is true are immune to the first kind, but can be shattered by the second kind. Next, recovery from public lying is analyzed. Public lies that are accepted by an audience cannot be undone simply by announcing their negation. The paper proposes a recovery process that works well for restoring beliefs about facts but cannot be extended to beliefs about beliefs. The formal machinery of the paper consists of KD45 models and conditional neighbourhood models, with various update procedures on them. Completeness proofs for a number of reasoning systems (converse belief logic, public lies logic, lying and recovery logic, conditional neighbourhood logic, plus its dynamic version) are included.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"31 3","pages":"423-450"},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8929470/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40313175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
25th Workshop on Logic, Language, Information and Computation: WoLLIC 2018. 第25届逻辑、语言、信息与计算研讨会:WoLLIC 2018。
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2022-01-01 Epub Date: 2022-10-07 DOI: 10.1007/s10849-022-09387-6
Lawrence Moss, Ruy de Queiroz
{"title":"25th Workshop on Logic, Language, Information and Computation: WoLLIC 2018.","authors":"Lawrence Moss,&nbsp;Ruy de Queiroz","doi":"10.1007/s10849-022-09387-6","DOIUrl":"https://doi.org/10.1007/s10849-022-09387-6","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"31 4","pages":"525-527"},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9540042/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"33514834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Feferman–Vaught Decompositions for Prefix Classes of First Order Logic 一阶逻辑前缀类的Feferman–Vaught分解
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-12-30 DOI: 10.1007/s10849-022-09384-9
Abhisekh Sankaran
{"title":"Feferman–Vaught Decompositions for Prefix Classes of First Order Logic","authors":"Abhisekh Sankaran","doi":"10.1007/s10849-022-09384-9","DOIUrl":"https://doi.org/10.1007/s10849-022-09384-9","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"32 1","pages":"147 - 174"},"PeriodicalIF":0.8,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47161774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some Remarks on Semantics and Expressiveness of the Sentential Calculus with Identity 关于具有恒等的句子演算的语义和表达性的几点思考
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-12-05 DOI: 10.1007/s10849-023-09396-z
Steffen Lewitzka
{"title":"Some Remarks on Semantics and Expressiveness of the Sentential Calculus with Identity","authors":"Steffen Lewitzka","doi":"10.1007/s10849-023-09396-z","DOIUrl":"https://doi.org/10.1007/s10849-023-09396-z","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"32 1","pages":"441 - 471"},"PeriodicalIF":0.8,"publicationDate":"2021-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52372493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Negative Stripping in English: A Corpus-based Approach 基于语料库的英语否定剥离研究
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-11-30 DOI: 10.29403/li.25.3.2
geon-hwan Lee, Jong-Bok Kim
{"title":"Negative Stripping in English: A Corpus-based Approach","authors":"geon-hwan Lee, Jong-Bok Kim","doi":"10.29403/li.25.3.2","DOIUrl":"https://doi.org/10.29403/li.25.3.2","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"177 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76613307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Verification of Korean Pre-trained Models' Feasibility of Syntactic Research Using Pairwise Sentences 韩语预训练模型在成对句句法研究中的可行性验证
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-11-30 DOI: 10.29403/li.25.3.1
Kwonsik Park, S. Kim, Sanghoun Song
{"title":"Verification of Korean Pre-trained Models' Feasibility of Syntactic Research Using Pairwise Sentences","authors":"Kwonsik Park, S. Kim, Sanghoun Song","doi":"10.29403/li.25.3.1","DOIUrl":"https://doi.org/10.29403/li.25.3.1","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"9 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84526649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Nonmonotonic Reasoning, Expectations Orderings, and Conceptual Spaces 非单调推理、期望排序和概念空间
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-11-21 DOI: 10.1007/s10849-021-09347-6
Matías Osta-Vélez, P. Gärdenfors
{"title":"Nonmonotonic Reasoning, Expectations Orderings, and Conceptual Spaces","authors":"Matías Osta-Vélez, P. Gärdenfors","doi":"10.1007/s10849-021-09347-6","DOIUrl":"https://doi.org/10.1007/s10849-021-09347-6","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"31 1","pages":"77 - 97"},"PeriodicalIF":0.8,"publicationDate":"2021-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46563324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Book Review 书评
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-18 DOI: 10.1007/s10849-021-09346-7
Giosuè Baggio
{"title":"Book Review","authors":"Giosuè Baggio","doi":"10.1007/s10849-021-09346-7","DOIUrl":"https://doi.org/10.1007/s10849-021-09346-7","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"30 1","pages":"819 - 823"},"PeriodicalIF":0.8,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41323418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Relational Syllogisms with Numerical Quantifiers and Beyond 数量词及以后的关系三段论
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-13 DOI: 10.1007/s10849-021-09345-8
Ka-fat Chow
{"title":"Relational Syllogisms with Numerical Quantifiers and Beyond","authors":"Ka-fat Chow","doi":"10.1007/s10849-021-09345-8","DOIUrl":"https://doi.org/10.1007/s10849-021-09345-8","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"31 1","pages":"1 - 34"},"PeriodicalIF":0.8,"publicationDate":"2021-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41731494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Completeness for the Classical Antecedent Fragment of Inquisitive First-Order Logic 一阶逻辑经典前置片断的完备性
IF 0.8 3区 数学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-10-07 DOI: 10.1007/s10849-021-09341-y
Gianluca Grilletti
{"title":"Completeness for the Classical Antecedent Fragment of Inquisitive First-Order Logic","authors":"Gianluca Grilletti","doi":"10.1007/s10849-021-09341-y","DOIUrl":"https://doi.org/10.1007/s10849-021-09341-y","url":null,"abstract":"","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"30 1","pages":"725 - 751"},"PeriodicalIF":0.8,"publicationDate":"2021-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46886134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Journal of Logic Language and Information
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1