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 ...
详细信息
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.
Model-driven approaches in developing and operating Cyber-Physical Systems are increasingly complemented by data-driven methods. Examples for their use cases are the analysis of model repositories for discovering patt...
详细信息
ISBN:
(纸本)9781728122823
Model-driven approaches in developing and operating Cyber-Physical Systems are increasingly complemented by data-driven methods. Examples for their use cases are the analysis of model repositories for discovering patterns and relationships in models, the design-time learning of approximate system and environment models from data, and the detection of divergence from design-time assumptions during operations. In this paper we argue that model- and data-driven approaches have combined use cases that that need complementary services provided by modeling and data analytic frameworks. However, convergence of model-driven and data-driven methods is hindered by the strongly different tool infrastructure. The paper summarizes the integration challenges and proposes a semantic bridge as a solution for filling the gap between the model - and data-driven tool suites.
In this paper we address the problem of modeling creativity in Artificial Intelligence using a Genetic or Evolutionary based approach to computing, where the universe of discourse is represented as theories or program...
详细信息
ISBN:
(纸本)9781424481262
In this paper we address the problem of modeling creativity in Artificial Intelligence using a Genetic or Evolutionary based approach to computing, where the universe of discourse is represented as theories or programs in an extension to the logic programming language, which makes possible to handle incomplete or even contradictory information in an evolutionary environment. Indeed, we present a new insight for the construction of evolutive systems that combines the potential of the knowledge representation and reasoning mechanisms, present in the logic programming languages. Here, in an evolutionary setting, the candidate solutions to model the universe of discourse are seen as evolutionary logic programs or theories, being the test whether a solution is optimal based on a measure of the quality-of-information carried by those logical theories or programs. From a point of view of the process, the quality-of-information of the universe of discourse is assessed on the fly, being therefore possible to select the best logical theory or program that models it, in terms of the same time line.
Soar is a major exemplar of architectural approach to machine cognition with numerous applications including speech recognition, machine perception, robotic, and strategy planning. We have replaced language used in So...
详细信息
ISBN:
(纸本)9781424416738
Soar is a major exemplar of architectural approach to machine cognition with numerous applications including speech recognition, machine perception, robotic, and strategy planning. We have replaced language used in Soar architecture with our own developed XML based Unified Knowledge Manipulation language (UKML) to demonstrate this language as a shared platform for procedural knowledge representation in cognitive architectures, and enhance Soar with some valuable new features including the ability of manipulating XML formatted factual knowledge, greatly improved code readability and organization, and elimination of some ambiguities of Soar traditional language. This paper is a report on this implementation of UMKL, enriched with some examples and their results.
In logicprogramming or functional programminglanguages, data objects, such as terms and lists, are immutable. In a basic implementation of such language, updating one element of an aggegate (contiguous data structur...
详细信息
In logicprogramming or functional programminglanguages, 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.
An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a...
详细信息
An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a large number of processing elements (PE's) with serial I/O links directly connected to each other in a simply modified mesh network. Each PE is a high-speed sequential Prolog processor with its own local memory. The activity of all PE's is locally controlled by four new load balancing algorithms based on purely local communication. Communication is allowed only between directly connected PE's. These load balancing algorithms reduce communication overhead in a load balancing and make it possible to accomplish highly OR-parallel execution. A software simulator using a trace-driven simulation technique based on an inference tree has been developed, and some typical OR-parallel benchmarks such as the n-queens problem have been simulated on it. The average communication per load balancing is reduced by a factor ranging from 1/30 to 1/100 by the interaction of these load balancing algorithms as compared with a conventional copying method. The inference machine (1024 PE's: 32 x 32 array) attains 300-600 times parallel speedup, assuming 1 MLIPS (mega logical inference per second) PE and a 20 MBPS (mega bit per second) each serial I/O link, which could be easily integrated on a single chip using current VLSI technology. This highly OR-parallel inference machine promises to be an important step towards the realization of a high-performance artificial intelligence system.
logicprogramming 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 drastical...
详细信息
logicprogramming 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 logicprogramming. 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.
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...
详细信息
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.
作者:
YOKOMORI, TFUJITSU 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 feature...
详细信息
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.
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 th...
详细信息
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.
暂无评论