Publications in the year   2005 · 2004 · 2003 · 2002 · 2001 · 2000 · 1999 · 1998 · 1997 · 1996 · 1995

• Klaus Varrentrapp:
  A Practical Framework for Adaptive Metaheuristics,
  PhD thesis, Fachgebiet Intellektik, Fachbereich Informatik,
  Technische Universität Darmstadt, Darmstadt, Germany, 2005. [PDF]
  (EPDA - Elektronische Publikationen Darmstadt: [PDF])

• Klaus Varrentrapp:
  GAILS: Guided Adaptive Iterated Local Search - Method and Framework,
  Technical Report AIDA-04-05, Fachgebiet Intellektik, Fachbereich Informatik, TU Darmstadt, Germany, 2004. [PDF][PS]


• Holger Hoos and Thomas Stützle
  Stochastic Local Search-Foundations and Applications, Morgan Kaufmann, San Francisco, CA, USA, 2004.
  
  
• Marco Dorigo and Thomas Stützle
  Ant Colony Optimization, MIT Press, Cambridge, MA, USA, 2004.
  
  
• Tommaso Schiavinotto and Thomas Stützle The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms. To appear in Journal of Mathematical Modelling and Algorithms, 2004.
  
  
• Luis Paquete and Thomas Stützle A Study of Stochastic Local Search Algorithms for the Biobjective QAP with Correlated Flow Matrices. To appear in European Journal of Operational Research, 2004.
  
  
• Manuel Lopez-Ibanez, Luis Paquete and Thomas Stützle.
  On the Design of ACO for the Biobjective Quadratic Assignment Problem. To appear in M. Dorigo, L. Gambardella, F. Mondada, T. Stützle, M. Birratari, and C. Blum, editor, ANTS'2004, Fourth Internatinal Workshop on Ant Algorithms and Swarm Intelligence, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, 2004.
  
  
• Lucas Lessing, Irina Dumitrescu and Thomas Stützle.
  A Comparison between ACO Algorithms for the Set Covering Problem. To appear in M. Dorigo, L. Gambardella, F. Mondada, T. Stützle, M. Birratari, and C. Blum, editor, ANTS'2004, Fourth Internatinal Workshop on Ant Algorithms and Swarm Intelligence, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, 2004.
  
  
• Thomas Stützle and Susana Fernandes.
  New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms. In J. Gottlieb und G. Raidl, editor, Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, volume 3004 in Lecture Notes in Computer Science, Seiten 199--209, Springer Verlag, Berlin, Germany, 2004.
  
  
• Luis Paquete, Marco Chiarandini, and Thomas Stützle.
  Pareto Local Optima Sets in the Bi-objective Traveling Salesman Problem: An Experimental Study. In X. Gandibleux, M. Sevaux, K. Sön und V. T'kindt, editor, Metaheuristics for Multiobjective Optimisation, volume 535 in Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, 2004.
  
  

• Tommaso Schiavinotto and Thomas Stützle.
  Search Space Analysis of the Linear Ordering Problem. In S. Cagnoni and J. J. Romero Cardalda and D. W. Corne and J. Gottlieb and A. Guillot and E. Hart and C. G. Johnson and E. Marchiori and J.-A. Meyera and M. Middendorf and G. R. Raidl, editors, Applications of Evolutionary Computing, volume 2611 in Lecture Notes in Computer Science, Springer Verlag, pp. 322--333, 2003.
  
  
• Irina Dumitrescu and Thomas Stützle.
  Combinations of Local Search and Exact Algorithms. In S. Cagnoni and J. J. Romero Cardalda and D. W. Corne and J. Gottlieb and A. Guillot and E. Hart and C. G. Johnson and E. Marchiori and J.-A. Meyera and M. Middendorf and G. R. Raidl, editors, Applications of Evolutionary Computing, volume 2611 in Lecture Notes in Computer Science, Springer Verlag, pp. 211--223, 2003.
  
  
• Luis Paquete and Thomas Stützle.
  A Two-Phase Local Search for the Biobjective Traveling Salesman Problem. In C. Fonseca, P. Fleming, E. Zitzler, K. Deb, and L. Thiele, editors, Proceedings of the Evolutionary Multi-criterion Optimization (EMO 2003), volume 2632 of Lecture Notes in Computer Sience, pages 479-493. Springer Verlag, 2003.
  
  
• Marco Chiarandini, Irina Dumitrescu and Thomas Stützle:
  Local search for the colouring graph problem. A computational study. Technical Report AIDA-03-01, FG Intellektik, TU Darmstadt, January 2003.
  
  
• Olivia Rossi-Doria, Michael Samples, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Gambardella, Joshua Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luis Paquete and Thomas Stützle.
  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In E. Burke und P. De Causmaecker, editor, Practice and Theory of Automated Timetabling IV, volume 2740 in Lecture Notes in Computer Science, Seiten 329--351, Springer Verlag, Berlin, Germany, 2003.
  
  
• Kevin Smith und Holger H. Hoos und Thomas Stützle.
  Iterated Robust Tabu Search for MAX-SAT. In Y. Xiang und B. Chaib-draa, editor, Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, volume 2671 in Lecture Notes in Computer Science, Seiten 129--144, Springer Verlag, Berlin, Germany, 2003.
  
  
• Michael Pavlin, Holger H. Hoos, und Thomas Stützle.
  Stochastic Search for Multiprocessor Scheduling. In Y. Xiang und B. Chaib-draa, editor, Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, volume 2671 in Lecture Notes in Computer Science, Seiten 96--113, Springer Verlag, Berlin, Germany, 2003.
  
  
• Klaus Varrentrapp, Jürgen Henge-Ernst:
  TefoA - Testbed for Algorithms,
  Technical Report AIDA-03-10, Fachgebiet Intellektik, Fachbereich Informatik, TU Darmstadt, Germany, 2003. [PDF][PS.GZ]

• Helena Ramalhino Lourenco, Olivier Martin, and Thomas Stützle:
  Iterated Local Search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, 321-353, Kluwer Academic Publishers, Norwell, MA, 2002.
  
  
• Marco Dorigo and Thomas Stützle:
  The Ant Colony Optimization Metaheuristic: Algorithms, Applications and Advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, 251-285, Kluwer Academic Publishers, Norwell, MA, 2002.
  
  
• Steffen Lange and Gunter Grieser.
  On the power of incremental learning. Theoretical Computer Science, 288:277-307, 2002. (gzipped postscript file)
  
  
• Gunter Grieser.
  Selbsteinschätzende Lernverfahren: Möglichkeiten und Grenzen. Number 259 in DISKI. Akademische Verlags-Gesellschaft, Berlin, 2002. Dissertation.
  
  
• Gunter Grieser, Klaus P. Jantke, and Steffen Lange.
  Conceptualization to develop machine learning techniques for information extraction: Consistency queries. In Gabriella Kokai and Jens Zeidler, editors, GI-Fachgruppentreffen Maschinelles Lernen, Tagungsbericht, pages 4-12. Learning Lab Lower Saxonia, 2002.
  
  
• Gunter Grieser, Klaus P. Jantke, and Steffen Lange.
  Consistency queries in information extraction. In Nicolo Cesa-Bianchi, Masayuki Numao, and Rüdiger Reischuk, editors, Proc. 13th International Conference on Algorithmic Learning Theory, number 2533 in Lecture Notes in Artificial Intelligence, pages 173-187. Springer-Verlag, 2002. (gzipped postscript file)
  
  
• Gunter Grieser.
  Reflective inductive inference of recursive functions. In Nicolo Cesa-Bianchi, Masayuki Numao, and Rüdiger Reischuk, editors, Proc. 13th International Conference on Algorithmic Learning Theory, number 2533 in Lecture Notes in Artificial Intelligence, pages 203-217. Springer-Verlag, 2002. (gzipped postscript file)
  
  
• Gunter Grieser.
  Towards reflection in incremental machine learning. In Thierry Vidal and Paolo Liberatore, editors, Proc. First STarting Artificial Intelligence Researchers Symposium, volume 78 of Frontiers in Artificial Intelligence and Applications, pages 105-106. IOS-Press, 2002. (pdf file)
  
  
• Peter Grigoriev, Sergei Kuznetsov, Sergei Obiedkov and Sergey Yevtushenko.
  On a version of Mill's method of difference. In Proceedings of the ECAI'02 Workshop on Advances in Formal Concept Analysis for Knowledge Discovery in Databases, pages 26-31, Lyon, France, 2002.
  
  
• Peter Grigoriev and Sergey Yevtushenko.
  JSM reasoning as a data mining tool (in russian). In Proceedings of the 8th Russian National Conference on Artificial Intelligence (CAI-2002) pages 112-122. PhysMathLit, Moscow, Russia, 2002.
  
  
• Peter Grigoriev and Sergey Yevtushenko.
  On a data mining system based on JSM reasoning and formal concept analysis (in russian). Artificial Intelligence, Journal of the National Academy of Sciences of Ukraine, Institute of Artificial Intelligence, 79-87, 2002.
  
  
• Thomas Stützle and Marco Dorigo
  A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation, 6(4):358-365, 2002.
  
  
• Oscar Cordon, Francisco Herrera, and Thomas Stützle
  Guest Editorial: "Ant Colony Optimization" Mathware and Soft Computing, 9(2-3):137-139, 2002.
  
  
• Oscar Cordon, Francisco Herrera, and Thomas Stützle
  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends. Mathware and Soft Computing, 9(2-3):141-175, 2002.
  
  
• Klaus Varrentrapp, Thomas Thomas Stützle and Vittorio Maniezzo:
  The Long Term Car Pooling Problem - On the Soundness of the Problem Formulation and Proof of NP-completeness,
  Technical Report AIDA-02-03, Fachgebiet Intellektik, Fachbereich Informatik, TU Darmstadt, Germany, 2002. [PDF][PS]
  
  
• Klaus Varrentrapp, Ulrich Scholz and Patrick Duchstein
  Design of a Testbed for Planning Systems. In Proceedings of the AIPS'02 Workshop on Knowledge Engeneering Tools and Techniques for AI Planning, Toulouse, France, pp. 51-58, 2002. [PDF][PS]
  
  
• Wolfgang Bibel
  Time for Thinking Big in AI. In Festschrift in Honor of Jörg Siekmann, LNAI, Springer, Berlin, in print, 2002.
  
  
• Dilip Kumar Pratihar and Wolfgang Bibel
  Time-Optimal, Collision-Free Path Planning for Multiple Cooperating Robots Using a Genetic Fuzzy System, Submitted, 2002.
  
  
• Dilip Kumar Pratihar and Wolfgang Bibel
  Path Planning for Cooperating Robots Using a GA-Fuzzy Approach , LNAI, Vol.2466, Springer, Berlin, pp. 193-210, 2002.
  
  
• Wolfgang Bibel
  Bedeutung und Ursprünge der Intellektik. KI 1-02, S.51,2002.
  
  
• Wolfgang Bibel
  Ein Vierteljahrhundert Künstliche Intelligenz in Deutschland - Rückblick und Zukunftsperspektiven. KI 1-02, S.43, 2002.
  
  
• Wolfgang Bibel
  Welche Qualifikation erwartet die Universität von den Abiturienten. Elternbrief Nr. 128, Ausgabe 2.2002, Hessischer Elternverein e.V., S., 2002.
  
  
• Jens Otten and Wolfgang Bibel
  leanCoP: Lean Workshop on First-Order Theorem Proving. Journal of Symbolic Computation (to appear)
  
  
• Marco Chiarandini and Thomas Stützle:
  An Application of Iterated Local Search to Graph Coloring Problem. In D.S. Johnson, A. Mehrotra and M. Trick, editors, Proceedings of the Computational Symposium on Graph Coloring and its Generalizations,pp. 112-125, 2002.
  
  
• Luis Paquete, Marco Chiarandini, Thomas Stützle:
  A Study of Local Optima in the Biobjective Travelling Salesman Problem. Accepted to the Multiobjective Metaheuristics Workshop (MOMH). 2002. [postscript]
  
  
• Thomas Stützle and Sebastion Linke:
  Experiments with Variants of Ant Algorithms. Mathware & Soft Computing, 9(2-3):193-207, 2002.
  
  
• Thomas Stützle and Sebastion Linke:
  Experiments with Variants of Ant Algorithms. Proceedings of the First Spanish Congress on Evolutionary and Bio-inspired Algorithms (AEB'02), pp. 253--259, 2002.
  
  
• Marco Chiarandini and Thomas Stützle.
  An Experimental Analysis of Metaheuristics for Course Timetabling. Technical Report AIDA-02-04, FG Intellektik, TU Darmstadt, 2002. [postscript]
  
  
• O. Rossi-Doria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, L. M. Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, and T. Stützle.
  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In E. Burke and P. Causmaecker, editors, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002). [postscript]
  
  
• Luis Paquete and Thomas Stützle:
  Empirical Analysis of Tabu Search for the Lexicographic Optimization of the Examination Timetabling Problem. In E. Burke and P. Causmaecker, editors, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002). Also avilable as Technical Report AIDA-02-02.
  
  
• Mauro Birattari, Thomas Stützle, Luis Paquete and Klaus Varrentrapp :
  A Racing Algorithm for Configuring Metaheuristics. In W. Langdon et al., editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 11-18. Morgan Kaufmann Publishers, 2002. [PDF][PS]
  Also available as Technical Report AIDA-02-01. [PDF][PS]
  
  
• Marco Dorigo, Luca Gambardella, Martin Middendorf and Thomas Stützle:
  Guest Editorial "Special Section on Ant Colony Optimization". IEEE Transactions to Evolutionary Computation, 6(4):385-365, 2002
  
  
• Luis Paquete and Thomas Stützle:
  An Experimental Investigation of Iterated Local Search for Coloring Graphs. In S. Cagnoni et al., editors, Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2002 , Lecture Notes in Computer Science 2279, pages 122-131, Springer Verlag. Also available as Technical Report AIDA-01-04.
  
  
• Markus Finger and Thomas Stützle and Helena Lourenco:
  Exploiting Fitness Distance Correlation of Set Covering Problems. In S. Gagnoni, J. Gottlieb, E. Hart, M. Middendorf and G.R. Raidl, editors, Applications of Evolutionary Computing, Lecture Notes in Computer Science 2279, pages 61-71, Springer Verlag. Also available as Technical Report AIDA-01-03.
  
  

• Gunter Grieser.
  Selbsteinschätzende Lernverfahren: Möglichkeiten und Grenzen. PhD thesis, Technische Universität Darmstadt, Fachbereich Informatik, December 2001. Published as DISKI #259. (gzipped postscript file)
  
  
• Steffen Lange, Gunter Grieser, and Klaus P. Jantke.
  Extending elementary formal systems. In Naoki Abe, Roni Khardon, and Thomas Zeugmann, editors, Proc. 12th International Conference on Algorithmic Learning Theory, volume 2225 of Lecture Notes in Artificial Intelligence, pages 332-347. Springer-Verlag, 2001. (gzipped postscript file)
  
  
• Gunter Grieser and Steffen Lange.
  Learning approaches to wrapper induction. In Ingrid Russell and John Kolen, editors, Proc. 14th International FLAIRS Conference, pages 249-253. AAAI-Press, 2001. (gzipped postscript file)
  
  
• Thomas Stützle and Holger Hoos
  Analyzing the Run-time Behaviour of Iterated Local Search for the Travelling Salesman Problem. In P. Hansen and C. Ribeiro, editors, Essays and Surveys on Metaheuristics, Kluwer Academic Publishers, 2001. (This is a strongly extended version of of the 1999' short abstract published at MIC'99)
  
  
• Thomas Stützle and Holger Hoos
  Ameisenalgorithmen zur Lösung Kombinatorischer Optimierungsprobleme. Künstliche Intelligenz, pp. 45-51, 2001 (in german).
  
  
• Wolfgang Bibel
  Alles klar? Logisch! Leserbrief in Die Ziet Nr. 41 vom 4.10.01, S.20 (zu Artikeln von John R. Searle).
  
  
• Wolfgang Bibel
  Stellungnahme zum Lehrplan Mathematik. Elternbrief Nr. 125, Ausgabe 2.2001, Hessischer Elternverein e.V., S. 6--7, 2001.
  
  
• Gunter Grieser and Wolfgang Bibel
  Maschinelles Lernen und Automatische Reflexion. Thema Forschung 1, pp. 96--101, 2001.
  
  
• Thomas Stützle and Holger Hoos and Andrea Roli:
  A review of the literature on local search algorithms for MAX-SAT. Technical Report AIDA-01-02, Intellectics Group, Darmstadt University of Technology, Germany, 2001.
  
  
• Thomas Stützle and Marco Dorigo:
  Local Search and Metaheuristics for the Quadratic Assignment Problem. Technical Report AIDA-01-01, Intellectics Group, Darmstadt University of Technology, Germany, 2001.
  
  
• Mauro Birrattari and Luis Paquete and Thomas Stützle and Klaus Varrentrapp:
  Classification of Metaheuristics and Design of Experiments for the Analysis of Components. Technical Report AIDA-01-05, Intellectics Group, Darmstadt University of Technology, Germany, 2001. [PDF][PS]
  
  
• Thomas Stützle and Marco Dorigo
  An Experimental Study of the Simple Ant Colony Optimization Algorithm. In Proceedings of the, 2001 WSES International Conference on Evolutionary Computalution Computation (EC'01), WSES-Press International, 2001.
  
  
• Helena Ramalhino Lourenco, Olivier Martin, and Thomas Stützle:
  A Beginner's Introduction to Iterated Local Search. In Proceedings of MIC 2001, pages 1-6, Porto, Portugal, July 2001.
  
  
• Matthijs den Besten and Thomas Stützle:
  Neighborhoods revisited: An Experimental Investigation into the Effectiveness of Variable Neighborhood Descent for Scheduling. In Proceedings of MIC 2001, pages 545-550, Porto, Portugal, July 2001.
  
  
• Matthijs den Besten, Thomas Stützle, and Marco Dorigo
  Configuration of Iterated Local Search: An Example Application to the Single Machine Total Weighted Tardiness Problem. In .W. Egbert Boers, J. Gottlieb, P.L. Lanzi, R.E. Smith, S. Cagnoni, E. Hart, G.R. Raidl and H. Tijink, E. Hart et al, editors, Applications of Evolutionary Computing, LNCS, Springer Verlag, pages 441-451, 2001.
  Also available as Tech.Rep. AIDA-00-07, Intellectics Group, Darmstadt University of Technology, Germany
  
  

• Volker Dötsch, Gunter Grieser, Klaus P. Jantke, and Steffen Lange.
  Formal concepts of learning systems validation in use. In Jim Etheredge and Bill Manaris, editors, Proc. 13th International FLAIRS Conference, pages 319-324. AAAI-Press, 2000.(gzipped postscript file)
  
  
• Gunter Grieser, Klaus P. Jantke, Steffen Lange, and Bernd Thomas.
  A unifying approach to HTML wrapper representation and learning. In S. Arikawa and S. Morishita, editors, Proc. 3rd International Conference on Discovery Science, number 1967 in Lecture Notes in Artificial Intelligence, pages 50-64. Springer-Verlag, 2000. (gzipped postscript file)
  
  
• Gunter Grieser, Steffen Lange, and Thomas Zeugmann.
  Learning recursive concepts with anomalies. In H. Arimura, S. Jain, and A. Sharma, editors, Proc. 11th International Conference on Algorithmic Learning Theory , number 1968 in Lecture Notes in Artificial Intelligence, pages 101-115. Springer-Verlag, 2000. (gzipped postscript file)
  
  
• Volker Dötsch, Gunter Grieser, Klaus P. Jantke, and Steffen Lange.
  Formal concepts of learning systems validation in use. In Jim Etheredge and Bill Manaris, editors, Proc. 13th International FLAIRS Conference , pages 319-324. AAAI-Press, 2000. (gzipped postscript file)
  
  
• Matthijs den Besten, Thomas Stützle, and Marco Dorigo
  Ant Colony Optimization for the Total Weighted Tardiness Problem. To appear in Proc. of PPSN-VI, 2000.
  Also available as Tech.Rep.IRIDIA/99-16, Université Libre de Bruxelles, Belgium(gzipped postscript file, 101k)
  
  
• Holger H. Hoos and Thomas Stützle:
  Local Search Algorithms for SAT: An Empirical Evaluation. To appear in Journal of Automated Reasoning, (Special Issue of the Journal of Automated Reasoning SAT 2000). 2000
  
  
• Holger H. Hoos and Thomas Stützle:
  SATLIB: An Online Resource for Research on SAT. In Ian Gent, Hans van Maaren, and Toby Walsh, editors, SAT'2000IOS Press. 2000.(gzipped postscript file, 34k)
  
  
• Jens Otten and Wolfgang Bibel
  leanCoP: Lean Connection-Based Theorem Proving.. Technical Report AIDA-00-03.Intellectics Group, Darmstadt University of Technology, Germany, 2000
  
  
• Ulrich Scholz
  Extracting State Constraints from PDDL-like Planning Domains Technical Report AIDA-00-02.Intellectics Group, Darmstadt University of Technology, Germany, 2000. (gzipped postscript file, 46k)
  
  
• Thomas Stützle and Holger H. Hoos
  MAX-MIN Ant System. Future Generation Computer Systems Journal. 16(8):889-914, 2000.
  A preliminary version is available (gzipped postscript file, 206k)
  
  
• Thomas Stützle, Andreas Grün, Sebastian Linke, and Marco Rüttger
  A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem. To appear in Proc. of PPSN-VI, 2000.
  Also available as Technical Report AIDA-00-01, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 46k)
  
  

• Uwe Egly and Stephan Schmitt.
  On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis. Fundamenta Informaticae, Special Issue: Symbolic Computation and Artificial Intelligence, 39(1-2):59-83, 1999.
  Also available as Technical Report AIDA-99-02, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 112k)
  
  
• Gunter Grieser.
  Auf dem Weg zum inkrementellen Lernen von Entscheidungsbäumen mittels Hypothesenbewertungen. In P. Perner, editor, Proc. GI-Fachgruppentreffen Maschinelles Lernen, pages 90-99, 1999.
  
  
• Holger H. Hoos and Thomas Stützle.
  Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. Artificial Intelligence 112:213-232, 1999.
  
  
• Holger H. Hoos and Thomas Stützle.
  Systematic versus Local Search. In W. Burgard, T. Christaller and A. B. Cremers, editors, KI-99: Advances in Artificial Intelligence, Vol. 1701 in Lecture Notes in Artificial Intelligence, pages 289-293, Springer Verlag, Berlin, 1999. (© Springer Verlag) (gzipped postscript file, 26k)
  
  
• Holger H. Hoos and Thomas Stützle.
  On the Empirical Evaluation of Las Vegas Algorithms. In Proceedings of the IJCAI'99 Workshop on Empirical AI, Stockholm, Sweden, 1999.
  
  
• Christoph Kreitz and Jens Otten.
  Connection-based Theorem Proving in Classical and Non-classical Logics. Journal of Universal Computer Science, Special Issue on Integration of Deduction Systems, 5(3):88-112, 1999.
  Also available as Technical Report AIDA-99-05, Darmstadt University of Technology, Computer Science Department, Intellectics Group, Germany. (gzipped postscript file, 111k)
  
  
• Steffen Lange and Gunter Grieser.
  On the Strength of Incremental Learning. In O. Watanabe and T. Yokomori, editors, Proc. 10th International Conference on Algorithmic Learning Theory (ALT'99), Vol. 1720 in Lecture Notes in Artificial Intelligence, pages 118-131, Springer Verlag, Berlin, 1999. (© Springer Verlag)
  
  
• Steffen Lange and Gunter Grieser.
  Iterative Concept Learning from Noisy Data. Technical Report AIDA-99-01, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (gzipped postscript file, 199k)
  
  
• Heiko Mantel and Jens Otten.
  linTAP: A Tableau Prover for Linear Logic. In N. Murray, editor, International Conference on Analytic Tableaux and Related Methods, Vol. 1617 in Lecture Notes in Artificial Intelligence, pages 217-231, Springer Verlag, 1999. (© Springer Verlag)
  Also available as Technical Report AIDA-99-04, Darmstadt University of Technology, Computer Science Department, Intellectics Group, Germany. (gzipped postscript file, 111k)
  
  
• Thomas Stützle and Marco Dorigo.
  ACO Algorithms for the Traveling Salesman Problem. In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periaux, editors, Evolutionary Algorithms in Engineering and Computer Science, pages 163-183, John Wiley & Sons, Chichester, UK, 1999.
  Also available as Technical Report IRIDIA/99-3, Université Libre de Bruxelles, Belgium (gzipped postscript file, 133k)
  
  
• Thomas Stützle and Marco Dorigo.
  ACO Algorithms for the Quadratic Assignment Problem. In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization, pages 33-50, McGraw-Hill, London, UK, 1999.
  Also available as Tech.Rep.IRIDIA/99-2, Université Libre de Bruxelles, Belgium (gzipped postscript file, 156k)
  
  
• Thomas Stützle and Holger Hoos.
  The MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Combinatorial Global Optimization In S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, pages 313-329, 1999.
  Preliminary version available as (gzipped postscript file, 67k)
  
  
• Thomas Stützle.
  Iterated Local Search for the Quadratic Assignment Problem. Technical Report AIDA-99-03, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (submitted) (gzipped postscript file, 198k)
  
  

• Wolfgang Bibel.
  Let's Plan It Deductively! Artificial Intelligence, 103(1-2)):183-208, 1998.
  A preliminary version is available as Technical Report AIDA-97-05, Intellectics Group, Darmstadt University of Technology, Germany (zipped postscript file, 145k)
  
  
• W. Bibel and P.H. Schmitt (Editors).
  Automated Deduction - A Basis for Applications.
  Vol. I: Foundations - Calculi and Methods.
  Vol. II: Systems and Implementation Techniques.
  Vol. III: Applications.
  Kluwer, Dordrecht, 1998.
  
  
• W. Bibel, S. Brüning, J. Otten, T. Rath, T. Schaub.
  Compressions and Extensions. In W. Bibel and P. Schmitt, editors, Automated Deduction -- A Basis for Applications, pages 238-245. Kluwer, Dordrecht, 1998.
  Also available as Technical Report AIDA-98-05, Intellectics Group, Darmstadt University of Technology, Germany
  
  
• W. Bibel, D. Korn, C. Kreitz, F. Kurucz, J. Otten, S. Schmitt, G. Stolpmann.
  A Multi-Level Approach to Program Synthesis. In N. Fuchs, editor, 7th International Workshop on Logic Program Synthesis and Transformation, Band 1463 in LNCS, pages 1-27. Springer Verlag, 1998.
  Also available as Technical Report AIDA-97-08, Intellectics Group, Darmstadt University of Technology, Germany (zipped postscript file, 156k)
  
  
• W. Bibel.
  DFG Schwerpunktprogramm ``Deduktion''. KI 4-98, pages:38-40, 1998.
  
  
• R.I. Brafman, H.H. Hoos and C. Boutilier.
  LPSP - A Linear, Plan-Level Stochastic Planner. In Proceedings of the 17th Workshop of the UK Planning and Scheduling Special Interest Group, 1998.
  
  
• P. Dasgupta, P.P. Chakrabarti, A. Dey, S. Ghose and W. Bibel.
  A Heuristic Search Approach to Effectively Solve Constrained Optimization Problems from Logical Specifications. In Proceedings of the International Conference on Knowledge Based Computer Systems, 1998.
  
  
• U. Egly and S. Schmitt.
  Intuitionistic Proof Transformations and their Application to Constructive Program Synthesis. In J. Calmet and J. Plaza, editors, Proceedings of the 4th International Conference on Artificial Intelligence and Symbolic Computation, Band 1476 in LNAI, pages 132-144. Springer Verlag, Berlin, 1998.
  
  
• G. Grieser, K.P. Jantke and S. Lange.
  Towards the Validation of Inductive Learning Systems. In M.M. Richter, C.H. Smith, R. Wiehagen and T. Zeugmann, editors, Proceedings of the 9th International Workshop on Algorithmic Learning Theory, (ALT'98), Band 1501 in LNAI, pages 409-423. Springer Verlag, Berlin, 1998.
  
  
• G. Grieser.
  Validation of Internet Agents - Setting the Stage for a Case Study. In W.S. Wittig and G. Grieser, editors, Leipziger Informatiktage (LIT'98), pages 85-90, 1998.
  
  
• G. Grieser, K.P. Jantke and S. Lange.
  Towards TCS Concepts for Characterizing Expertise in Learning Systems Validation. In K. Iwama, editor, Algorithms and Theory of Computing, Band 1041 in RIMS Kokyuroku, pages 103-110, 1998.
  
  
• G. Grieser, K.P. Jantke and S. Lange.
  Characterizing Sufficient Expertise for Learning System Validation. In Diane J. Cook, editor, Proceedings of the 11th International FLAIRS Conference, pages 452-456. AAAI Press, Menlo Park, 1998.
  
  
• Holger H. Hoos and Thomas Stützle:
  Evaluating Las Vegas Algorithms - Pitfalls and Remedies. In Proc. of UAI-98, pages 238-245. Morgan Kaufmann Publishers, 1998. (gzipped postscript file, 62k)
  
  
• Holger H. Hoos and Thomas Stützle:
  Some Surprising Regularities in the Behaviour of Stochastic Local Search. (Poster summary, Proceedings of CP-98, p.470)
  (postscript file, 34k
  
  
• Holger H. Hoos and Thomas Stützle:
  A Characterization the Run-Time Behavior of Stochastic Local Search. Technical Report AIDA-98-1 (gzipped postscript file, 77k)
  
  
• S. Lange and G. Grieser.
  On Variants of Iterative Learning. In S. Arikawa and H. Motoda, editors, Proceedings of the 1st International Conference on Discovery Science, (DS'98), Band 1532 in LNAI, pages 72-83. Springer Verlag, Berlin, 1998.
  
  
• S. Lange and G. Grieser.
  On Iterative Learning and Variants Thereof. In W.S. Wittig and G. Grieser, editors, Leipziger Informatiktage (LIT'98), pages 123-132, 1998.
  
  
• S. Schmitt and C. Kreitz.
  Deleting Redundancy in Proof Reconstruction. In H. de Swaart. editor, Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Band 1397 in LNAI, pages 262-276. Springer Verlag, Berlin, 1998.
  
  
• U. Scholz.
  Strategien zur Domänenanalyse. In J. Sauer and B. Stein, editors, Tagungsband zum 12. Workschop Planen und Konfigurieren (PuK'98), pages 17-22, 1998.
  
  
• Thomas Stützle
  Applying Iterated Local Search to the Permutation Flow Shop Problem. Technical Report AIDA-98-04, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (submitted) (gzipped postscript file, 98k)
  
  
• Thomas Stützle:
  Parallelization Strategies for Ant Colony Optimization., In A.E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of Parallel Problem Solving from Nature - PPSN-V, Amsterdam, Springer Verlag, Vol. 1498 of LNCS, pages 722-731, 1998. (© Springer Verlag) (gzipped postscript file, 36k)
  
  
• Thomas Stützle:
  An Ant Approach to the Flow Shop Problem, Proceedings of EUFIT'98, Verlag Mainz, Aachen, pages 1560-1564, 1998.
  Also available as Technical Report AIDA-97-07, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 23k)
  
  
• Thomas Stützle and Holger Hoos:
  Ameisenalgorithmen zur Lösung kombinatorischer Optimierungsprobleme. Leipziger Informatiktage (LIT'98), 1998. (in german) (gzipped postscript file, 59k)
  
  
• M. Thielscher.
  Reasoning About Actions: Steady Versus Stabilizing State Constraints. Artificial Intelligence, 104:3339-355, 1998.
  
  
• M. Thielscher.
  Towards State Update Axioms: Reifying Successor State Axioms. In L.F. del Cerro, J. Dix and U. Furbach, editors, Proceedings of JELIA, Band 1489 in LNAI, pages 248-263. Springer Verlag, Berlin, 1998.
  
  
• M. Thielscher.
  How (Not) To Minimize Events. In A.G. Cohn, L.K. Schubert and S.C. Shapiro, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 51-62. Morgan Kaufmann, 1998.
  
  

• W. Bibel and E. Eder.
  Decomposition of Tautologies into Regular Formulas and Strong Completeness of Connection-graph Resolution. Journal of the ACM, 44(2):320-344, 1997.
  
  
• W. Bibel.
  Let's Plan It Deductively! In M. Pollack (editor), Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-97), pages:1549-1562. Morgan Kaufmann, San Mateo, CA, 1997.
  
  
• W. Bibel.
  Deduction as a Cross-sectional Technology: The DFG Focus Programme on Deduction. In M. Jarke, K. Pasedach and K. Pohl (editor), Informatik'97, Informatik Aktuell, pages:29-40. Springer Verlag, Heidelberg, 1997.
  
  
• S.-E. Bornscheuer and M. Thielscher.
  Explicit and Implicit Indeterminism: Reasoning About Uncertain and Contradictory Specifications of Dynamic Systems. Journal of Logic Programming, 31(1-3):119-155, 1997.
  
  
• D. Gabbay, R. Nossum and M. Thielscher.
  Agents in Proactive Environments. In G. Brewka, C. Habel and B. Nebel (editor), Proceedings of the German Annual Conference on Artificial Intelligence (KI), Band 1303 aus LNAI, pages:389-392. Springer Verlag, Berlin, 1997.
  
  
• C. Herrmann.
  Symbolical Reasoning about Numerical Data: A Hybrid Approach. Applied Intelligence, 7(4):317-364, 1997.
  Also available as Technical Report AIDA-95-12, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 126k)
  
  
• C. Herrmann, F. Reine and A. Strohmaier (editor).
  Knowledge Representation in Neural Networks. Logos-Verlag, Berlin, 1997.
  
  
• C. Herrmann.
  Competetive Learning: A Many-fold Paradigm. In H.-J. Zimmermann (editor), European Congress on Fuzzy and Intelligent Technologies (EUFIT), pages:1719-1723. Wissenschaftsverlag Mainz, 1997.
  
  
• C. Herrmann.
  Wavelet-networks for EEG-analysis. In H.-J. Zimmermann (editor), European Congress on Fuzzy and Intelligent Technologies (EUFIT), pages:443-447. Wissenschaftsverlag Mainz, 1997.
  
  
• C. Herrmann.
  Fuzzy Logic as Interfacing Technique in Hybrid AI-Systems. In T. Martin and A.L. Ralescu (editor), Fuzzy Logic in Artificial Intelligence: Towards Intelligent Systems, Band 1188 in LNAI, pages:69-80. Springer Verlag, Berlin, 1997.
  
  
• C. Herrmann.
  Logical Formulae Networks. In F. Maire, R. Hayward and J. Diederich (editor), Connectionist Systems for Knowledge Representation and Deduction, pages:43-64. Queensland University of Technology, 1997.
  
  
• Hesham Khalil.
  Possibility and Infinitary Nondeterminism in the Situation Calculus. Technical Report AIDA-97-06, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 86k)
  
  
• C. Kreitz, H. Mantel, J. Otten and S. Schmitt.
  Connection-based Proof Construction in Linear Logic. In W. McCune (editor), 14th International Conference on Automated Deduction, Band 1249 aus LNAI, pages:207-221. Springer Verlag, Berlin, 1997.
  Also available as Technical Report AIDA-96-17, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 141k)
  
  
• D. Korn and C. Kreitz.
  Deciding Intuitionistic Propositional Logic via Translation into Classical Logic. In W. McCune (editor), 14th International Conference on Automated Deduction, Band 1249 aus LNAI, pages:131-145. Springer Verlag, Berlin, 1997.
  Also available as Technical Report AIDA-96-10, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 105k)
  
  
• J. Otten.
  ileanTAP: An Intuitionistic Theorem Prover. In D. Galmiche (editor), Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Band 1227 aus LNAI, pages:307-312. Springer Verlag, Berlin, 1997.
  Also available as Technical Report AIDA-96-18, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 109k)
  
  
• J. Otten.
  On the Advantage of a Non-Clausal Davis-Putnam Procedure. Technical Report AIDA-97-01, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 80k)
  
  
• U. Scholz.
  Restraining and Complete Refinement Planning. Technical Report AIDA-97-09, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 71k)
  
  
• A. Strohmaier.
  Multi-Flip Networks: Parallelizing GenSAT. In G. Brewka, C. Habel and B. Nebel (editor), Proceedings of the German Annual Conference on Artificial Intelligence (KI), Band 1303 aus LNAI, pages:349-360. Springer Verlag, Berlin, 1997.
  Also available as Technical Report AIDA-96-08, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 87k)
  
  
• Olaf Steinmann, Antje Strohmeier and Thomas Stützle:
  Tabu Search vs. Random Walk KI-97: Advances in Artificial Intelligence, Springer Verlag, LNCS, Vol. 1303. (gzipped postscript file, 49k)
  
  
• Thomas Stützle:
  Lokale Suchverfahren für Constraint Satisfaction Probleme: Die min-conflicts Heuristik und Tabu Search. Künstliche Intelligenz, 1/97, pp. 14-20, 1997. - in german, a preliminary version is available
  
  
• Thomas Stützle:
  MAX-MIN Ant System for the Quadratic Assignment Problem. Technical Report AIDA-97-04, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (gzipped postscript file, 92k)
  
  
• Thomas Stützle and Holger Hoos:
  The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem. In T. Baeck and Z. Michalewicz and X. Yao, editors, Proceedings of the IEEE International Conference on Evolutionary Computation, April 13-16, Indianapolis, Indiana, USA. pp.308-313, 1997. (gzipped postscript file, 54k)
  
  
• Thomas Stützle and Holger Hoos:
  Improvements on the Ant System: Introducing the MAX-MIN Ant System. In G.D. Smith, N.C. Steele and R.F. Albrecht, editors, Proceedings of Artificial Neural Nets and Genetic Algorithms 1997. Springer Verlag Wien, pp.245-249, 1998. (gzipped postscript file, 43k)
  
  
• M. Thielscher.
  Ramification and Causality. Artificial Intelligence, 89(1-2):317-364, 1997.
  
  
• M. Thielscher.
  Qualified Ramifications. In B. Kuipers and B. Webber (editor), Proceedings of the 15th AAAI National Conference on Artificial Intelligence, pages 466-471. MIT Press, 1997.
  
  
• M. Thielscher.
  Causality and the Qualification Problem. In L.C. Aiello, J. Doyle and S. Shapiro (editor), Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages:51-62. Morgan Kaufmann, 1997.
  
  
• M. Thielscher.
  Challenges for Action Theories (Extended Abstract). In I. Plander (editor), Proceedings of the International Conference on Artificial Intelligence and Information-Control Systems of Robots (AIICSR), pages 133-140. World Scientific Publishing Co. Singapore, 1997.
  
  

• W. Bibel and M. Thielscher.
  Non-Classical Automated Deduction. In R. Albrecht and H. Herre (editor), Trends in Theoretical Informatics, pages:39-59. Oldenbourg, 1996.
  
  
• W. Bibel, D. Korn, C. Kreitz and S. Schmitt.
  Problem-Oriented Applications of Automated Theorem Proving. In J. Calmet and C. Limongelli (editor), Design and Implementation of Symbolic Computation Systems, Band 1128 aus LNCS, pages:1-21. Springer Verlag, 1996.
  Also available as Technical Report AIDA-96-15, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 121k)
  
  
• Georg Bol, Edgar Hotz and Thomas Stützle:
  Neuronale Netze zur Klassifikation von Fehlern in der statistischen Prozessregulierung. In H. Czap, P. Jaenecke and H.P. Ohly, editors, Analogie in der Wissensrepräsentation: Case-Based Reasoning und räumliche Modelle), Trier, Germany. Reihe Fortschritte in der Wissensrepräsentation, Vol 4, INDEKS Verlag, pp. 186-199, 1996.
  
  
• S.-E. Bornscheuer and M. Thielscher.
  Representing Concurrent Actions and Solving Conflicts. Journal of the Interest Group in Pure and Applied Logics (IGPL), 4(3):355-368, 1996. Special issue of the ESPRIT project MEDLAR.
  
  
• Jason Brown and Lincoln Wallen.
  Representing Unification in a Logical Framework. Technical Report AIDA-96-06, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 121k)
  
  
• K. Eder, S. Hölldobler and M. Thielscher.
  An Abstract Machine for Reasoning about Situations, Actions, and Causality. In R. Dyckhoff, H. Herre and P. Schroeder-Heister (editor), Proceedings of the International Workshop on Extensions of Logic Programming (ELP), Band 1050 aus LNAI, Seite 137-151, 1996. Springer Verlag, 1996.
  
  
• U. Egly and T. Rath.
  On the Practical Value of Different Definitional Translations to Normal Form. In M. McRobbie and J. Slaney (editor), 13th International Conference on Automated Deduction, Band 1104 aus LNAI, pages:403-417, Springer Verlag, 1996.
  
  
• S.K. Halgamuge, C.S. Herrmann and L. Jain.
  Analysis of EEG Signals with Wavelets and Knowledge Engineering Techniques. In S. Amari, L. Xu, L.-W. Chan, I. King and K.-S. Leung (editor), Progress in Neural Information Systems, International Conference on Neural Information Processing (ICONIP'96), pages:1381-1386. Springer Verlag, 1996.
  
  
• Steffen Hölldobler and Michael Thielscher.
  Properties vs. Resources: Solving Simple Frame Problems. Technical Report AIDA-96-03, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 94k)
  
  
• G. Große, C.S. Herrmann and E. Sandner.
  SEdit - Graphically Validating Technical Systems. In D.M. Gabbay and H.J. Ohlbach (editor), Practical Reasoning: Proceedings of the International Conference on Formal and Applied Practical Reasoning (FAPR'96), Band 1085 aus LNAI, pages:345-348. Springer Verlag, 1996.
  
  
• C.S. Herrmann, F. Reine and A. Strohmaier.
  Wissensrepräsentation in neuronalen Netzen. In M. Thielscher and S.-E. Bornscheuer (editor), Fortschritte der Künstlichen Intelligenz, Seite 25. Dresden University Press, 1996.
  
  
• C.S. Herrmann and M. Thielscher.
  Reasoning about Continuous Processes. In B. Clancey and D. Weld (editor), Proceedings of the AAAI National Conference on Artificial Intelligence, pages:639-644, Portland, OR, August 1996. MIT Press.
  
  
• C.S. Herrmann and F. Reine.
  Wavelet Transform as Feature Extraction for Medical Diagnosis of EEGs. In International Symposium on Soft Computing for Industry, pages:313-318. TSI-Press, 1996.
  
  
• Holger H. Hoos.
  Solving Hard Combinatorial Problems with GSAT - A Case Study. In KI-96: Advances in Artifial Intelligence, 1996. Band 1137 aus LNAI, pages:107-119. Springer Verlag, 1996.
  
  
• Holger H. Hoos and Thomas Stützle:
  A Characterization of GSAT's Performance on a Class of Hard Structured Problems.Technical Report AIDA-96-20
  (compressed postscript file, 102k)
  
  
• C. Kreitz, K.-K. Lau, and M. Ornahi.
  Formal Reasoning about Modules, Reuse, and their Correctness. In D. Gabbay and H.-J. Ohlbach (editor), International Conference on Formal and Applied Practical Reasoning, Band 1085 aus LNAI, pages:384-398, Springer Verlag, 1996.
  Also available as Technical Report AIDA-96-16, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 100k)
  
  
• J. Otten and C. Kreitz.
  A Uniform Proof Procedure for Classical and Non-classical Logics. In G. Görz and S. Hölldobler (editor), KI-96: Advances in Artificial Intelligence, Band 1137 aus LNAI, pages:307-319. Springer Verlag, 1996.
  Also available as Technical Report AIDA-96-02, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 115k)
  
  
• J. Otten and C. Kreitz.
  T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. In P. Miglioli, U. Moscato, D. Mandici and M. Ornaghi (editor), 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Band 1071 aus LNAI, pages:244-260, Springer Verlag, 1996.
  Also available as Technical Report AIDA-95-09, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 112k)
  
  
• J. Otten, C. Kreitz and S. Schmitt.
  Guiding Program Development Systems by a Connection Based Proof Strategy. In M. Proietti (editor), 5th International Workshop on Logic Program Synthesis and Transformation, Band 1048 aus LNCS, pages:137-151, Springer Verlag, 1996.
  Also available as Technical Report AIDA-95-08, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 112k)
  
  
• Enno Sandner.
  On Matrix Characterizations for Propositional Substructural Logics. Technical Report AIDA-96-16, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 82k)
  
  
• Torsten Schaub and Michael Thielscher.
  Skeptical Query-Answering in Constrained Default Logic. In D. M. Gabbay (editor), Proceedings of the International Conference on Formal and Applied Practical Reasoning (FAPR'96), Band 1085 aus LNAI, pages:567-581. Springer Verlag, 1996.
  
  
• S. Schmitt and C. Kreitz.
  On converting Non-classical Matrix Proofs into Sequent-Style Systems. In M. McRobbie and J. Slaney (editor), 13th International Conference on Automated Deduction, Band 1104 aus LNAI, pages:418-432, Springer Verlag, 1996.
  Also available as Technical Report AIDA-96-01, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 200k)
  
  
• L. Schuster, C.S. Herrmann, H.P. Hundemer and H.C. Hopf.
  Automatic Focus Detection in Digital EEG by a Knowledge-Based System. (European Congress on Clinical Neurophysiology), International Journal on Electroencephalography and Clinical Neurophysiology, 99(4):317, 1996.
  
  
• A. Strohmaier.
  Parallele lokale Suchverfahren. In M. Thielscher and S.-E. Bornscheuer (editor), Fortschritte der Künstlichen Intelligenz, Seite 31. Dresden University Press, 1996.
  
  
• Ute Cornelia Sigmund and Thomas Stützle:
  About Planning under Uncertainty in Dynamic Systems: Exploiting Probabilistic Information. Workshop Notes of the AAAI Spring Symposium on Planning with Incomplete Information, pp. 107-109.
  
  
• Thomas Stützle and Holger Hoos:
  Improvements on the Ant System: A detailed Report on MAX-MIN Ant System. Technical Report AIDA-96-12 - Revised version , Darmstadt University of Technology, Computer Science Department, Intellectics Group.
  (gzipped postscript file, 194k)
  
  
• M. Thielscher.
  On the Completeness of SLDENF-Resolution. Journal of Automated Reasoning, 17(2):199-214, 1996.
  
  
• M. Thielscher and S.-E. Bornscheuer (editor).
  Fortschritte der Künstlichen Intelligenz. Dresden University Press, 1996.
  
  
• M. Thielscher.
  A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs. In M. Maher (editor), Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), pages:483-497. MIT Press, 1996.
  Also available as Technical Report AIDA-96-09, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 109k)
  
  
• M. Thielscher.
  Causality and the Qualification Problem. In L. C. Aiello, J. Doyle and S. Shapiro (editor), Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages:51-62. Morgan Kaufmann, 1996.
  
  
• Akihiro Yamamoto.
  Representing Improving Theories for Inductive Logic Programming Systems with Ground Reduced Programs. Technical Report AIDA-96-19, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 72k)
  
  

• W. Bibel.
  Dimensionen der Inferenz -- Die andere Basis wissensbasierter Systeme. In F. di Primio, editor, Methoden der Künstlichen Intelligenz für Grafikanwendungen, pages 3-22. Addison-Wesley, 1995.
  
  
• W. Bibel, S. Brüning, U. Egly, D. Korn and T. Rath.
  Issues in Theorem Proving Based on the Connection Method. In P. Baumgartner, R. Hähnle and J. Posegga, editor, Proceedings of the 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Band 918 aus LNAI, pages 1-16. Springer Verlag, 1995.
  
  
• U. Egly.
  Super-Polynomial Speed-Ups in Proof Length by New Tautologies. In C. Pinto-Ferreira and N.J. Mamede, editor, Proceedings of the Portuguese Conference on Artificial Intelligence (EPIA), pages 29-40. Springer Verlag, 1995.
  
  
• U. Egly and T. Rath.
  The Halting Problem: An Automatically Generated Proof. AAR Newsletter, 30:10-16, 1995.
  
  
• Karin Genther.
  Repräsentation von Konnektionsbeweisen in Gentzen-Kalkülen durch Transformation und Strukturierung. Technical Report AIDA-95-11, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 520k)
  
  
• C.S. Herrmann.
  A Hybrid Fuzzy-neural Expert System for Diagnosis. In C.S. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 494-500, Montreal, Canada, August 1995. Morgan Kaufman.
  Also available as Technical Report AIDA-95-02, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 76k)
  
  
• C.S. Herrmann, S.K. Halgamuge and M. Glesner.
  Comparison of Fuzzy Rule Based Classification with Neural Network Approaches for Medical Diagnosis. In H.-J. Zimmermann, editor, European Congress on Fuzzy and Intelligent Technologies (EUFIT), pages 1664-1667, 1995.
  
  
• Christoph S.Herrmann and Frank Reine.
  Considering Adequateness in Neural Network Learning. Technical Report AIDA-95-07, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 70k)
  
  
• C.S. Herrmann and A. Strohmaier.
  Bericht über die KIFS 95. Künstliche Intelligenz, 3:79-80, 1995.
  
  
• C.S. Herrmann.
  A Fuzzy Neural Network for Detecting Graphoelements in EEGs. In H.J. Herrmann, D.E. Wolf and E. Pöppel, editor, Supercomputers in Brain Research: From Tomography to Neural Networks, pages 193-198. World Scientific Publishing Company, 1995.
  
  
• S. Hölldobler and M. Thielscher.
  Computing Change and Specificity with Equational Logic Programs. Annals of Mathematics and Artificial Intelligence, 14(1):99-133, 1995.
  
  
• Christoph Kreitz, Kung-Kiu Lau and Mario Ornaghi.
  Logical Foundations for Declarative Object-oriented Programming. Technical Report AIDA-95-14, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 212k)
  
  
• Matthias Lindner.
  Interactive Planning for the Assistance of Human Agents. Technical Report AIDA-95-03, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 82k)
  
  
• J. Otten and C. Kreitz.
  A Connection Based Proof Method for Intuitionistic Logic. In P. Baumgartner, R. Hähnle and J. Posegga, editor, Proceedings of the 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Band 918 aus LNAI, pages 122-137. Springer Verlag, 1995.
  
  
• J. Pfalzgraf, U.C. Sigmund and K. Stokkermans,
  Modeling Cooperative Agents Scenarios by Deductive Planning Methods and Logical Fiberings. In J. Calmet and J.A. Campbell, editor, Proceedings of the Second International Conference on Artificial Intelligence and Symbolic Mathematical Computing, Band 958 aus LNCS, pages 167-190. Springer Verlag, 1995.
  
  
• S. Schmitt and C. Kreitz.
  On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs. In P. Baumgartner, R. Hähnle and J. Posegga, editor, Proceedings of the 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Band 918 aus LNAI, pages 106-121. Springer Verlag, 1995.
  
  
• Thomas Stützle:
  A Neural Network Approach to Quality Control Charts. In J. Mira and F. Sandoval, editors, Proceedings of the International Workshop on Artificial Neural Networks (IWANN'95), Torremolinos, Spain. Lecture Notes in Computer Science Vol. 930, Springer Verlag pp. 1135-1141, 1995. (postscript file, 147k)
  
  
• M. Thielscher and Torsten Schaub.
  Default Reasoning by Deductive Planning. Journal of Automated Reasoning, 15(1):1-40, 1995.
  
  
• M. Thielscher.
  The Logic of Dynamic Systems. In C. S. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1956-1962, Montreal, Canada, August 1995. Morgan Kaufmann.
  
  
• M. Thielscher.
  Computing Ramifications by Postprocessing. In C. S. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 1994-2000, Montreal, Canada, August 1995. Morgan Kaufmann.
  
  
• M. Thielscher.
  What is a Skeptical Proof? In I. Wachsmuth, C.-R. Rollinger and W. Brauer, editor, Proceedings of the German Annual Conference on Artificial Intelligence (KI), Band 981 aus LNAI, pages 161-172. Springer, 1995.
  
  
• Andre de Waal and M. Thielscher.
  Solving Deductive Planning Problems Using Program Analysis and Transformation. In M. Proietti, editor, Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR), LNCS. Springer, September 1995.
  Also available as Technical Report AIDA-95-04, Intellectics Group, Darmstadt University of Technology, Germany (gzipped postscript file, 105k)
  
  
• Andre de Waal.
  Lukasiewicz Problems: Experiments Using Program Analysis and Transformation. Technical Report AIDA-95-05, Darmstadt University of Technology, Computer Science Department, Intellectics Group. (zipped postscript file, 92k)