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

Proving correctness and completeness of normal programs - a declarative approach

THEORY AND PRACTICE OF logic programming 2005年第6期5卷 669-711页

作者： Drabent, W Milkowska, M Polish Acad Sci Inst Comp Sci PL-01237 Warsaw Poland Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden Warsaw Univ Inst Informat PL-02097 Warsaw Poland

We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean termination;the latter includes nonfloundering. Only clean termination depends on the operational semantics, in particular on the selection rule. We show how to deal with correctness and completeness in a declarative way, treating programs only from the logical point of view. Specifications used in this approach are interpretations (or theories). We point out that specifications for correctness may differ from those for completeness, as usually there are answers which are neither considered erroneous nor required to be computed. We present proof methods for correctness and completeness for definite programs and generalize them to normal programs. For normal programs we use the 3-valued completion semantics;this is a standard semantics corresponding to negation as finite failure. The proof methods employ solely the classical 2-valued logic. We use a 2-valued characterization of the 3-valued completion semantics, which may be of separate interest. The method of proving correctness of definite programs is not new and can be traced back to the work of Clark in 1979. However a more complicated approach using operational semantics was proposed by some authors. We show that it is not stronger than the declarative one, as far as properties of program answers are concerned. For a corresponding operational approach to normal programs, we show that it is (strictly) weaker than our method. We also employ the ideas of this work to generalize a known method of proving termination of normal programs.

关键词： declarative programming negation in logic programming specifications program correctness and completeness termination teaching logic programming

来源：评论

学校读者我要写书评

暂无评论

Achievements in answer set programming

引用

THEORY AND PRACTICE OF logic programming 2017年第5-6期17卷 961-973页

作者： Lifschitz, Vladimir Univ Texas Austin Austin TX 78712 USA

This paper describes an approach to the methodology of answer set programming that can facilitate the design of encodings that are easy to understand and provably correct. Under this approach, after appending a rule or a small group of rules to the emerging program, we include a comment that states what has been "achieved" so far. This strategy allows us to set out our understanding of the design of the program by describing the roles of small parts of the program in a mathematically precise way.

关键词： answer set programming teaching logic programming programming methodology

来源：评论

学校读者我要写书评

暂无评论

teaching programming for High School Students Using the Lego Mindstorms Robot 10

Teaching Programming for High School Students Using the Lego...

引用

10th Iberian Conference on Information Systems and Technologies (CISTI)

作者： Barreto, Valeria Banachi L'Erario, Alexandre Fabri, Jose Augusto Univ Tecnol Fed Parana Dept Comp Cornelio Procopio Brazil

ISBN: (纸本)9781479983308

The construction of algorithms isn't an easy task for students that start undergraduate computer courses in Brazil. Several Brazilian universities reported that the percentage of desistance and failures in basic programming logic courses can reach 60%. However, there are mechanisms that can minimize this number. One such mechanism is composed of pedagogical practices in order to enter high school students in recreational environments that enable the learning of programming logic. Within this context the aim of this work is to use, as playful object, robotics kit Lego Mindstorms NXT 2.0, model 8547, in promoting the learning of programming logic. To verify the feasibility of this proposal the authors of this paper conducted an experiment with four students from the high school. After the experiment, the students were subjected to reviews and the results obtained were satisfactory.

关键词： teaching logic programming Mindstorms

来源：评论

学校读者我要写书评

暂无评论

Achievements in answer set programming

Achievements in answer set programming

引用

33rd International Conference on logic programming colocated with the 23rd International Conference on Principles and Practice of Constraint programming / 20th International Conference on Theory and Applications of Satisfiability Testing

作者： Lifschitz, Vladimir Univ Texas Austin Austin TX 78712 USA

关键词： answer set programming teaching logic programming programming methodology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：