A Symbolic Approach to Reasoning with Linguistic Quantifiers
Institut de Recherche en Informatique de Toulouse(图卢兹计算机科学研究所);Institut d'Investigacio en Intelligencia Artificial(人工智能研究所);C.N.R.S.(法国国家科学研究中心);Universite Paul Sabatier(保尔·萨巴蒂埃大学);CEAB-CSIC(高级研究中心-西班牙国家研究委员会)
Didier Dubois, Henri Prade, Lluis Godo, Ramon Lopez de Mantaras
备注:
Appears in Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence (UAI1992)
This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions. Then instead of propagating numbers, qualitative terms are propagated in accordance with the numerical interpretation of these terms. The quantified syllogism, modelling the chaining of probabilistic rules, is studied in this context. It is shown that a qualitative counterpart of this syllogism makes sense, and is relatively independent of the threshold defining the linguistically meaningful intervals, provided that these threshold values remain in accordance with the intuition. The inference power is less than that of a full-fledged probabilistic con-quaint propagation device but better corresponds to what could be thought of as commonsense probabilistic reasoning.
Fuzzy quantification for linguistic data analysis and data mining
Centro Singular de Investigación en Tecnoloxías da Información (CiTIUS), Universidade de Santiago de Compostela(圣地亚哥-德孔波斯特拉大学信息技术 singular 研究中心(CiTIUS))
Symbolic Intermediaries as a Linguistic-Numerical Interface for LLM-Driven Geometric Reasoning
Idiap Research Institute(Idiap研究 institute);École Polytechnique Fédérale de Lausanne(瑞士联邦理工学院);Honda Research Institute Europe(本田欧洲研究院);Department of Computer Science, University of Manchester(曼彻斯特大学计算机科学系);National Biomarker Centre, CRUK-MI, University of Manchester(曼彻斯特大学国家生物标记中心)
PEIRCE: Unifying Material and Formal Reasoning via LLM-Driven Neuro-Symbolic Refinement
University of Manchester(曼彻斯特大学);Idiap Research Institute(伊迪亚普研究所);National Biomarker Centre, CRUK-MI, University of Manchester(英国癌症研究中心曼彻斯特研究所国家生物标志物中心,曼彻斯特大学);University of Galway(戈尔韦大学)
Personalized Decision Modeling: Utility Optimization or Textualized-Symbolic Reasoning
Department of Civil and Systems Engineering(土木与系统工程系);Johns Hopkins University(约翰霍普金斯大学);Department of Systems and Information Engineering(系统与信息工程系);University of Virginia(弗吉尼亚大学);Johns Hopkins Data Science and AI Institute(约翰霍普金斯大学数据科学与人工智能研究所)
视觉问答(VQA)的主要方法依赖于使用“黑盒”神经编码器对图像和问题进行编码,并将单个令牌解码为“是”或“否”等答案。尽管这种方法有很强的定量结果,但它很难为预测过程提出直观的、人类可读的证明形式。为了解决这个不足,我们重新制定VQA作为一个完整的答案生成任务,这需要模型来证明其预测在自然语言。我们提出了LRTA [看,读,想,答],一个透明的神经符号推理框架的视觉问答,解决问题的一步一步像人类一样,并提供人类可读的形式的理由在每一步。具体来说,LRTA学习首先将图像转换为场景图,并将问题解析为多个推理指令。然后,它通过使用递归神经符号执行模块遍历场景图来一次执行一个推理指令。最后,它生成一个完整的答案,给定的问题与自然语言的理由。我们在GQA数据集上的实验表明,LRTA的性能大大优于最先进的模型(43.1% vs. 28.0%)的完整答案生成任务。我们还通过删除问题中的语言线索(属性和关系)来创建扰动GQA测试集,以分析模型是否具有表面数据相关性的智能猜测。我们表明,LRTA向真正理解这个问题迈出了一步,而最先进的模型往往从训练数据中学习表面的相关性。