Programming of Algorithms of Matrix-Represented Constraints Satisfaction by Means of Choco Library
The paper proposes an original approach to solving the problem of ineffective processing of qualitative constraints of a subject domain in the framework of constraint programming technology. The approach is based on the use of specialized matrix-like structures, providing a “compressed” representation of constraints over finite domains, as well as using author’s inference algorithms on these structures. The paper presents practical aspects of implementation of user-developed types of constraints and corresponding algorithms-propagators with the help of constraint programming libraries. The algorithms performance has been assessed to clearly demonstrate the advantages of representation and processing of qualitative constraints of a subject domain by means of the above matrix structures.
KeywordsConstraint satisfaction problem Constraint programming Matrix-like representation of constraints Qualitative constraints
- 1.Zuenko, A.: Matrix-like structures for representation and processing of constraints over finite domains. In: Proceedings of the Intelligent Information Technologies for Industry 2018 (IITI 2018) (2018)Google Scholar
- 2.Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Upper Saddle River (2010)Google Scholar
- 5.Zakrevskij, A.: Integrated model of inductive-deductive inference based on finite predicates and implicative regularities. In: Naidenova, X., Ignatov, D.(eds.) Diagnostic Test Approaches to Machine Learning and Commonsense Reasoning Systems, pp. 1–12. IGI Global, Hershey (2013). https://doi.org/10.4018/978-1-4666-1900-5.ch001
- 6.Choco Documentation. http://www.choco-solver.org. Accessed 20 Feb 2018