DEPICT： A High-level Formal Language for Modeling Constraint Satisfaction Problems

• Published in: International journal of automation and computing Vol. 5; no. 2; pp. 208 - 216
• Main Authors: Abbas, Abdulwahed M., Tsang, Edward P. K., Nasri, Ahmad H.
• Format: Journal Article
• Language: English
• Published: Heidelberg Institute of Automation, Chinese Academy of Sciences 01-04-2008; Springer Nature B.V; Department of Computer Science, The University of Balamand, P. O. Box 100, Tripoli, Lebanon%Department of Computing and Electronic Systems, The University of Essex, Wivenhoe Park, Colchester CO4 3SQ, UK%Department of Computer Science, The American University of Beirut, P. O. Box: 11-0236, Riad El-Solh, Beirut, Lebanon
• Subjects: Algorithms; Benchmarking; CAE) and Design; Computation; Computer Applications; Computer-Aided Engineering (CAD; Control; CSPs; Engineering; Interpreters; Mathematical models; Mechatronics; Programming languages; Prototypes; Robotics; Studies; Turning; 计算机技术; 计算机语言; 语言程序; Constraint satisfaction problems (CSPs) and languages; formal specifications; typed predicate calculus; language interpreter
• ISSN: 1476-8186; 1751-8520
• DOI: 10.1007/s11633-008-0208-7

The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved.