Please use this identifier to cite or link to this item:
|Title:||Toward a general language for the specification of constraint satisfaction problems||Authors:||Abbas, Abdulwahed
Tsang, Edward P.K
|Affiliations:||Department of Computer Science||Keywords:||Constraint satisfaction problems (CSPs) and languages
First-Order Predicate Calculus
The Z Specification Language
|Issue Date:||2001||Conference:||Proceedings, Constraint Programming, Artificial Intelligence and Operations Research Workshop (April 2001 : London, UK)||Abstract:||
The past decade saw rapid progress toward prominence of constraint satisfaction technology. Many practical algorithms have been developed to solve larger and larger problems. The degree of maturity in this technology begs the support of well-established software engineering tools. This paper targets a formal specification language DEPICT 0.1 that can aid in the formulation of constraint satisfaction problems and the identification of suitable algorithms for their solutions. This paper outlines, through a few selected examples, suitable characteristics that DEPICT 0.1 should possess and concludes with some of the benefits that can arise from that.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/860||Open URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Computer Science|
Show full item record
checked on Oct 23, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.