Please use this identifier to cite or link to this item:
|Title:||DEPICT : A high-level formal language for modeling constraint satisfaction problems||Authors:||Abbas, Abdulwahed
Tsang, Edward P.K
Nasri, Ahmad H
|Affiliations:||Department of Computer Science||Keywords:||Constraint satisfaction problems (CSPs) and languages
Typed predicate calculus
|Issue Date:||2008||Part of:||International journal of automation and computing||Volume:||5||Issue:||2||Start page:||208||End page:||216||Abstract:||
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.
This paper was presented in " Proceedings of the 4th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 06), March 8-11, 2006 ".
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/1827||Ezproxy URL:||Link to full text||Type:||Journal Article|
|Appears in Collections:||Department of Computer Science|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.