Logic programming for combinatorial problems

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.

[1]  Toshinori Munakata.  Notes on implementing fuzzy sets in Prolog , 1998, Fuzzy Sets Syst..

[2]  O. J. Murphy,et al.  Graph theoretic algorithms for the PLA folding problem , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Andrew S. Tanenbaum,et al.  Structured computer organization; (2nd ed.) , 1984 .

[4]  Hideo Ogawa.  Labeled point pattern matching by Delaunay triangulation and maximal cliques , 1986, Pattern Recognit..

[5]  Fred S. Roberts,et al.  Applied Combinatorics , 1984 .

[6]  Yuanyuan Yang,et al.  Routing permutations on optical baseline networks with node-disjoint paths , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[7]  Annalisa Massini,et al.  All-to-all Personalized Communication on Multistage Interconnection Networks , 2003, Discret. Appl. Math..

[8]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[9]  Yoshiyasu Takefuji,et al.  Neural network parallel computing , 1992, The Kluwer international series in engineering and computer science.

[10]  Toshinori Munakata,et al.  Fundamentals of the new artificial intelligence - beyond traditional paradigms , 2001, Graduate texts in computer science.

[11]  Ivan Bratko,et al.  Prolog Programming for Artificial Intelligence , 1986 .

[12]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[13]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[14]  Raúl E. Valdés-Pérez,et al.  Discovery tools for science apps , 1999, Commun. ACM.

[15]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[16]  Ivan Bratko,et al.  Prolog (3rd ed.): programming for artificial intelligence , 2000 .

[17]  Dinesh Bhatia,et al.  Resource requirements and layouts for field programmable interconnection chips , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[18]  Byung Ro Moon,et al.  Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP , 2002, IEEE Trans. Evol. Comput..

[19]  N. Matsumoto,et al.  Simple approach to TSP by permutation of six cities and deletion of crossover , 1999, 1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368).

[20]  T. U. Van Le,et al.  Techniques of Prolog Programming with Implementation of Logical Negation and Quantified Goals , 1992 .

[21]  R. Doerge,et al.  Permutation tests for multiple loci affecting a quantitative character. , 1996, Genetics.

[22]  Andrew S. Tanenbaum,et al.  Structured Computer Organization , 1976 .

[23]  Michael B. Eisen,et al.  Visualizing associations between genome sequences and gene expression data using genome-mean expression profiles , 2001, ISMB.

[24]  Radia J. Perlman,et al.  Network security - private communication in a public world , 2002, Prentice Hall series in computer networking and distributed systems.

[25]  Stephen Muggleton,et al.  Scientific knowledge discovery using inductive logic programming , 1999, Commun. ACM.

[26]  Grzegorz Rozenberg,et al.  Structures in Logic and Computer Science , 1997, Lecture Notes in Computer Science.

[27]  Parimal Pal Chaudhuri,et al.  Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[28]  C. V. Ramamoorthy.  Review of Structured computer organization by Andrew S. Tanenbaum. Prentice-Hall 1976 , 1978, CARN.

[29]  Andrew Tanenbaum,et al.  Structured computer organization (5. ed.) , 2006 .

[30]  Adam C. Siepel.  An Algorithm to Enumerate Sorting Reversals for Signed Permutations , 2003, J. Comput. Biol..

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  Adam Kapralski.  New Methods for the Generation of Permutations, Combinations, and Other Combinatorial Objects in Parallel , 1993, J. Parallel Distributed Comput..

[33]  Radu Horaud,et al.  Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[34]  A. Kumar Verma,et al.  Reliability-based optimal task-allocation in distributed-database management systems , 1997 .

[35]  Toshinori Munakata.  Notes on implementing sets in Prolog , 1992, CACM.

[36]  Shahram Etemadi Borujeni,et al.  Speech encryption based on fast Fourier transform permutation , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[37]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..