Answer set programming by ant colony optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2424 LNAI, Issue , 2002, Pages 481-492

  Nicolas, Pascal ^a   Saubion, Frédéric ^a   Stéphan, Igor ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; LOGIC PROGRAMMING; PROGRAM DIAGNOSTICS; TRAVELING SALESMAN PROBLEM;

ANSWER SET PROGRAMMING; COLLECTIVE BEHAVIOR; COMBINATORIAL PROBLEM; GRAPH COLORINGS; LOGIC PROGRAMS; META HEURISTICS; NON-MONOTONIC REASONING; QUADRATIC ASSIGNMENT;

ARTIFICIAL INTELLIGENCE;

EID: 85099426446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45757-7_40     Document Type: Conference Paper

References (19)

1. Gerhard Brewka and Jürgen Dix. Knowledge Representation with Logic Programs. In J. Dix, L. Pereira, and T. Przymusinski, editors, Logic Programming and Knowledge Representation, volume 1471 of LNAI, pages 1-55. Springer Verlag, 1998.
2. B. Bullnheimer, R. Hartl, and C. Strauss. A new rank based version of the ant system - a computational study. Central European Journal of Operations Research, 7(1):25-38, 1999.
3. P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczyński. Computing with default logic. Artificial Intelligence, 112:105-146, 1999.
4. D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. Mac Graw Hill, 1999.
5. M. Dorigo, E. Bonabeau, and G. Theraulaz. Ant algorithms and stimergy. Future Generation Computer Systems, 16:851-871, 2000.
6. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative problem solving using the dlv system. In J Minker, editor, Logic Based AI, pages 79-103. Kluwer Academic Publishers, 2000.
7. T. Eiter and G. Gottlob. Complexity results for disjunctive logic programming and application to nonmonotonic logics. In D. Miller, editor, ILP Symposium, pages 266-278. MIT Press, 1993.
8. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth Bowen, editors, Proceedings of the International Conference on Logic Programming, pages 1070-1080. The MIT Press, 1988.
9. M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 1991.
10. N. Leone, S. Perri, and P. Rullo. Local search techniques for disjunctive logic programs. In E. Lamma and P. Mello, editors, AI*IA'99: Advances in Artificial Intelligence, number 1792 in LNAI, pages 107-118. Springer, 2000.
11. Th. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the IJCAI, pages 641-645. Morgan Kaufmann Publishers, 2001.
12. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38(3):588-619, 1991.
13. R. Mercer, L. Forget, and V. Risch. Comparing a pair-wise compatibility heuristic and relaxed stratification: Some preliminary results. In S. Benferhat and P. Besnard, editors, Proceedings of ECSQARU, volume 2143 of LNCS, pages 580-591. Springer Verlag, 2001.
14. P. Nicolas, F. Saubion, and I. Stéphan. GADEL : a genetic algorithm to compute default logic extensions. In Proceedings of the European Conference on Artificial Intelligence, pages 484-488, 2000.
15. P. Nicolas, F. Saubion, and I. Stéphan. New generation systems for non-monotonic reasoning. In T. Eiter, M. Truszczynski, and W. Faber, editors, International Conference on Logic Programming and NonMonotonic Reasoning, LNCS, pages 309-321, 2001.
16. th International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA, 2000.
17. A. Provetti and L. Tari. Answer sets computation by genetic algorithms. In Genetic and Evolutionary Computation Conference, pages 303-308, 2000.
18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81-132, 1980.
19. T. Stützle and Holger H. Hoos. Max-min ant system. Future Generation Computer systems, 16(8):889-914, 2000.