PROTEL电子CAD软件包汉字输入的实现及其绘图功能的开发应用

ＰＲＯＴＥＬ电子ＣＡＤ软件包汉字输入的实现及其绘图功能的开发应用邢观峰福州大学１２９０１信箱（３５０００２）１引言ＰＲＯＴＥＬ（简称ＰＴ）电子ＣＡＤ软件包是澳大利亚ＰＲＯＴＥＬＴＥＣＨＮＯＬＯＧＹ公司推出的多层印制板辅助设计软件，它保持了对ＴＡＮＧＯ...     

用可编程控制器实现BEPC安全联锁系统——PLC在测控系统中…

本文介绍一种设计安全联锁系统的新方法，它的基本思想是采用可编程控制器（ＰＲＯＧＲＡＭＭＡＢＬＥ ＣＯＮＴＲＯＬＥＲ或ＰＲＯＧＲＡＭＭＡＢＬＥＬＯＧＩＣＣＯＮＴＲＯＬＬＥＲ－ＰＬＣ）替代过去的继电器和逻辑的控制，组成分布系统，以提高要靠性和可维护性，增加灵活性，缩短工期，节省人力和资金，一台多媒体ＩＢＭ－ＰＣ兼容机有作业上位机，监控整个系统。     

用可编程控制器实现BEPC安全联锁系统——PLC在测控系统中的应用

本文介绍一种设计安全联锁系统的新方法，它的基本思想是采用可编程控制器（ＰＲＯＧＲＡＭＭＡＢＬＥＣＯＮ－ＴＲＯＬＬＥＲ或ＰＲＯＧＲＡＭＭＡＢＬＥＬＯＧＩＣＣＯＮＴＲＯＬＬＥＲ—ＰＬＣ）替代过去的继电器和专用逻辑的控制，组成分布式系统，以提高可靠性和可维护性，增加灵活性，缩短工期，节省人力和资金。一台多媒体ＩＢＭ－ＰＣ兼容机用作上位机，监控整个系统。     

逻辑程序并行推理机EC─PIM的系统设计与实现

本文介绍面向逻辑程序的并行推理机系统ＥＣ－ＰＩＭ。它以逻辑程序设计语言ＰＲＯＬＯＧ为核心，以硬件、软件两方面结合的方式直接实现以ＰＲＯＬＯＧ所描述的推理任务。系统设计基于Ｅａｒｌｅｙ算法、ＶＬＳＩ技术以及适当的系统结构及部件的设计方案。在提出并行推理机及其概念模型的前提下，作出ＥＣ－ＰＩＭ体系结构的设计，包括互连结构。公共存储器系统的设计方案。并成功地实现了双八路二级并行逻辑推理模拟机的研制。     

逻辑程序并行推理机EC—PIM的系统设计与实现

本文介绍面向逻辑程序的并行推理机系统ＥＣ－ＰＩＭ。它以逻辑程序设计语言ＰＲＯＬＯＧ为核心，以硬件、软件两方面结合的方式直接实现以ＰＲＯＬＯＧ所描述的推理任务，系统设计基于Ｅａｒｌｅｙ算法，ＶＬＳＩ技术以及适当的系统结构及部件的设计方案，在提出并行推理机及其概念模型的前提下，作出ＥＣ－ＰＩＭ体系结构的设计包括互连结构，公共存储器系统的设计方案，并成功地实现了双八路二级并行逻辑推理模拟机的研制。     

使用工作站网络并行执行prolog程序

本文介绍了一个在ＳＵＮ工作站网络上实现的分布式Ｃ—ＰＲＯＬＯＧ解释系统ＤＣ－ＰＲＯＬＯＧ，它能够自动地将其应用程序的顺序解释过程变为并行解释过程；能够充分利用空闲的主存资源求解大问题，使一些单机上因内存容量不足而无法执行的任务得以执行．     

块角型约束线性规划问题的内点分解算法

块角型约束线性规划问题的内点分解算法吴力（中国科学院计算数学与科学工程计算研究所）ＡＤＥＣＯＭＰＯＳＩＴＩＯＮＡＬＧＯＲＩＴＨＭＦＯＲＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧＰＲＯＢＬＥＭＳＷＩＴＨＢＬＯＣＫＡＮＧＵＬＡＲＣＯＮＳＴＲＡＩＮＴＳ￥ＷｕＬｉ（...     

运用PROLOG语言表示和处理分子结构

本文描述了用第五代计算机程序设计语言－ＰＲＯＬＯＧ表示和处理分子结构的方法，提出了按照环系和功能团对分子结构进行归约的方法，并且设计了由母核与分子片段组合产生分子结构的ＰＲＯＬＯＧ程序。     

ORACLE关系数据库编程界面PRO＊C的应用

ＯＲＡＣＬＥ关系数据库编程界面ＰＲＯ＊Ｃ的应用北京工业大学高勇秀，徐京晶ＯＲＡＣＬＥ关系数据库被广泛应用于信息管理系统．ＰＲＯ＊Ｃ是ＯＲＡＣＬＥＲＤＢＭＳ提供的应用软件开发工具之一，利用ＰＲＯ＊Ｃ可以实现在Ｃ语言程序中操纵和管理ＯＲＡＣＬＥ数据库。Ｏ...     

LP环境下快速搜索与选择回溯的实现

本文实现了一种新的ＬＰ实现方法，我们采用一种精巧的内部变换结构来加速ＰＲＯＬＯＧ执行的合一进程，和一种基于变元例化环境的选择性回溯方法来提高ＰＲＯＬＯＧ执行中机械回溯的“智能性”。     

Using an extended PROLOG to solve the lion and unicorn puzzle

This paper presents a general approach to solve a constraint satisfaction problem over a finite domain by reducing it to unification in finite algebras. The lion and unicorn puzzle is considered as a constraint satisfaction problem and its implementation in an extended PROLOG is described.     

The occur-check problem revisited

A method is presented for executing PROLOG programs which avoids almost all unnecessary occur-checks. The method is based on a dynamic classification of the context in which logical variables occur. No static global analysis of the PROLOG program is required to detect the places where an occur-check has to be made. The presented method has also an important side benefit. It considerably cuts down on the number of memory references during the execution of PROLOG programs. Furthermore, in most cases it avoids “trailing” and “untrailing” of unbound variables altogether. Due to this fact the employed method actually speeds up PROLOG execution. The method is discussed in terms of an actual implementation based on the Warren abstract PROLOG instruction set. However, the method should be applicable to other implementation models as well. No assumptions are made with respect to particular hardware.     

利用类比知识的基于解释的学习

本文介绍如何将示例中包含的新的知识通过基于解释的学习加入到原来不完善的领域知识库中去。整个学习过程是在示例的引导下依据领域理论和类比知识进行推理的纯演绎过程。因此，经过改进的领域理论可以保持其正确性。系统的原型在ＳＵＮ工作站上用ＱＵＩＮＴＵＳ ＰＲＯＬＯＧ实现。     

Classifications of subjects with the language PROLOG

The logical language PROLOG is used for the definition and characterization of groups of subjects. The groups are firstly defined by sets of variables with comparable scales. Secondly, the single members of the groups are characterized by logically structured combinations of variables which do not necessarily have comparable scales. The performance of the characterizations is estimated by determining the rates sensitivity and specificity. The new classification method is applied in a follow-up study including the assessment of the activity of 76 healthy subjects during two controlled experiments. The classification with PROLOG is then compared with the methods of logistic regression and with discriminant analysis. The comparisons demonstrate that, under similar conditions, the results of a classification with PROLOG parallel the results of statistically based classification procedures. In addition, PROLOG permits characterizations of single subjects based on variables from different scientific disciplines.     

Denotational and operational semantics for prolog

The semantics of PROLOG programs is usually given in terms of the model theory of first-order logic. However, this does not adequately characterizethe computational behavior of PROLOG programs. PROLOG implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as nonlogical features like cut. In this work we develop a denotational semantics that captures thecomputational behavior of PROLOG. We present a semantics for “cut-free” PROLOG, which is then extended to PROLOG with cut. For each case we develop a congruence proof that relates the semantics to a standard operational interpreter. As an application of our denotational semantics, we show the correctness of some standard “folk” theorems regarding transformations on PROLOG programs.     

有效的Prolog编译实现方法

本文从实现的角度讨论了几种有效的Prolog编译技术,包括一个有效的抽象指令集、子句选择回溯,以及可插入子句的内部谓词assert a/z的实现方法.这些技术已被应用到在VAX机上开发的Prolog编译系统中.     

PROLOG运行机制的辅助理解工具

用表意图形的方法研究了人工智能语言ＰＲＯＬＯＧ的各种语法成份，找出一套有效的辅助理解工具，它能准确清晰地图解ＰＲＯＬＯＧ程序，如目标和子句，谓词ＦＡＩＬ和回溯，以及截断谓词等内容。文中特别用两个例子详述了在ＰＲＯＬＯＧ语言中最难理解的递归过程。最后，简述了矩形表示法，该工具的图册和配套的图形动画软件。     

Turbo PROLOG程序开发中数据描述的一种方法

ＴｕｒｂｏＰＲＯＬＯＧ程序开发中数据组织与描述的一种系统的、实用的、简单但又十分具体的方法和过程。参照文中的步骤，可以有效地把用户的数据说明直接地变换为相应的ＴｕｒｂｏＰＲＯＬＯＧ定义。     

Techniques of integrating Datalog with PROLOG

Since extending DATALOG to a general-purpose programming language seems very difficult,many projects have embedded a DATALOG-based query laguage into a procedural host language,such as CORAL,Glue-Nail,etc.Although DATALOG can be consideed as function-free PROLOG,they are very different in many aspects.For instance,DATALOG is declarative while PROLOG isn‘t,DATALOG takes “a-set-at-a-time” mode of evaluation but PROLOG takes “a-tuple-at-a-time”one,DATALOG is only a query language whereas PROLOG is a general-purpose programming language.It is thought that integrating DATALOG with PROLOG may take their advantages.KBASEP is such a language.It uses KBASE as the query language and PROLOG as its procedural host language,where KBASE is a ne extemsion of DATALOG with negation and function.This paper introduces the integration techniques used in KBASE-P system.     

Negation as inconsistency. I

The notion of negation as inconsistency is motivated and introduced into PROLOG. This negation is fully compatible with classical negation and gives a version of PROLOG which is a stronger fragment of classical logic than ordinary PROLOG. It is intended that negation as inconsistency replace the notion of negation as failure. Negation as inconsistency can be generalized in a natural way and in its generalized form will include negation as failure as a special case.