Publication at Faculty of Mathematics and Physics |
2006
Abstract
This paper presents a new intelligent computing approach for combinatorics problems by incorporating logic programming. Permutations, one of the most common and basic topics in combinatorics, appear in many problems in science, engineering, and business.
Applications of permutations and other combinatorics problems are briefly reviewed. Implementation of permutations is presented in Prolog, the standard language of logic programming.
Time complexity analysis and experimental results of running the program are also discussed. The program is optimal in terms of the order of its complexity.
Applications of the technique to various domains as well as to specific problems such as the traveling salesman are discussed.