This paper provides a detailed presentation of a Prolog-written meta-level interpreter for a constraint logic programming (CLP) language for expressing equalities and disequalities of finite trees, as well as non-nega...
详细信息
This paper provides a detailed presentation of a Prolog-written meta-level interpreter for a constraint logic programming (CLP) language for expressing equalities and disequalities of finite trees, as well as non-negative integers (arities). The logical interpretation of the Prolog primitive functor (whose arguments are trees and arity) is used to illustrate the interactions among constraints pertaining to multiple domains. The paper's objective is to provide insights about CLP language design and to present a modularized, incrementally-expandable meta-processor for this class of languages.
The efficient satisfaction of constraints is crucial for the implementation of constraintprogramming languages and systems, such as ThingLab 11, CLP(R), CHIP, Prolog-111, and Kaleidoscope. Previously, we defined the ...
详细信息
The fifth generation computer project was launched in 1982, aiming at developing parallel computers dedicated for knowledge information processing. It was commonly believed that knowledge processing based on symbolic ...
详细信息
The article focuses on the Fifth Generation Computer Systems (FGCS) project that began in 1982. The main key concept of the FGCS project is that logicprogramming should become the new unifying principle in computer s...
详细信息
The article focuses on the Fifth Generation Computer Systems (FGCS) project that began in 1982. The main key concept of the FGCS project is that logicprogramming should become the new unifying principle in computer science. The main goal of the project was to establish knowledge information processing technology, as well as to significantly improve parallel computer technology. It was commonly believed that combining knowledge information processing and parallel processing would be very difficult to achieve. During the project, researchers succeeded in developing a concurrent logicprogramming language called Guarded Horn Clauses, and have been developing the final target parallel computer the Parallel Inference Machine. constraint logic programming is one of the most promising areas in the field of logicprogramming. The domain of Prolog is extended to cover most artificial intelligence problems. The objective is to combine constraint satisfaction and logicprogramming. Researchers of the FGCS project have laid emphasis on the research into parallel applications.
This paper shows that constraint logic programming languages (such as CLP ()) provide a useful computational logic for modelling, simulating and verifying real-time discrete event processes. The designer's knowled...
详细信息
This paper shows that constraint logic programming languages (such as CLP ()) provide a useful computational logic for modelling, simulating and verifying real-time discrete event processes. The designer's knowledge about discrete processes can be represented in a fashion that stays close to the mathematical definition of the processes, and can be used to semi-automate verification of (possibly infinite state) systems.
暂无评论