Conventional static knowledge graphs model entities in relational data as nodes, connected by edges of specific relation types. However, information and knowledge evolve continuously, and temporal dynamics emerge, which are expected to influence future situations. In temporal knowledge graphs, time information is integrated into the graph by equipping each edge with a timestamp or a time range. Embedding-based methods have been introduced for link prediction on temporal knowledge graphs, but they mostly lack explainability and comprehensible reasoning chains. Particularly, they are usually not designed to deal with link forecasting -- event prediction involving future timestamps. We address the task of link forecasting on temporal knowledge graphs and introduce TLogic, an explainable framework that is based on temporal logical rules extracted via temporal random walks. We compare TLogic with state-of-the-art baselines on three benchmark datasets and show better overall performance while our method also provides explanations that preserve time consistency. Furthermore, in contrast to most state-of-the-art embedding-based methods, TLogic works well in the inductive setting where already learned rules are transferred to related datasets with a common vocabulary.
Interpretable and Explainable Logical Policies via Neurally Guided Symbolic Abstraction
Technical University of Darmstadt（达姆施塔特工业大学）；National Research Center for Applied Cybersecurity（国家应用网络安全研究中心）；Eindhoven University of Technology（埃因霍温理工大学）；Hessian Center for AI (hessian.AI)（黑森人工智能中心）；German Research Center for AI (DFKI)（德国人工智能研究中心）
EURECOM（EURECOM通信系统研究所）；Arizona State University（亚利桑那州立大学）
One challenge in fact checking is the ability to improve the transparency of the decision. We present a fact checking method that uses reference information in knowledge graphs (KGs) to assess claims and explain its decisions. KGs contain a formal representation of knowledge with semantic descriptions of entities and their relationships. We exploit such rich semantics to produce interpretable explanations for the fact checking output. As information in a KG is inevitably incomplete, we rely on logical rule discovery and on Web text mining to gather the evidence to assess a given claim. Uncerta…
University of Science and Technology of China（中国科学技术大学）；Singapore Management University（新加坡管理大学）
Knowledge Graphs (KGs) are becoming increasingly essential infrastructures in many applications while suffering from incompleteness issues. The KG completion task (KGC) automatically predicts missing facts based on an incomplete KG. However, existing methods perform unsatisfactorily in real-world scenarios. On the one hand, their performance will dramatically degrade along with the increasing sparsity of KGs. On the other hand, the inference procedure for prediction is an untrustworthy black box. This paper proposes a novel explainable model for sparse KGC, compositing high-order reasoning int…
University of Tennessee Health Science Center（田纳西大学健康科学中心）；University of Tennessee（田纳西大学）；Ochsner Clinic Foundation（奥克斯纳诊所基金会）
This study sought to (1) expand our existing Urban Population Health Observatory (UPHO) system by incorporating a semantics layer; (2) cohesively employ machine learning and semantic/logical inference to provide measurable evidence and detect pathways leading to undesirable health outcomes; (3) provide clinical use case scenarios and design case studies to identify socioenvironmental determinants of health associated with the prevalence of obesity, and (4) design a dashboard that demonstrates the use of UPHO in the context of obesity surveillance using the provided scenarios. The system design…
XXAI: Towards eXplicitly eXplainable Artificial Intelligence
Institute of Cell Biophysics of the Russian Academy of Sciences（俄罗斯科学院细胞生物物理研究所）；Institute of Theoretical and Experimental Biophysics of the Russian Academy of Sciences（俄罗斯科学院理论与实验生物物理研究所）
SymDiag: Explainable Diagnosis for LLM Reasoning via Neuro-Symbolic Verification
Beijing Institute of Technology（北京理工大学）；Zhongguancun Academy（中关村学院）；Xinjiang Future Enterprise Incubator Co., Ltd.（新疆未来企业孵化器有限公司）；Institute of Automation, Chinese Academy of Sciences（中国科学院自动化研究所）
ExAI5G: A Logic-Based Explainable AI Framework for Intrusion Detection in 5G Networks
organization= Faculty of Information Technology；Electrical Engineering, University of Oulu , addressline= , city= Oulu , postcode= 90570 , state= , country= Finland
CETINIA Universidad Rey Juan Carlos（胡安卡洛斯国王大学CETINIA）；IMDEA Software Institute（IMDEA软件研究所）；Universidad Politécnica de Madrid（马德里理工大学）；University of Texas at Dallas（德克萨斯大学达拉斯分校）
Automated commonsense reasoning is essential for building human-like AI systems featuring, for example, explainable AI. Event Calculus (EC) is a family of formalisms that model commonsense reasoning with a sound, logical basis. Previous attempts to mechanize reasoning using EC faced difficulties in the treatment of the continuous change in dense domains (e.g., time and other physical quantities), constraints among variables, default negation, and the uniform application of different inference methods, among others. We propose the use of s(CASP), a query-driven, top-down execution model for Pre…
UCL Centre for Artificial Intelligence, University College London（伦敦大学学院人工智能中心）；Facebook AI Research（Facebook 人工智能研究院）
Attempts to render deep learning models interpretable, data-efficient, and robust have seen some success through hybridisation with rule-based systems, for example, in Neural Theorem Provers (NTPs). These neuro-symbolic models can induce interpretable rules and learn representations from data via back-propagation, while providing logical explanations for their predictions. However, they are restricted by their computational complexity, as they need to consider all possible proof paths for explaining a goal, thus rendering them unfit for large-scale applications. We present Conditional Theorem …
Peking University（北京大学）；School of Software and Microelectronics, Peking University（北京大学软件与微电子学院）；Wangxuan Institute of Computer Technology, Peking University（北京大学王选计算机研究所）
Document-level relation extraction has attracted much attention in recent years. It is usually formulated as a classification problem that predicts relations for all entity pairs in the document. However, previous works indiscriminately represent intra- and inter-sentential relations in the same way, confounding the different patterns for predicting them. Besides, they create a document graph and use paths between entities on the graph as clues for logical reasoning. However, not all entity pairs can be connected with a path and have the correct logical reasoning paths in their graph. Thus man…
Green Center for Systems Biology, University of Texas Southwestern Medical Center（德克萨斯大学西南医学中心格林系统生物学中心）；Department of Bioinformatics, University of Texas Southwestern Medical Center（德克萨斯大学西南医学中心生物信息学系）；Department of Biophysics, University of Texas Southwestern Medical Center（德克萨斯大学西南医学中心生物物理学系）；Department of Biomedical Engineering, Johns Hopkins University（约翰斯·霍普金斯大学生物医学工程系）
Human reasoning can distill principles from observed patterns and generalize them to explain and solve novel problems. The most powerful artificial intelligence systems lack explainability and symbolic reasoning ability, and have therefore not achieved supremacy in domains requiring human understanding, such as science or common sense reasoning. Here we introduce deep distilling, a machine learning method that learns patterns from data using explainable deep learning and then condenses it into concise, executable computer code. The code, which can contain loops, nested logical statements, and …
Texas A&M University（德克萨斯农工大学）；University of Florida（佛罗里达大学）
In this paper, we study the problem of learning probabilistic logical rules for inductive and interpretable link prediction. Despite the importance of inductive link prediction, most previous works focused on transductive link prediction and cannot manage previously unseen entities. Moreover, they are black-box models that are not easily explainable for humans. We propose DRUM, a scalable and differentiable approach for mining first-order logical rules from knowledge graphs which resolves these problems. We motivate our method by making a connection between learning confidence scores for each …
MedReason: Eliciting Factual Medical Reasoning Steps in LLMs via Knowledge Graphs
UC Santa Cruz（加州大学圣克鲁兹分校）；University of British Columbia（不列颠哥伦比亚大学）；Nanyang Technological University（南洋理工大学）；Stanford University（斯坦福大学）；Weill Cornell Medicine（威尔康奈尔医学院）；NYU Langone Health（纽约大学兰贡医学中心）；Chungnam National University Sejong Hospital（忠南大学世宗医院）；Vector Institute（矢量研究院）；Pusan National University Hospital（釜山国立大学医院）；Massachusetts General Hospital（麻省总医院）
Knowledge extraction is used to convert neural networks into symbolic descriptions with the objective of producing more comprehensible learning models. The central challenge is to find an explanation which is more comprehensible than the original model while still representing that model faithfully. The distributed nature of deep networks has led many to believe that the hidden features of a neural network cannot be explained by logical descriptions simple enough to be comprehensible. In this paper, we propose a novel layerwise knowledge extraction method using M-of-N rules which seeks to obta…
