Goedel语言对现代软件工程方法的支持

文章以一种新型的逻辑程序设计语言——Goedel语言为例，对逻辑程序设计语言与现代软件工程主要思想和方法的结合情况进行了初步探讨。Goedel语言通过引入模块系统、类型系统和延迟计算机制等不同于以往逻辑程序的新机制，能够支持现代软件设计的一些主流方法。模块系统提供了组织大规模程序的方法，并通过结合类型系统实现了对抽象数据类型程序设计的支持，从而能够支持面向对象程序设计；延迟计算则使利用该语言所编制的软件在可重用性方面获得提升。     

Gdel语言类型系统

Gdel语言是一种说明性逻辑程序设计语言。该语言基于一阶逻辑,引入了一个多态多类的类型系统和多种新的语言成分,支持抽象数据类型和模块化程序设计等技术,语言本身也具有很强的说明性语义。详细介绍了Gdel语言的类型系统及其构造,对在逻辑程序设计语言中引入类型系统的作用进行了一些深入的分析和讨论。     

G(o)del语言类型系统

G(o)del语言是一种说明性逻辑程序设计语言.该语言基于一阶逻辑,引入了一个多态多类的类型系统和多种新的语言成分,支持抽象数据类型和模块化程序设计等技术,语言本身也具有很强的说明性语义.详细介绍了G(o)del语言的类型系统及其构造,对在逻辑程序设计语言中引入类型系统的作用进行了一些深入的分析和讨论.     

Gödel语言类型系统

G(o)del语言是一种说明性逻辑程序设计语言.该语言基于一阶逻辑,引入了一个多态多类的类型系统和多种新的语言成分,支持抽象数据类型和模块化程序设计等技术,语言本身也具有很强的说明性语义.详细介绍了G(o)del语言的类型系统及其构造,对在逻辑程序设计语言中引入类型系统的作用进行了一些深入的分析和讨论.     

Godel语言的说明性语义简述

Godel语言是在Prolog语言基础上发展而来的一种新型逻辑程序设计语言。本文基于类型一阶谓词逻辑的模型论,阐明了Godel语言的说明性语义,为该语言的实现模型奠定了一定的理论基础。     

逻辑程序设计语言G(o)del与Prolog的比较

在多态多类的一阶逻辑基础之上,围绕类型系统、模块系统、控制机制、元程序设计和输入／输出部分对Gǒdel语言功能进行分析。重点比较了逻辑程序设计语言Gǒdel与Prolog的联系与区别,通过比较分析,表明由于摒弃了Prolog语言中的非逻辑成分,引入了多种新的语言成分,Gǒdel语言具有更好的说明性语义和执行效率。     

G觟del语言的说明性语义简述

Godel语言是在Prolog语言基础上发展而来的一种新型逻辑程序设计语言。本文基于类型一阶谓词逻辑的模型论,阐明了Godel语言的说明性语义,为该语言的实现模型奠定了一定的理论基础。     

对象式逻辑程序设计语言LKO的说明性语义

本文基于逻辑程序设计语言的良基模型语义，探讨了对象逻辑程序设计语言ＬＫＯ的说明性语义，该语义由组合迭代的极小不动点定义，具有构造性和组合性，迷在ＬＫＯ中进一步引入非单调继承和逻辑奠定了基础。     

Gdel语言对现代软件工程方法的支持

文章以一种新型的逻辑程序设计语言——G+del语言为例,对逻辑程序设计语言与现代软件工程主要思想和方法的结合情况进行了初步探讨。G,del语言通过引入模块系统、类型系统和延迟计算机制等不同于以往逻辑程序的新机制,能够支持现代软件设计的一些主流方法。模块系统提供了组织大规模程序的方法,并通过结合类型系统实现了对抽象数据类型程序设计的支持,从而能够支持面向对象程序设计;延迟计算则使利用该语言所编制的软件在可重用性方面获得提升。     

G(o)del语言对现代软件工程方法的支持

文章以一种新型的逻辑程序设计语言--G(o)del语言为例,对逻辑程序设计语言与现代软件工程主要思想和方法的结合情况进行了初步探讨.G(o)del语言通过引入模块系统、类型系统和延迟计算机制等不同于以往逻辑程序的新机制,能够支持现代软件设计的一些主流方法.模块系统提供了组织大规模程序的方法,并通过结合类型系统实现了对抽象数据类型程序设计的支持,从而能够支持面向对象程序设计;延迟计算则使利用该语言所编制的软件在可重用性方面获得提升.     

Maude: specification and programming in rewriting logic

Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude.     

Declarative paradigm of test coverage

Two facts about declarative programming prevent the application of conventional testing methods. First, the classical test coverage measures such as statement, branch or path coverage, cannot be used, since in declarative programs no control flow notion exists. Second, there is no widely accepted language available for formal specification, since predicate logic, which is the most common formalism for declarative programming, is already a very high-level abstract language. This paper presents a new approach exending previous work by the authors on test input generation for declarative programs. For this purpose, the existing program instrumentation notion is extended and a new logic coverage measure is introduced. The approach is mathematically formalized and the goal of achieving 100% program logic coverage controls the automatic test input generation. The method is depicted by means of logic programming; the results are, however, generally applicable. Finally, the concepts introduced have been used practically within a test environment. © 1998 John Wiley & Sons, Ltd.     

A declarative coordination language

We describe Gammalog, a logic language whose semantics is based on the chemical metaphor. The language combines the ability of describing coordination by transformation rules on a shared-dataspace, as in Gamma, with the execution model of logic programming. The main feature of Gammalog is that the declarative reading of programs is not restricted to the pure logic language but it also includes the coordination mechanisms. This feature makes Gammalog a promising alternative to other coordination models which can be embedded in logic programming. We present the language syntax, its formal semantics, and a prototype implementation based on Gödel, which inherits its strongly typed framework. As an example of the expressive power of the language we provide the specification of a simple operating system.     

Declarative programming for agent applications

This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic programming idioms, higher-order functions, modal computation, probabilistic computation, and some theorem-proving capabilities. The need for these features is motivated and examples are given to illustrate the central ideas.     

Logic programming with arrays

Nial is a programming language designed around a mathematical treatment of data as nested arrays. A goal of the research described is to integrate within Nial a functional style of programming based on the theory of arrays with the declarative capabilities of a logic programming environment. This is partially accomplished by storing logic clauses as arrays which can be manipulated using logic clauses. Arrays as terms are considered as part of the syntax of the clauses. The approach to logic programming is based on providing a flexible environment for experimenting with full clausal or Horn clause logic. A variety of predefined control strategies and the capability for user-defined control strategies have been provided. The expressive capabilities of combining logic and functional programming styles provides a suitable language for many application areas. The philosophy and design behind a combined logic/database model used to prototype a knowledge-based systems application are described     

可更新Datalog的分布式时态逻辑扩展及应用

针对现有的分布式逻辑语言缺乏完整时态表达力等问题,将分布式时态逻辑谓词引入Datalog规则,提出TU-Datalog语言。该语言通过融入U-Datalog的非即时性更新语义,形成完全声明式具有强大时态表达力的逻辑编程语言和环境。通过扩展U-Datalog逻辑固定点语义,提出TU-Datalog语言的固定点时态演化规则,并对该语言的语法、语义、评价算法进行了研究,最后对该语言的应用做了说明和示例。     

Beyond graph neural networks with lifted relational neural networks

Machine Learning - We introduce a declarative differentiable programming framework, based on the language of Lifted Relational Neural Networks, where small parameterized logic programs are used to...