检索结果-内蒙古大学图书馆

The complexity of revising logic programs

JOURNAL OF LOGIC PROGRAMMING 1999年第2-3期40卷 273-298页

作者： Greiner, R Univ Alberta Dept Comp Sci Edmonton AB T6G 2H1 Canada

A rule-based program will return a set of answers to each query. An impure program, which includes the Prolog cut "!" and "not(.)" operators, can return different answers if its rules are re-ordered. There are also many reasoning systems that return only the first answer found for each query;these first answers, too, depend on the rule order, even in pure rule-based systems. A theory revision algorithm, seeking a revised rule-base whose expected accuracy, over the distribution of queries, is optimal, should therefore consider modifying the order of the rules. This paper first shows that a polynomial number of training "labeled queries" (each a query paired with its correct answer) provides the distribution information necessary to identify the optimal ordering. It then proves, however, that the task of determining which ordering is optimal, once given this distributional information, is intractable even in trivial situations;e.g., even if each query is an atomic literal, we are seeking only a "perfect" theory, and the rule base is propositional. We also prove that this task is not even approximable: Unless P = NP, no polynomial time algorithm can produce an ordering of an n-rule theory whose accuracy is within n(gamma) of optimal, for some gamma > 0. We next prove similar hardness and non-approximatability, results for the related tasks of determining, in these impure contexts, (1) the optimal ordering of the antecedents;(2) the optimal set of new rules to add and (3) the optimal set of existing rules to delete. (C) 1999 Elsevier Science Inc. All rights reserved.

关键词： theory revision inductive logic programming computational complexity and approximatability PAC-learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：