Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox data). In this paper we look particularly at the case where both a set of positive and a set of negative instances are given, and complex class expressions are sought under which the positive but not the negative examples fall. Concept induction has found applications in ontology engineering, but existing algorithms have fundamental performance issues in some scenarios, mainly because a high number of invokations of an external Description Logic reasoner is usually required. In this paper we present a new algorithm for this problem which drastically reduces the number of reasoner invokations needed. While this comes at the expense of a more limited traversal of the search space, we show that our approach improves execution times by up to several orders of magnitude, while output correctness, measured in the amount of correct coverage of the input instances, remains reasonably high in many cases. Our approach thus should provide a strong alternative to existing systems, in particular in settings where other systems are prohibitively slow.
Lifting Traces to Logic: Programmatic Skill Induction with Neuro-Symbolic Learning for Long-Horizon Agentic Tasks
State Key Laboratory of Novel Software Technology, Nanjing University, China(新型软件技术国家重点实验室,南京大学);School of Artificial Intelligence, Nanjing University, China(人工智能学院,南京大学);School of Intelligence Science and Technology, Nanjing University, China(智能科学与技术学院,南京大学);Centre for Frontier AI Research(前沿人工智能研究中心);Institute of High Performance Computing, Agency for Science, Technology and Research, Singapore(高性能计算研究所,新加坡科技研究局);Department of Computer Science and Engineering, Hong Kong University of Science and Technology, China(香港科学与技术大学计算机科学与工程系)
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
Università degli Studi di Bari(巴里大学)
在本体之上构建规则是语义Web逻辑层的最终目标。为此,目前正在讨论一种用于这一层的特别标记语言。它的目的是遵循传统的混合知识表示和推理系统,如$\mathcal{AL}$ -日志,集成了描述逻辑$\mathcal{ALC}$和无函数霍恩子句语言\textsc{Datalog}。在本文中,我们考虑的问题,这些规则的语义Web的自动化收购。我们提出了一个通用的规则归纳框架,采用归纳逻辑程序设计的方法装置,并依赖于$\mathcal{AL}$ -log的表达和演绎能力。无论归纳的范围(描述与预测)如何,该框架都是有效的。然而,为了说明的目的,我们还讨论了一个实例化的框架,其目的是描述和原来是有用的本体精化。关键词:归纳逻辑程序设计,混合知识表示和推理系统,本体,语义网。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
Inductive Learning for Possibilistic Logic Programs Under Stable Models
Multi-dimensional data perception and intelligent recognition Chongqing Engineering Research Center, Chongqing University of Arts and Sciences, Chongqing, 402160, China(重庆艺术科技大学智能识别多维数据感知工程研究中心);College of Computer Science and Technology, Guizhou University, Guiyang, 550025, China(贵州大学计算机科学与技术学院);State Key Laboratory of Public Big Data(公共大数据国家重点实验室);Key Laboratory of Advanced Medical Imaging(先进医学影像重点实验室);Institute for Artificial Intelligence, Guizhou University, Guiyang, 550025, China(贵州大学人工智能研究所);School of Information and Communication Technology, Griffith University, QLD 4111, Australia(格里菲斯大学信息与通信技术学院)
Automation of Mathematical Induction as part of the History of Logic
The University of Texas at Austin(德克萨斯大学奥斯汀分校);Hochschule Harz(哈尔茨应用技术大学);German Research Center for Artificial Intelligence (DFKI GmbH)(德国人工智能研究中心);Jacobs University Bremen(不来梅雅各布大学);Universität des Saarlandes(萨尔大学);DFKI Bremen GmbH(德国人工智能研究中心不来梅有限公司);University of Edinburgh(爱丁堡大学);Vienna University of Technology(维也纳工业大学)
Playing ZendoWorld: Challenging AI Agents on Active Visual Concept Induction
AIML Lab, TU Darmstadt(人工智能机器学习实验室,达姆施塔特工业大学);Hessian Center for AI (hessian.AI)(黑森州人工智能中心);Psychology of Information Processing, TU Darmstadt(信息处理心理学,达姆施塔特工业大学);Centre for Cognitive Science, TU Darmstadt(认知科学中心,达姆施塔特工业大学);Cornell University(康奈尔大学);Max Planck Institute for Informatics, SIC(马克斯·普朗克信息学研究所,SIC组);German Center for AI (DFKI)(德国人工智能研究中心)