Skip to main content
SpringerLink
Log in

DEPICT: A high-level formal language for modeling constraint satisfaction problems

  • Published:
International Journal of Automation and Computing Aims and scope Submit manuscript

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Rossi, P. V. Beek, T. Walsh. Handbook of Constraint Programming, Elsevier Science Publishers, Amsterdam, Holand, 2006.

    Book  Google Scholar 

  2. R. Detcher. Constraint Processing, Morgan Kaufmann Publishers, USA, 2003.

    Google Scholar 

  3. P. Flener. ASTRA Research Group on the Analysis, Synthesis, and Transformation/Reformulation of Algorithms in Constraint Technology (CT), [Online], Available: http://www.it.uu.se/research/group/astra, November, 2007.

  4. E. P. K. Tsang. CSP Research Group, [Online], Available: http://www.bracil.net/CSP/, November, 2007.

  5. M. Wallace. Eclipse, [Online], Available: http://www.eclipse.org/, November, 2007.

  6. ILOG Inc. ILOG, [Online], Available: http://www.ilog.com, November, 2007.

  7. P. V. Hentenryck. The OPL Optimization Programming Language, MIT Press, Cambridge, MA, USA, 1999.

    Google Scholar 

  8. L. Michel, P. V. Hentenryck. OPL++ A Modeling Layer for Constraint Programming Libraries, Technical Report CS-00-07, Brown University, USA, 2000.

    Google Scholar 

  9. J. L. Lauriere. ALICE: A Language and a Program for Solving Combinatorial Problems. Artificial Intelligence, vol. 10, pp. 29–127, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  10. H. Simonis. The CHIP System and Its Applications. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming, Lecture Notes In Computer Science, Springer-Verlag, vol. 976, pp. 643–646, 1995.

    Google Scholar 

  11. A. Dovier, E. G. Omodeo, E. Pontelli, G. Rossi. {log}: A Language for Programming in Logic with Finite Sets. Journal of Logic Programming, vol. 28, no. 1, pp. 1–44, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  12. C. Gervet. Conjuncto: Constraint Logic Programming with Finite Set Domains. In Proceedings of International Symposium on Logic Programming, MIT Press, Symposia, Melbourne, pp. 339–358, 1994.

    Google Scholar 

  13. R. Fourer, D. M. Gay, B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming, Thomson/Brooks/Cole, Australia, 2002.

    Google Scholar 

  14. C. Schulte. The Oz Programming System, [Online], Available: http://www.ps.uni-sb.de/oz2.

  15. E. P. K. Tsang. Foundations of Constraint Satisfaction, Academic Press, San Diego, USA, 1993.

    Google Scholar 

  16. A. Abbas, E. Tsang. Toward a General Language for the Specification of Constraint Satisfaction Problems. In Proceedings of Constraint Programming, Artificial Intelligence and Operations Research, Imperial College, London, UK, pp. 237–257, 2001.

    Google Scholar 

  17. B. Hnich. Function Variables for Constraint Programming, Ph.D. dissertation, University of Uppsala, Sweden, 2003.

    Google Scholar 

  18. A. Abbas. Programming with Types and Rules in Martin-Löf’s Theory of Types, Ph. D. dissertation, Queen Mary College, University of London, UK, 1987.

    Google Scholar 

  19. P. Mills, E. P. K. Tsang, R. Williams, J. Ford, J. Borrett. EaCL 1.5: An Easy Abstract Constraint Optimization Programming Language, Technical Report CSM-324, Department of Computer Science, The University of Essex, UK, 2000.

    Google Scholar 

  20. J. E. Borrett, E. P. K. Tsang. A Context for Constraint Satisfaction Problem Formulation Selection. Constraints, vol. 6, no. 4, pp. 299–327, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  21. T. Walsh. CSPLIB: A Benchmark Library for Constraints, [Online], Available: http://www.csplib.org/.

  22. A. Abbas, E. P. K. Tsang. Software Engineering Aspects of Constraint-based Timetabling — A Case Study. Information & Software Technology Journal, vol. 46, no. 6, pp. 359–372, 2004.

    Article  Google Scholar 

  23. R. Fourer. Hooking a Constraint Programming Solver to an Algebraic Modeling Language. In the 3rd International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Ashford, Kent, UK, 2001.

  24. J. E. Borrett. Formulation Selection for Constraint Satisfaction Problems: A Heuristic Approach, Ph.D. dissertation, Department of Computer Science, The University of Essex, UK, 1998.

    Google Scholar 

  25. P. Dasgupta, P. P. Chakrabarti, A. Dey, S. Ghose, W. Bibel. Solving Constraint Optimization Problems from CLP-style Specifications Using Heuristic Search Techniques. IEEE Transactions on Knowledge and Data Engineering Archive, vol. 14, no. 2, pp. 353–368, 2002.

    Article  MATH  Google Scholar 

  26. F. Laburthe, Y. Caseau. SALSA: A Language for Search Algorithms. Constraints, vol. 7, no. 3–4, pp. 255–288, 2002.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Balamand, P. O. Box 100, Tripoli, Lebanon

    Abdulwahed M. Abbas

  2. Department of Computing and Electronic Systems, The University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK

    Edward P. K. Tsang

  3. Department of Computer Science, The American University of Beirut, P. O. Box: 11-0236, Riad El-Solh, Beirut, Lebanon

    Ahmad H. Nasri

Authors
  1. Abdulwahed M. Abbas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edward P. K. Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmad H. Nasri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdulwahed M. Abbas.

Additional information

This work was supported by Lebanese National Council for Scientific Research.

Abdulwahed M. Abbas received his B. Sc. degree in pure mathematics from the Lebanese University in Beirut, Lebanon, in 1979, the M. Sc. degree in computer studies from the University of Essex, UK, in 1982, and the Ph.D. degree in computer science from Queen Mary College, London, UK, in 1987. He spent six years teaching computer science at the University of Queensland, Australia. He helped found the Department of Computer Science at the University of Balamand, Lebanon, where he currently is an associate professor.

His research interests include computer aided geometric design (CAGD), constraint satisfaction problems (CSP), and scheduling and programming languages.

Edward P. K. Tsang is a professor in computer science at University of Essex, UK. He is also the deputy director of the Center for Computational Finance and Economic Agents (CCFEA), and a founding member of the Center for Computational Intelligence at the University of Essex, UK.

He has broad interest in business application of artificial intelligence including computational finance, computational economics and constraint satisfaction. His main techniques used including heuristic search, optimization, and evolutionary computation.

Ahmad H. Nasri is a professor in computer graphics and chair of the Computer Science Department, American University of Beirut, Lebanon. He received his B. Sc. degree in mathematics from the Lebanese University, Lebanon, in 1978, a qualifying degree in computer science from the University of Essex, UK, in 1982, and the Ph.D. degree in computer graphics from the University of East Anglia, UK, in 1985. He was a research visitor at MIT, Arizona State University, USA, Purdue University, USA, Brigham Young University, USA, Seoul National University, Korea, Cambridge University, UK, City Hong Kong University, PRC, and Bremen University, Germany. He is a member of the board of directors of the Lebanese National Council for Scientific Research. He is also on the editorial board of the International Journal of CAD/CAM, Journal of Shape Modeling, Computer-Aided Design and Applications Journal, and Lebanese Scientific Journal. He has served on the PC committee of several international conferences. With Malcolm Sabin, he co-edited a special issue of the Journal of Visual Computer on subdivision surfaces, in 2002. Since 1982, he has been involved in promoting subdivision surfaces and its use in computer graphics, geometric modeling, and animation.

His research interests include recursive subdivision in animation, computer graphics, geometric modeling, data visualization, and the use of computer graphics in education and digital arts.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abbas, A.M., Tsang, E.P.K. & Nasri, A.H. DEPICT: A high-level formal language for modeling constraint satisfaction problems. Int. J. Autom. Comput. 5, 208–216 (2008). https://doi.org/10.1007/s11633-008-0208-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11633-008-0208-7

Keywords

Search

Navigation