| Towards a compiler for a constraint language |
| Full text |
Pdf
(632 KB)
|
| Source
|
International conference on Industrial and engineering applications of artificial intelligence and expert systems
archive
Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
table of contents
Tullahoma, Tennessee, United States
Pages: 262 - 269
Year of Publication: 1989
ISBN:0-89791-320-5
|
|
Author
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 5, Citation Count: 0
|
|
|
ABSTRACT
For many engineering tasks, constraints are a useful knowledge representation formalism to specify functional relationships. In this paper, we describe a programming language based on constraints which, unlike former approaches, enables us to handle sets of possible values (rather than single values) and to filter them until consistent subsets are obtained that satisfy the constraints.As, e.g., in technical systems, the constraint relations are of different complexity, structure, and applicability, several ways to describe a relation are provided. Different control strategies are available, computing local consistency as well as globally consistent solutions. It is sketched how to realize a compiler for the language, which optimizes constraint descriptions during definition time. As a result, combinatorial explosion can be reduced, depending on the number of variables used in a constraint description.CONSAT is used in several applications, for example, in a system for process diagnosis [Voss 1988], where constraints are applied to maintain functional relationships in physical units. For this purpose, CONSAT was incorporated into the hybrid knowledge representation system BABYLON in order to use constraints together with rules, frames, and Prolog [Guesgen et al. 1987].
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
Freuder 1982
|
|
| |
Guesgen et al. 1987
|
H.W. Guesgen, U. Junker, A. Voss: Constraints in a Hybrid Knowledge Representation System. In: Proceedings of the IJCA187, Milan, Italy, 1987, 30-33.
|
| |
Guesgen, Hertzberg 1988
|
|
| |
Mackworth 1977
|
A. K. Mackworth: Consistency in Networks of Relations. Artificial Intelligence 8 (1977) 99-118.
|
| |
Steele 1980
|
|
| |
Voss 1988
|
H. Voss: Architectural Issues for Expert Systems in Real-Time Control. To appear in: Proceedings of the 1st IFAC Workshop Artificial Intelligence in Real- Time Control, 1988.
|
| |
Waltz 1972
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|