| 2009 |
|---|
| 71 | EE | Mark Kaminski,
Gert Smolka:
Hybrid Tableaux for the Difference Modality.
Electr. Notes Theor. Comput. Sci. 231: 241-257 (2009) |
| 2008 |
|---|
| 70 | EE | Mark Kaminski,
Gert Smolka:
Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse.
IJCAR 2008: 210-225 |
| 2007 |
|---|
| 69 | EE | Moritz Hardt,
Gert Smolka:
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic.
Electr. Notes Theor. Comput. Sci. 174(6): 15-27 (2007) |
| 2006 |
|---|
| 68 | EE | Guido Tack,
Christian Schulte,
Gert Smolka:
Generating Propagators for Finite Set Constraints.
CP 2006: 575-589 |
| 67 | | Ralph Debusmann,
Gert Smolka:
Multi-Dimensional Dependency Grammar as Multigraph Description.
FLAIRS Conference 2006: 740-745 |
| 66 | EE | Guido Tack,
Leif Kornstaedt,
Gert Smolka:
Generic Pickling and Minimization.
Electr. Notes Theor. Comput. Sci. 148(2): 79-103 (2006) |
| 65 | EE | Joachim Niehren,
Jan Schwinghammer,
Gert Smolka:
A concurrent lambda calculus with futures.
Theor. Comput. Sci. 364(3): 338-356 (2006) |
| 2005 |
|---|
| 64 | EE | Joachim Niehren,
Jan Schwinghammer,
Gert Smolka:
A Concurrent Lambda Calculus with Futures.
FroCos 2005: 248-263 |
| 2004 |
|---|
| 63 | EE | Gert Smolka:
The Development of Oz and Mozart.
MOZ 2004: 1 |
| 62 | | Andreas Rossberg,
Didier Le Botlan,
Guido Tack,
Thorsten Brunklaus,
Gert Smolka:
Alice through the looking glass.
Trends in Functional Programming 2004: 79-95 |
| 2000 |
|---|
| 61 | | Gert Smolka:
Programming Languages and Systems, 9th European Symposium on Programming, ESOP 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings
Springer 2000 |
| 60 | | Gert Smolka:
Introduction.
Constraints 5(1/2): 5 (2000) |
| 59 | | Gert Smolka:
Guest Editor's Foreword.
Nord. J. Comput. 7(4): 257 (2000) |
| 1999 |
|---|
| 58 | EE | Seif Haridi,
Peter Van Roy,
Per Brand,
Michael Mehl,
Ralf Scheidhauer,
Gert Smolka:
Efficient logic variables for distributed computing.
ACM Trans. Program. Lang. Syst. 21(3): 569-626 (1999) |
| 1998 |
|---|
| 57 | EE | Gert Smolka:
Concurrent Constraint Programming Based on Functional Programming (Extended Abstract).
ESOP 1998: 1-11 |
| 1997 |
|---|
| 56 | | Gert Smolka:
Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, Proceedings
Springer 1997 |
| 55 | | Gert Smolka:
Constraint Programming in Oz (Abstract).
ILPS 1997: 37-38 |
| 54 | EE | Peter Van Roy,
Seif Haridi,
Per Brand,
Gert Smolka,
Michael Mehl,
Ralf Scheidhauer:
Mobile Objects in Distributed Oz.
ACM Trans. Program. Lang. Syst. 19(5): 804-851 (1997) |
| 53 | EE | Andreas Podelski,
Gert Smolka:
Situated Simplification.
Theor. Comput. Sci. 173(1): 235-252 (1997) |
| 1996 |
|---|
| 52 | | Gert Smolka:
The Oz Programming Language and System (Abstract).
ASIAN 1996: 377 |
| 51 | | Gert Smolka:
The Oz Programming Model.
JELIA 1996: 251 |
| 50 | | Gert Smolka:
Constraints in OZ.
ACM Comput. Surv. 28(4es): 75 (1996) |
| 49 | | Martin Müller,
Gert Smolka:
Oz: nebenläufige Programmierung mit Constraints.
KI 10(3): 55-61 (1996) |
| 1995 |
|---|
| 48 | | Andreas Podelski,
Gert Smolka:
Situated Simplification.
CP 1995: 328-344 |
| 47 | | Gert Smolka:
The Oz Programming Model (Extended Abstract).
Euro-Par 1995: 5-8 |
| 46 | | Gert Smolka:
Oz: Concurrent Constraint Programming for Real.
ICLP 1995: 13 |
| 45 | | Andreas Podelski,
Gert Smolka:
Operational Semantics of Constraint Logic Programs with Coroutining.
ICLP 1995: 449-463 |
| 44 | | Andreas Podelski,
Gert Smolka:
Situated Simplification.
ICLP 1995: 826 |
| 43 | | Gert Smolka:
Objects in a higher-order concurrent constraint model with state.
LMO 1995: 69-74 |
| 42 | | Gert Smolka:
The Oz Programming Model.
Computer Science Today 1995: 324-343 |
| 41 | EE | Rolf Backofen,
Gert Smolka:
A Complete and Recursive Feature Theory.
Theor. Comput. Sci. 146(1&2): 243-268 (1995) |
| 1994 |
|---|
| 40 | | Andreas V. Hense,
Gert Smolka:
A Record Calculus with Principal Types.
CCL 1994: 219-236 |
| 39 | | Gert Smolka:
A Foundation for Higher-order Concurrent Constraint Programming.
CCL 1994: 50-72 |
| 38 | | Joachim Niehren,
Gert Smolka:
A Confluent Relational Calculus for Higher-Order Programming with Constraints.
CCL 1994: 89-104 |
| 37 | | Gert Smolka:
The Definition of Kernel Oz
Constraint Programming 1994: 251-292 |
| 36 | | Christian Schulte,
Gert Smolka,
Jörg Würtz:
Encapsulated Search and Constraint Programming in Oz.
PPCP 1994: 134-150 |
| 35 | | Christian Schulte,
Gert Smolka:
Encapsulated Search for Higher-order Concurrent Constraint Programming.
SLP 1994: 505-520 |
| 34 | | Gert Smolka,
Ralf Treinen:
Records for Logic Programming.
J. Log. Program. 18(3): 229-258 (1994) |
| 33 | | Hassan Aït-Kaci,
Andreas Podelski,
Gert Smolka:
A Feature Constraint System for Logic Programming with Entailment.
Theor. Comput. Sci. 122(1&2): 263-283 (1994) |
| 1993 |
|---|
| 32 | | Rolf Backofen,
Gert Smolka:
A Complete and Recursive Feature Theory.
ACL 1993: 193-200 |
| 31 | | Martin Henz,
Gert Smolka,
Jörg Würtz:
Oz - A Programming Language for Multi-Agent Systems.
IJCAI 1993: 404-409 |
| 30 | | Gert Smolka,
Martin Henz,
Jörg Würtz:
Object-Oriented Concurrent Constraint Programming in Oz.
KI 1993: 44-59 |
| 29 | | Gert Smolka:
Nebenläfige Objekte und Logische Programmierung.
WLP 1993: 7-9 |
| 1992 |
|---|
| 28 | | Hassan Aït-Kaci,
Andreas Podelski,
Gert Smolka:
A Feature-Based Constraint System for Logic Programming with Entailment.
FGCS 1992: 1012-1021 |
| 27 | | Andreas V. Hense,
Gert Smolka:
A Verification of Extensible Record Types.
IWAR 1992: 137-164 |
| 26 | | Gert Smolka,
Ralf Treinen:
Records for Logic Programming.
JICSLP 1992: 240-254 |
| 25 | | Gert Smolka:
Feature-Constraint Logics for Unification Grammars.
J. Log. Program. 12(1&2): 51-87 (1992) |
| 1991 |
|---|
| 24 | | Bernhard Nebel,
Gert Smolka:
Attribute Description Formalisms ... and the Rest of the World.
Text Understanding in LILOG 1991: 439-452 |
| 23 | | Gert Smolka:
Residuation and Guarded Rules for Constraint Logic Programming.
WCLP 1991: 405-419 |
| 22 | | Manfred Schmidt-Schauß,
Gert Smolka:
Attributive Concept Descriptions with Complements.
Artif. Intell. 48(1): 1-26 (1991) |
| 1990 |
|---|
| 21 | | Jürgen Müller,
Franz Baader,
Bernhard Nebel,
Werner Nutt,
Gert Smolka:
Tutorial on Reasoning and Representation with Concept Languages.
CADE 1990: 681 |
| 1989 |
|---|
| 20 | | Daniel Hernández,
Bernhard Nebel,
Gert Smolka,
Ipke Wachsmuth:
Fachseminar: Formale und kognitive Grundlagen von Wissensrepräsentationen.
GWAI 1989: 476 |
| 19 | | Gert Smolka:
Feature-Logik.
GWAI 1989: 477-478 |
| 18 | | Bernhard Nebel,
Gert Smolka:
Representation and Reasoning with Attributive Descriptions.
Sorts and Types in Artificial Intelligence 1989: 112-139 |
| 17 | | Manfred Schmidt-Schauß,
Gert Smolka:
Attributive Concept Descriptions with Unions and Complements
IWBS Report 68: (1989) |
| 16 | | Bernhard Nebel,
Gert Smolka:
Representation and Reasoning with Attributive Descriptions
IWBS Report 81: (1989) |
| 15 | | Gert Smolka:
Feature Constraint Logics for Unification Grammars
IWBS Report 93: (1989) |
| 14 | | Werner Nutt,
Pierre Réty,
Gert Smolka:
Basic Narrowing Revisited.
J. Symb. Comput. 7(3/4): 295-317 (1989) |
| 13 | | Gert Smolka,
Hassan Aït-Kaci:
Inheritance Hierarchies: Semantics and Unification.
J. Symb. Comput. 7(3/4): 343-370 (1989) |
| 12 | | Gert Smolka:
Logic Programming over Polymorphically Order-Sorted Types.
Universität Kaiserslautern 1989 |
| 1988 |
|---|
| 11 | | Gert Smolka:
Type Logic.
ADT 1988 |
| 10 | | Gert Smolka:
Logic Programming with Polymorphically Order-Sorted Types.
ALP 1988: 53-70 |
| 9 | | Gert Smolka:
A Feature Logic with Subsorts
LILOG-Report 33: (1988) |
| 8 | | Markus Höhfeld,
Gert Smolka:
Definite Resolution over Constraint Languages
LILOG-Report 53: (1988) |
| 1986 |
|---|
| 7 | | Gert Smolka:
Polymorphic Order-Sorted Algebra.
ADT 1986 |
| 6 | | Gert Smolka:
FRESH: A Higher-Order Language With Unification and Multiple Results.
Logic Programming: Functions, Relations, and Equations 1986: 469-524 |
| 1984 |
|---|
| 5 | | Gert Smolka:
Making Control and Data Flow in Logic Programs Explicit.
LISP and Functional Programming 1984: 311-322 |
| 1982 |
|---|
| 4 | | Gert Smolka:
Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets.
GWAI 1982: 191-204 |
| 1981 |
|---|
| 3 | | Jörg H. Siekmann,
Gert Smolka:
Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure.
GWAI 1981: 199-200 |
| 2 | | Karl-Hans Bläsius,
Norbert Eisinger,
Jörg H. Siekmann,
Gert Smolka,
Alexander Herold,
Christoph Walther:
The Markgraf Karl Refutation Procedure.
IJCAI 1981: 511-518 |
| 1980 |
|---|
| 1 | | Norbert Eisinger,
Jörg H. Siekmann,
Gert Smolka,
E. Unvericht,
Christoph Walther:
Das Karlsruher Beweissystem.
GI Jahrestagung 1980: 400-412 |
