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

A logic programming SYSTEM FOR NONMONOTONIC REASONING

JOURNAL OF AUTOMATED REASONING 1995年第1期14卷 93-147页

作者： ALFERES, JJ DAMASIO, CV PEREIRA, LM UNIV EVORA DMAT P-7000 EVORA PORTUGAL UNIV NOVA LISBOA CRIA P-2825 MONTE DE CAPARICA PORTUGAL UNIV NOVA LISBOA DCS P-2825 MONTE DE CAPARICA PORTUGAL

The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms. The widespread use of such extended programs requires the definition of a correct top-down querying mechanism, much as for Prolog wrt. normal pro,srams. One purpose of this paper is to present and exploit a SLDNF-like derivation procedure, SLX, for programs with explicit negation under well-founded semantics (WFSX) and prove its soundness and completeness. (Its soundness wrt. the answer-sets semantics is also shown.) Our choice of WFSX as the base semantics is justified by the structural properties it enjoys, which are paramount for top-down query evaluation. Of course, introducing explicit negation requires dealing with contradiction. Consequently, we allow for contradiction to appear, and show moreover how it can be removed by freely changing the truth-values of some subset of a set of predefined revisable literals. To achieve this, we introduce a paraconsistent version of WFSX, WFSX,, that allows contradictions and for which our SLX top-down procedure is proven correct as well. This procedure can be used to detect the existence of pairs of complementary literals in WESX(p) simply by detecting the violation of integrity rules f double left arrow L, inverted right perpendicular L introduced for each L in the language of the program. Furthermore, integrity constraints of a more general form are allowed, whose violation can likewise be detected by SLX. Removal of contradiction or integrity violation is accomplished by a variant of the SLX procedure that collects, in a formula, the alternative combinations of revisable literals' truth-values that ensure the said removal. The formulas, after simplification, can then be satisfied by a number of truth-values changes in the revisable

关键词： logic programming procedures logic programming SEMANTICS NONMONOTONIC REASONING BELIEF REVISION WELL-FOUNDED SEMANTICS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：