Gert Smolka: Publications

Gert Smolka: Publications

Saarland University Computer Science




Slides of Recent Talks



The following list was last updated in 2000. Go here for recent publications.

Edited Books

  1. Gert Smolka (editor), Programming Languages and Systems, Lecture Notes in Computer Science, Volume 1782, Springer Verlag, Berlin, 2000.
  2. Gert Smolka (editor), Principles and Practice of Constraint Programming---CP97. Lecture Notes in Computer Science, Volume 1330, Springer Verlag, Berlin, 1997.

Edited Special Issues of Journals

  1. Gert Smolka (guest editor), Selected Papers of the European Symposium on Programming (ESOP'2000) Nordic Journal of Computing, Vol. 7, No. 4, Winter 2000.
  2. Gert Smolka (guest editor), Special Issue on CP97. Constraints, an International Journal, Vol. 5, No. 1-2, January 2000.
  3. Gert Smolka (guest editor), Special Issue on Order-sorted Rewriting. Journal of Symbolic Computation, Vol. 25, No. 4, April 1998.

Articles in Journals

  1. Seif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, and Gert Smolka. Efficient Logic Variables for Distributed Computing. ACM Transactions on Programming Languages and Systems, Vol. 21, No. 3, May 1999, Pages 569-626.
  2. Peter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, and Ralf Scheidhauer. Efficient Logic Variables for Distributed Computing. ACM Transactions on Programming Languages and Systems, Vol. 19, No. 5, September 1997, Pages 804-851.
  3. Andreas Podelski and Gert Smolka. Situated Simplification. Theoretical Computer Science, 173:209-233, February 1997.
  4. Gert Smolka. Constraints in Oz. ACM Computing Surveys, Vol. 28, No. 4es (Dec. 1996), Article 75 (Article in Electronic Section of Issue 4).
  5. Martin Müller and Gert Smolka. Oz: Nebenläufige Programmierung mit Constraints. KI - Künstliche Intelligenz, Themenheft Logische Programmierung. pages 55-61, September 1996.
  6. Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Theoretical Computer Science, 146(1-2):243-268, July 1995.
  7. Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229-258, April 1994.
  8. Hassan Aït-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263-283, January 1994.
  9. Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, and Gert Smolka. On the expressivity of feature logics with negation, functional uncertainty, and sort equations. Journal of Logic, Language and Information, 2:1-18, 1993.
  10. Gert Smolka. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51-87, 1992.
  11. Manfred Schmidt-Schauß and Gert Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1-26, 1991.
  12. José Meseguer, Joseph A. Goguen, and Gert Smolka. Order-sorted unification. Journal of Symbolic Computation , 8:383-413, 1989.
  13. Werner Nutt, Pierre Réty, and Gert Smolka. Basic narrowing revisited. Journal of Symbolic Computation, 7:295-317, 1989.
  14. Gert Smolka and Hassan Aït-Kaci. Inheritance hierarchies: Semantics and unification. Journal of Symbolic Computation, 7:343-370, 1989.

Chapters in Books

  1. Gert Smolka. The Oz Programming Model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol 1000, pages 324-343. Springer-Verlag, Berlin, 1995.
  2. Gert Smolka. The Definition of Kernel Oz. In Maurice Nivat and Andreas Podelski, editors, Constraints: Basics and Trends, Lecture Notes in Computer Science, vol. 910, pages 251-292. Springer-Verlag, Berlin, 1995.
  3. Martin Henz, Gert Smolka, and Jörg Würtz. Object-oriented concurrent constraint programming in Oz. In V. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming, chapter 2, pages 29-48. The MIT Press, Cambridge, MA, 1995.
  4. Gert Smolka. Residuation and guarded rules for constraint logic programming. In Frédéric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming: Selected Research, chapter 22, pages 405-419. The MIT Press, Cambridge, MA, 1993.
  5. Bernhard Nebel and Gert Smolka. Attributive description formalisms and the rest of the world. In O. Herzog and C.-R. Rollinger, editors, Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lectures Notes in Artificial Intelligence, vol. 546, pages 439-452. Springer-Verlag, Berlin, 1991.
  6. Bernhard Nebel and Gert Smolka. Representation and reasoning with attributive descriptions. In K.H. Blasius, U.Hedtstuck, and C.-R. Rollinger, editors, Sorts and Types in Artificial Intelligence, Lectures Notes in Artificial Intelligence, vol. 418, pages 112-139. Springer-Verlag, Berlin, 1990.
  7. G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-Sorted Equational Computation. In Hassan Aït-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2, Rewriting Techniques, chapter 10, pages 297-367. Academic Press, New York, 1989.
  8. Gert Smolka. Fresh: A higher-order language with unification and multiple results. In Doug DeGroot and Gary Lindstrom, editors, Logic Programming: Relations, Functions, and Equations, pages 469-524. Prentice-Hall, Englewood Cliffs, N.J., 1986.

Articles in Proceedings

  1. Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, and Stefan Thater. A Relational Syntax-Semantics Interface Based on Dependency Grammar. In: Proceedings of the 20th International Conference on Computational Linguistics (COLING 2004), Geneva, Switzerland, 2004.
  2. Gert Smolka. Concurrent Constraint Programming Based on Functional Programming. In Chris Hankin, editor, Programming Languages and Systems, Lecture Notes in Computer Science, vol. 1381, Springer-Verlag, Berlin, 1998.
  3. Seif Haridi, Peter Van Roy, and Gert Smolka. An Overview of the Design of Distributed Oz. In Proceedings of the Second International Symposium on Parallel Symbolic Computation (PASCO '97), pages 176-187, ACM Press, 1997.
  4. Andreas Podelski and Gert Smolka. Situated Simplification. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 976, pages 328-344, Springer-Verlag, Berlin, 1995.
  5. Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In Proceedings of the 1995 International Conference on Logic Programming, pages 449-463, The MIT Press, Cambridge, MA, 1995.
  6. Christian Schulte and Gert Smolka. Encapsulated search in higher-order concurrent constraint programming. In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 505-520, The MIT Press, Cambridge, MA, 1994.
  7. Christian Schulte, Gert Smolka, and Jörg Würtz. Encapsulated search and constraint programming in Oz. In A.H. Borning, editor, Second Workshop on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, pages 134-150, Springer-Verlag, Berlin, 1994.
  8. Gert Smolka. A foundation for higher-order concurrent constraint programming. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 50-72, Springer-Verlag, Berlin, 1994.
  9. Joachim Niehren and Gert Smolka. A confluent calculus for higher-order concurrent constraint programming. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 89-104, Springer-Verlag, Berlin, 1994.
  10. Andreas Hense and Gert Smolka. A record calculus with principal types. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 219-236, Springer-Verlag, Berlin, 1994.
  11. Martin Henz, Gert Smolka, and Jörg Würtz. Oz--a programming language for multiagent systems. In Ruzena Bajcsy, editor, 13th International Joint Conference on Artificial Intelligence, volume 1, pages 404-409, Morgan Kaufmann Publishers, 1993.
  12. Rolf Backofen and Gert Smolka. A complete and recursive feature theory. In 31th Annual Meeting of the Association for Computational Linguistics, pages 193-200. Association for Computational Linguistics, 1993.
  13. Gert Smolka and Ralf Treinen. Records for logic programming. In Krzysztof Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 240-254, The MIT Press, Cambridge, MA, 1992.
  14. Hassan Aït-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. In Proceedings of the International Conference on Fifth Generation Computer Systems, volume 2, pages 1012-1021, Tokyo, Japan, 1-5 June, 1992. Institute for New Generation Computer Technology, 1992.
  15. Gert Smolka. Logic programming with polymorphically order-sorted types. In J. Grabowski, P. Lescanne, and W. Wechler, editors, Algebraic and Logic Programming, Lecture Notes in Computer Science, vol. 845, pages 53-70, Springer-Verlag, Berlin, 1988.
  16. Gert Smolka. Making control and data flow in logic programs explicit. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 311-322, Austin, Texas, August 1984.
  17. Gert Smolka. Completeness of the connection graph proof procedure for unit-refutable clause sets. In Proceedings of the 6th German Workshop on Artificial Intelligence, Informatik Fachberichte 58, pages 191-204, Springer-Verlag, Berlin, 1982.
  18. K. Bläsius, N. Eisinger, J. Siekmann, G. Smolka, A. Herold, and Chr. Walther. The Markgraf Karl refutation procedure (Fall 1981). In Proceedings of the 7th International Joint Conference on Artificial Intelligence, pages 511-518, Vancouver, 1981.
  19. N. Eisinger, J. Siekmann, G. Smolka, E. Unvericht, and C. Walther. Das Karlsruher Beweissystem. In 10. Jahrestagung der GI, volume 33 of Informatik Fachberichte,
  20. J. Siekmann and G. Smolka. Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure. In Proceedings of the 5th German Workshop on Artificial Intelligence, Informatik Fachberichte, pages 199-200, Springer-Verlag, Berlin, 1980.
  21. N. Eisinger, J. Siekmann, G. Smolka, E. Unvericht, and C. Walther. Das Karlsruher Beweissystem. In 10. Jahrestagung der GI, volume 33 of Informatik Fachberichte, pages 400-412. Springer-Verlag, Berlin, 1980.
  22. N. Eisinger, J. Siekmann, G. Smolka, E. Unvericht, and C. Walther. The Markgraf Karl refutation procedure. In Proceedings of the Conference of the European Society for Artificial Intelligence and Simulation of Behavior. Amsterdam, Netherlands, June 1980.

Doctoral Thesis

Gert Smolka. Logic Programming over Polymorphically Order-Sorted Types. Dissertation, Universität Kaiserslautern, February 1989.

Diploma Thesis

Gert Smolka. Einige Ergebnisse zur Vollständigkeit der Beweisprozedur von Kowalski. Diplomarbeit, Universität Karlsruhe, July 1982.


Gert Smolka, Sat Aug 13 10:05:15 2011