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

A logical foundation for logic programming II: Semantics of general logic programs

JOURNAL OF logic programming 1998年第2期35卷 171-194页

作者： Bochman, A Ctr Technol Educ Holon Dept Computerized Syst IL-58102 Holon Israel

We suggested in Part I of this study a general logical formalism for logic programming based on a four-valued inference. In this paper we give a uniform representation of various semantics for logic programs based on this formalism. The main conclusion from this representation is that the distinction between these semantics can be largely attributed to the difference in their underlying (monotonic) logical systems. Moreover, in most cases the difference can even be reduced to that of the language, that is, to the difference in the logical connectives allowed for representing derivable information. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： foundations of logic programming negation as failure semantics for logic programs nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

A logical foundation for logic programming I. Biconsequence relations and nonmonotonic completion

引用

JOURNAL OF logic programming 1998年第2期35卷 151-170页

作者： Bochman, A Ctr Technol Educ Holon Dept Computerized Syst IL-58102 Holon Israel

We suggest a general logical formalism for logic programming based on a four-valued inference. We show that it forms a proper setting for representing logic programs with negation as failure of a most general kind and for describing logics and semantics that characterize their behavior. In this way we also extend the connection between logic and logic programming beyond positive programs. In addition, the suggested formalism will allow us to see a reasoning about logic programs as a most simple kind of nonmonotonic reasoning in general. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： foundations of logic programming negation as failure semantics for logic programs nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

AXIOMATIZATIONS OF BACKTRACKING 9th

AXIOMATIZATIONS OF BACKTRACKING

引用

9TH ANNUAL SYMP ON THEORETICAL ASPECTS OF COMPUTER SCIENCE ( STACS 92 )

作者： BILLAUD, M LaBRI (Laboratolre Bordelais de Recherche en Inforrnatlque) unité Associée 1304 du C.N.R.S. Université Bordeaux I 351 Cours de la Libération Talence Cedex 33405 France

ISBN: (纸本)3540552103

Goal schemes are terms built from a set of variables (representing goals) and the control structures {false, true, or, and} to which we give a sequential à la Prolog interpretation. We study equivalence relations induced by some interesting classes of elementary goals. We prove that, when goals are allowed to produce side-effects, or when they are restricted to have finite behaviours, there are finite complete axiomatizations that can be used to decide the equivalence of goal schemes. We conjecture that there is no such finite axiomatization in the case of general pure requests. © Springer-Verlag Berlin Heidelberg 1992.

关键词： PROLOG SEMANTICS OF programming LANGUAGES foundations of logic programming DEPTH-1ST SEARCH BACKTRACKING EQUIVALENCE OF PROGRAM SCHEMES ALGEBRAIC SEMANTICS

来源：评论

学校读者我要写书评

暂无评论

Modal logic and negation as failure

引用

Journal of logic and Computation 1991年第3期1卷 331-356页

作者： Balbiani, Philippe Institut de Recherche en Informatique de Toulouse Université 31062 Toulouse Cedex 118 route de Narbonne France

The purpose of a logic programming language is to handle symbols, clauses, goals and programs, and to say whether there are proofs of these goals or not in these programs. It differs from other programming languages in the sense that it is 'logic in action'. Nevertheless, negation in logic programming-namely: the negation as failure rule and SLDNF-resolution-is very different from the logical classical *** negation as failure rule gives a false value to a predicate if the logic program considered cannot give a proof of that predicate. This practical view leads to the fact that negation in logic programming is an operator which tests the provability of the predicate under its scope. Thus negation as failure looks very much like a modal operator which would characterize some idea of *** purpose of this report is to define a declarative semantics for every logic program using the negation as failure rule. It shows that SLDNF-provability is a modal notion. It gives modal formulae which are proved to be sound and complete for this non-monotonic procedure and which explicitly express the implicit meaning of the negation and derivation symbols in logic programming. © 1991 Oxford University Press.

关键词： Declarative semantics foundations of logic programming Modal systems Negation as failure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：