中文
相关论文

相关论文: The method "Model Elimination" of D.W.Loveland exp…

200 篇论文

We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

计算机科学中的逻辑 · 计算机科学 2007-05-23 Paolo Coppola , Simone Martini

The difficulties of automatic extraction of definitions and methods from scientific documents lie in two aspects: (1) the complexity and diversity of natural language texts, which requests an analysis method to support the discovery of…

计算与语言 · 计算机科学 2023-07-06 Yutian Sun , Hai Zhuge

Large language models (LLMs) have achieved remarkable success across natural language processing tasks, yet their widespread deployment raises pressing concerns around privacy, copyright, security, and bias. Machine unlearning has emerged…

计算与语言 · 计算机科学 2026-01-21 Tyler Lizzo , Larry Heck

Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for $A$ and for free modules over $A$, an elimination theory…

环与代数 · 数学 2019-01-15 Huishi Li

In Explainable AI, rule extraction translates model knowledge into logical rules, such as IF-THEN statements, crucial for understanding patterns learned by black-box models. This could significantly aid in fields like disease diagnosis,…

机器学习 · 计算机科学 2024-08-16 Yu Chen , Tianyu Cui , Alexander Capstick , Nan Fletcher-Loyd , Payam Barnaghi

Despite the many advances of Large Language Models (LLMs) and their unprecedented rapid evolution, their impact and integration into every facet of our daily lives is limited due to various reasons. One critical factor hindering their…

计算与语言 · 计算机科学 2024-08-20 Yakir Yehuda , Itzik Malkiel , Oren Barkan , Jonathan Weill , Royi Ronen , Noam Koenigstein

We show that any dimer model can be made cancellative without changing the characteristic polygon.

代数几何 · 数学 2013-01-24 Charlie Beil , Akira Ishii , Kazushi Ueda

Deep neural networks are powerful statistical learners. However, their predictions do not come with an explanation of their process. To analyze these models, explanation methods are being developed. We present a novel explanation method,…

计算与语言 · 计算机科学 2021-01-29 David Harbecke

The objective of this paper is to assess the quality of explanation heatmaps for image classification tasks. To assess the quality of explainability methods, we approach the task through the lens of accuracy and stability. In this work, we…

计算机视觉与模式识别 · 计算机科学 2025-09-15 Lassi Raatikainen , Esa Rahtu

As their size increases, Large Languages Models (LLMs) are natural candidates for network pruning methods: approaches that drop a subset of network weights while striving to preserve performance. Existing methods, however, require either…

计算与语言 · 计算机科学 2024-05-07 Mingjie Sun , Zhuang Liu , Anna Bair , J. Zico Kolter

Adequacy for estimation between an inferential method and a model can be de{\ldots}ned through two main requirements: {\ldots}rstly the inferential tool should de{\ldots}ne a well posed problem when applied to the model; secondly the…

统计理论 · 数学 2025-07-30 Michel Broniatowski , Justin Moutsouka

Existing large language models (LLMs) are known for generating "hallucinated" content, namely a fabricated text of plausibly looking, yet unfounded, facts. To identify when these hallucination scenarios occur, we examine the properties of…

计算与语言 · 计算机科学 2023-09-06 Mohamed Akrout

We take inspiration from the study of human explanation to inform the design and evaluation of interpretability methods in machine learning. First, we survey the literature on human explanation in philosophy, cognitive science, and the…

人工智能 · 计算机科学 2021-09-21 David Alvarez-Melis , Harmanpreet Kaur , Hal Daumé , Hanna Wallach , Jennifer Wortman Vaughan

This paper provides a method for improving tensor-based compositional distributional models of meaning by the addition of an explicit disambiguation step prior to composition. In contrast with previous research where this hypothesis has…

计算与语言 · 计算机科学 2014-08-28 Dimitri Kartsaklis , Nal Kalchbrenner , Mehrnoosh Sadrzadeh

This paper presents a proof-theoretic analysis of the modal $\mu$-calculus. More precisely, we prove a syntactic cut-elimination for the non-wellfounded modal $\mu$-calculus, using methods from linear logic and its exponential modalities.…

计算机科学中的逻辑 · 计算机科学 2025-06-12 Esaïe Bauer , Alexis Saurin

Machine learning is used more and more often for sensitive applications, sometimes replacing humans in critical decision-making processes. As such, interpretability of these algorithms is a pressing need. One popular algorithm to provide…

机器学习 · 计算机科学 2020-01-14 Damien Garreau , Ulrike von Luxburg

The application of machine learning based decision making systems in safety critical areas requires reliable high certainty predictions. Reject options are a common way of ensuring a sufficiently high certainty of predictions made by the…

人工智能 · 计算机科学 2022-05-17 André Artelt , Roel Visser , Barbara Hammer

We construct a model of the comprehension schema in the logic LP=>.

逻辑 · 数学 2013-09-13 Nick Thomas

The relevance of machine learning (ML) in our daily lives is closely intertwined with its explainability. Explainability can allow end-users to have a transparent and humane reckoning of a ML scheme's capability and utility. It will also…

机器学习 · 计算机科学 2022-12-27 Payel Sadhukhan , Sarbani palit , Kausik Sengupta

This paper presents a method to analyze the inference patterns used by Large Language Models (LLMs) for judgment in a case study on legal LLMs, so as to identify potential incorrect representations of the LLM, according to human domain…

人工智能 · 计算机科学 2025-05-21 Lu Chen , Yuxuan Huang , Yixing Li , Dongrui Liu , Qihan Ren , Shuai Zhao , Kun Kuang , Zilong Zheng , Quanshi Zhang