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

Building Conventional "Experts" With a Dialogue logic programming language

IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND language PROCESSING 2023年 31卷 1784-1796页

作者： Zheng, Xiaoqing Fudan Univ Sch Comp Sci Shanghai 200433 Peoples R China

We describe DiaProlog, a dialogue logic programming language that extends the vanilla Prolog with the features to facilitate the integration of reasoning capabilities into task-oriented dialogue systems. The extended language combines the expressive power of Horn rule and description logic with uncertainty and allows us to describe the specifications for both problem solving and dialogue management in a declarative programming manner. The systems incorporated with DiaProlog are capable of asking appropriate questions when necessary and collecting the answers to direct the line of reasoning and guide the conversation toward the correct solution. Besides, an explanation facility is provided to explain the reasoning behind its conclusion. We also describe a dialogue management framework built upon DiaProlog, which has been validated in multiple implementations providing legal consulting, financial advising, and medical guidance services where many questions require complex inferences about knowledge.

关键词： Task analysis Cognition Knowledge based systems Oral communication Law Speech processing Neural networks Dialogue management knowledge base logic programming language prolog task-oriented dialogue systems

来源：评论

学校读者我要写书评

暂无评论

REASONING ABOUT PROTEIN TOPOLOGY USING THE logic programming language PROLOG

引用

JOURNAL OF MOLECULAR GRAPHICS 1985年第4期3卷 151-157页

作者： RAWLINGS, CJ TAYLOR, WR NYAKAIRU, J FOX, J STERNBERG, MJE UNIV LONDON BIRKBECK COLL DEPT CRYSTALLOGMOLEC BIOL LABLONDON WC1E 7HXENGLAND

The logic programming language PROLOG was used to represent and reason about the topology of protein structures. prolog descriptions of the relative positions of protein secondary structural features (protein topology) were generated from information in the Brookhaven data-bank. β-structural motifs (hairpin, meander, Greek key and jelly roll) were then defined using PROLOG rules. The PROLOG program was able to infer the presence of these structures in the prolog representation of the protein. A key feature of this approach is the facility to reason about complex topological motifs in protein structure in terms of primitive spatial relationships. Through the ability to represent logical reasoning. prolog could be used to develop flexible, high-level methods for controlling a graphics facility or front ends to more conventional databases.

关键词： proteins + chemical structure topology PROLOG logic programming language topological motifs

来源：评论

学校读者我要写书评

暂无评论

SET ABSTRACTION - AN EXTENSION OF ALL SOLUTIONS PREDICATE IN logic programming language

引用

NEW GENERATION COMPUTING 1987年第3期5卷 227-248页

作者： YOKOMORI, T FUJITSU LTD INT INST ADV STUDY SOCIAL INFORMAT SCINUMAZUSHIZUOKA 41003JAPAN

The concept of set abstraction is introduced as a simple analogy of that of lambda abstraction in the theory of lambda calculus. The set abstraction is concerned with two extensions concerning Prolog language features: “set expression” and “predicate variable.” It has been argued in the literature that the set expression extension to Prolog does really contribute to the power of the language, while the extension of predicate variables does not add anything to Prolog.

关键词： All Solutions predicate Predicate Variables logic programming language Second-order Predicate

来源：评论

学校读者我要写书评

暂无评论

DATA-FLOW BASED EXECUTION MECHANISMS OF PARALLEL AND CONCURRENT PROLOG

引用

NEW GENERATION COMPUTING 1985年第1期3卷 15-41页

作者： ITO, N SHIMIZU, H KISHI, M KUNO, E ROKUSAWA, K INST NEW GENERAT COMP TECHNOL MINATO KUTOKYO 108JAPAN OKI ELECT IND CO LTD MINATO KUTOKYO 108JAPAN

Study attempts to show that our machine architecture based on the data flow model is suitable for two types of logic programming languages with different aims: one is Parallel Prolog and the other is Concurrent Prolog. The data flow model can naturally implement parallel computation, and it has close similarity to these languages. Unification and nondeterministic control, two basic functions of these languages, are represented by data flow graphs and interpreted by the machine. Several representations of variables, that facilitate the development of parallel unification and nondeterministic control mechanisms for these languages, the unification and control primitives needed to execute these languages on this architecture are presented.

关键词： Parallel Processing Data Flow Model logic programming language Unification Nondeterminism

来源：评论

学校读者我要写书评

暂无评论

logic programming WITH TYPED UNIFICATION AND ITS REALIZATION ON AN ABSTRACT MACHINE

引用

IBM JOURNAL OF RESEARCH AND DEVELOPMENT 1992年第3期36卷 375-390页

作者： BEIERLE, C IBM Germany Scientific Center Heidelberg Institute for Knowledge Based Systems P.O. Box 80 08 80 0-7000 Stuttgart 80 Germany|c|

logic programming can benefit from a typing concept which supports many software engineering principles such as data abstraction, modularization, etc. From a computational point of view, the use of types can drastically reduce the search space. Starting from these observations, this paper gives a survey of many-sorted, order-sorted, and polymorphic approaches to type concepts in logic programming. The underlying unification procedures for ordinary term unification, order-sorted unification, and in particular for polymorphic order-sorted unification are given in the style of solving a set of equations, giving a common basis for comparing them. In addition, the realization of these unification procedures on a Warren Abstract Machine-like architecture is described. Special emphasis is placed on the abstract machine developed for PROTOS-L, a logic programming language based on polymorphic order-sorted unification.

关键词： .data abstraction Warren Abstract set of equations logic programming language term unification typed unification

来源：评论

学校读者我要写书评

暂无评论

Reversible functor: Immutable aggregate with constant time update operation

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1996年第12期E79D卷 1646-1654页

作者： Aoyagi, T Faculty of Electro-Communi Cations University of Electro-Communications Chofushi 182 Japan

In logic programming or functional programming languages, data objects, such as terms and lists, are immutable. In a basic implementation of such language, updating one element of an aggegate (contiguous data structure, such as an array) involves making a new copy of the whole aggregate. However such copying can be expensive, and can be avoided by using a destructive update. We introduce the concept of a wrapper which enables destructive operation on an immutable object. Based on this concept, we designed the reversible functor as a solution to the aggregate update problem. We implemented the reversible functor in the existing SB-Prolog system and carried out several benchmarks. These benchmark results show its effectiveness. When using a large functor and updating it many times, the performance is improved dramatically by implementing the reversible functor. It incurs some overhead at runtime, but the amount is small and acceptable.

关键词： logic programming language functional programming language data structure immutable aggregate update

来源：评论

学校读者我要写书评

暂无评论

THERMAL GENERATOR SCHEDULING ALGORITHM BASED ON HEURISTIC-GUIDED DEPTH-FIRST SEARCH

引用

IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION 1990年第1期137卷 33-43页

作者： WONG, KP CHEUNG, HN Dept. of Electrical and Electron Engineering University of Western Australia Perth Australia

This paper develops an algorithm which is suitable for implementation on computers by a logic programming language, Prolog, for scheduling thermal generators to meet the daily rising system demand and spinning reserve requirement in the operation of power systems. The algorithm is based on the depth-first and heuristic search techniques in artificial intelligence, and an interpretation of the scheduling process as a tree searching problem. Heuristic rules are derived for overcoming the problem of combinatorial explosion in the search space of the scheduling process and for quickly determining the solution schedule having the lowest total excessive generation capacity between the total generation capacity and the combined system demand and spinning reserve. The ramp rate characteristics and crew constraints of generator units together with the system constraint of must-on units are incorporated in the algorithm. The application of the developed algorithm which is implemented by Prolog to schedule ten thermal generators is presented.

关键词： spinning reserve PROLOG trees (mathematics) Expert systems and other AI software and techniques Combinatorial mathematics power systems artificial intelligence tree searching problem search problems heuristic-guided depth-first search Power engineering computing logic programming language scheduling power engineering computing system demand combinatorial explosion thermal generators Power system management, operation and economics

来源：评论

学校读者我要写书评

暂无评论

AID TO HIERARCHICAL AND STRUCTURED logic DESIGN USING TEMPORAL logic AND PROLOG

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1986年第5期133卷 283-294页

作者： FUJITA, M KONO, S TANAKA, H MOTOOKA, T Department of Electrical Engineering University of Tokyo Tokyo Japan

The paper describes a study of an aid for hardware logic design using temporal logic, called linear time temporal logic (LTTL), and Prolog. A review of specification techniques for synchronisation parts using LTTL is given. A temporal logic programming language called Tokio, which is based on LTTL and includes interval variables, is presented. As parallelisms are tedious to describe sequentially in LTTL, the notion of interval variables which express a finite number of successive times is introduced.

关键词： logic circuits logic testing Prolog structured logic design Computer-aided logic design synchronisation hardware logic design logic programming language specification techniques linear time temporal logic Tokio logic CAD temporal logic

来源：评论

学校读者我要写书评

暂无评论

CIRCUIT ALLOCATION IN SUBTRANSMISSION SWITCHING SUBSTATIONS USING BEST-1ST SEARCH STRATEGY

引用

IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION 1988年第6期135卷 489-496页

作者： WONG, KP CHEUNG, HN Department of Electrical and Electronic Engineering University of Western Australia Perth Australia

Based on the best-first search strategy, this paper develops a general computational model for the automatic determination of circuit allocation schemes in subtransmission substations. Starting from a discussion of the allocation requirements, fault indices based on the percentage of power rating loss of circuits are first derived. The best-first strategy is then defined by the group allocation and overall allocation index trees, which are formed from the relations of the fault indices. A search procedure implementing this strategy is developed to determine the best overall allocation arrangement, which is found by combining the best group allocation schemes. A general method for assigning interconnectors to the tasks of source and load circuits to assess the security level of the overall allocation schemes in the process of islanding constraint checking is reported. The model is implemented by a logic programming language, Prolog. The developed software system is applied to allocate six groups of circuits from seven substations to a 132 kV duplicate-busbar substation.

关键词： PROLOG Substations power rating loss circuit allocation schemes Switchgear security level logic programming language Power engineering computing power engineering computing duplicate-busbar substation load circuits switching substations 132 kV subtransmission switching substations best-first search strategy

来源：评论

学校读者我要写书评

暂无评论

KNOWLEDGE INFORMATION-PROCESSING language - SHAPE UP

引用

NEW GENERATION COMPUTING 1984年第2期2卷 195-201页

作者： KONAGAYA, A UMEMURA, M NEC CORP C&C SYST RES LABSMIYAMAE KUKAWASAKI 213JAPAN

A new logic programming language, ShapeUp, is developed. ShapeUp is an expanded Prolog system with string matching facilities. The language has been developed to give programmers a new computer programming environment, especially for knowledge information processing. This area includes natural language comprehension and intelligent text processing systems with better man-machine interfaces. For this kind of application, character string data play a principal part rather than conventional numerical data. In ShapeUp, string patterns are introduced as Prolog ‘terms’. Their matching process is performed inside the unification. Thus, a program is far simpler and easier to write and read in ShapeUp, than in conventional Prolog systems, and program size is extremely reduced.

关键词： logic programming language String Matching Knowledge Information Processing PROLOG

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：