.png){kind=icon}
.png){kind=icon}
Return
Logic programming for combinatorial problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-009-9150-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview of applied combinatorial problems in various domains is given. Such computationally hard and popular combinatorial problems as the traveling salesman problem are discussed to illustrate the usefulness of the logic programming approach. Detailed discussions of implementation of combinatorial problems with time complexity analyses are presented in Prolog, the standard language of logic programming. These programs can be easily integrated into other systems to implement logic programming in combinatorics.
Keywords:
Intelligent combinatorics
Logic programming
Permutations and combinations
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W