CSL. II. A compiler for the LCSP

Author

Tay, J.C. ; Huang, S.Y. ; Quek, C.

Author_Institution

Inf. Technol. Inst., Nat. Comput. Board, Singapore

fYear

1997

Firstpage

422

Lastpage

429

Abstract

Part I (see ibid., pp. 414-421) provided a rigorous definition of the CSL (constraint specification language) algebra as a language to model the general n-ary logical constraint satisfaction problem (LCSP). In this paper, the majority of our discussions focus on design and implementational issues that arose while building software for compiling the language into executable data structures. The primary objective of the CSL compiler is to efficiently compile a CSL program (for a user-defined LCSP) into a form that can be solved by binary constraint satisfaction problem (CSP) algorithms

Keywords

algebraic specification; constraint handling; data structures; logic programming languages; problem solving; program compilers; specification languages; CSL algebra; binary CSP algorithms; compiler; constraint specification language; design; executable data structures; implementation; n-ary logical constraint satisfaction problem; Algebra; Buildings; Computer architecture; Data mining; Data structures; Encoding; Information technology; Modular construction; Program processors; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools with Artificial Intelligence, 1997. Proceedings., Ninth IEEE International Conference on

Conference_Location

Newport Beach, CA

ISSN

1082-3409

Print_ISBN

0-8186-8203-5

Type

conf

DOI

10.1109/TAI.1997.632284

Filename

632284