Gert Smolka

Christian Doczkal, Gert Smolka: Constructive Completeness for Modal Logic with Transitive Closure. CPP 2012: 224-239

Mark Kaminski, Gert Smolka: Correctness of an Incremental and Worst-Case Optimal Decision Procedure for Modal Logic with Eventualities. CoRR abs/1209.1248 (2012)

Mark Kaminski, Sigurd Schneider, Gert Smolka: Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies. Logical Methods in Computer Science 7(1) (2011)

Mark Kaminski, Gert Smolka: Clausal Tableaux for Hybrid PDL. Electr. Notes Theor. Comput. Sci. 278: 99-113 (2011)

Christian Doczkal, Gert Smolka: Constructive Formalization of Hybrid Logic with Eventualities. CPP 2011: 5-20

Gert Smolka: Incremental Decision Procedures for Modal Logic with Nominals and Eventualities. Description Logics 2011

Mark Kaminski, Thomas Schneider, Gert Smolka: Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics. TABLEAUX 2011: 196-210

Chad E. Brown, Gert Smolka: Analytic Tableaux for Simple Type Theory and its First-Order Fragment. Logical Methods in Computer Science 6(2) (2010)

Daniel Götzmann, Mark Kaminski, Gert Smolka: Spartacus: A Tableau Prover for Hybrid Logic. Electr. Notes Theor. Comput. Sci. 262: 127-139 (2010)

Mark Kaminski, Gert Smolka: Terminating Tableaux for Hybrid Logic with Eventualities. IJCAR 2010: 240-254

Mark Kaminski, Gert Smolka: Terminating Tableaux for SOQ\mathcal{SOQ} with Number Restrictions on Transitive Roles. IFIP TCS 2010: 213-228

Mark Kaminski, Gert Smolka: Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference. LPAR (Yogyakarta) 2010: 417-431

Mark Kaminski, Gert Smolka: A Minimal Propositional Type Theory. CoRR abs/1001.4021 (2010)

Mark Kaminski, Gert Smolka: Hybrid Tableaux for the Difference Modality. Electr. Notes Theor. Comput. Sci. 231: 241-257 (2009)

Mark Kaminski, Gert Smolka: Terminating Tableau Systems for Hybrid Logic with Difference and Converse. Journal of Logic, Language and Information 18(4): 437-464 (2009)

Mark Kaminski, Gert Smolka: Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles. Description Logics 2009

Chad E. Brown, Gert Smolka: Terminating Tableaux for the Basic Fragment of Simple Type Theory. TABLEAUX 2009: 138-151

Mark Kaminski, Sigurd Schneider, Gert Smolka: Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies. TABLEAUX 2009: 235-249

Chad E. Brown, Gert Smolka: Extended First-Order Logic. TPHOLs 2009: 164-179

Gert Smolka: Programmierung - eine Einführung in die Informatik mit Standard ML. Oldenbourg 2008, isbn 978-3-486-58601-5, pp. I-XIV, 1-371

Mark Kaminski, Gert Smolka: Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse. IJCAR 2008: 210-225

Moritz Hardt, Gert Smolka: Higher-Order Syntax and Saturation Algorithms for Hybrid Logic. Electr. Notes Theor. Comput. Sci. 174(6): 15-27 (2007)

Guido Tack, Leif Kornstaedt, Gert Smolka: Generic Pickling and Minimization. Electr. Notes Theor. Comput. Sci. 148(2): 79-103 (2006)

Joachim Niehren, Jan Schwinghammer, Gert Smolka: A concurrent lambda calculus with futures. Theor. Comput. Sci. 364(3): 338-356 (2006)

Guido Tack, Christian Schulte, Gert Smolka: Generating Propagators for Finite Set Constraints. CP 2006: 575-589

Ralph Debusmann, Gert Smolka: Multi-Dimensional Dependency Grammar as Multigraph Description. FLAIRS Conference 2006: 740-745

Joachim Niehren, Jan Schwinghammer, Gert Smolka: A Concurrent Lambda Calculus with Futures. FroCoS 2005: 248-263

Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, Stefan Thater: A Relational Syntax-Semantics Interface Based on Dependency Grammar. COLING 2004

Gert Smolka: The Development of Oz and Mozart. MOZ 2004: 1

Andreas Rossberg, Didier Le Botlan, Guido Tack, Thorsten Brunklaus, Gert Smolka: Alice through the looking glass. Trends in Functional Programming 2004: 79-95

Gert Smolka: Introduction. Constraints 5(1/2): 5 (2000)

Gert Smolka: Guest Editor's Foreword. Nord. J. Comput. 7(4): 257 (2000)

Gert Smolka (Ed.): 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. Lecture Notes in Computer Science 1782, Springer 2000, isbn 3-540-67262-1

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)

Gert Smolka: Concurrent Constraint Programming Based on Functional Programming (Extended Abstract). ESOP 1998: 1-11

Andreas Podelski, Gert Smolka: Situated Simplification. Theor. Comput. Sci. 173(1): 235-252 (1997)

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)

Seif Haridi, Peter Van Roy, Gert Smolka: An overview of the design of Distributed Oz. PASCO 1997: 176-187

Gert Smolka: Constraint Programming in Oz (Abstract). ILPS 1997: 37-38

Gert Smolka (Ed.): Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, Proceedings. Lecture Notes in Computer Science 1330, Springer 1997

Gert Smolka: Constraints in OZ. ACM Comput. Surv. 28(4es): 75 (1996)

Martin Müller, Gert Smolka: Oz: nebenläufige Programmierung mit Constraints. KI 10(3): 55-61 (1996)

Gert Smolka: The Oz Programming Language and System (Abstract). ASIAN 1996: 377

Gert Smolka: The Oz Programming Model. JELIA 1996: 251

Rolf Backofen, Gert Smolka: A Complete and Recursive Feature Theory. Theor. Comput. Sci. 146(1&2): 243-268 (1995)

Gert Smolka: The Oz Programming Model. Computer Science Today 1995: 324-343

Andreas Podelski, Gert Smolka: Situated Simplification. CP 1995: 328-344

Gert Smolka: The Oz Programming Model (Extended Abstract). Euro-Par 1995: 5-8

Gert Smolka: Oz: Concurrent Constraint Programming for Real. ICLP 1995: 13

Andreas Podelski, Gert Smolka: Operational Semantics of Constraint Logic Programs with Coroutining. ICLP 1995: 449-463

Andreas Podelski, Gert Smolka: Situated Simplification. ICLP 1995: 826

Gert Smolka: Objects in a higher-order concurrent constraint model with state. LMO 1995: 69-74

Gert Smolka, Ralf Treinen: Records for Logic Programming. J. Log. Program. 18(3): 229-258 (1994)

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)

Gert Smolka: A Foundation for Higher-order Concurrent Constraint Programming. CCL 1994: 50-72

Joachim Niehren, Gert Smolka: A Confluent Relational Calculus for Higher-Order Programming with Constraints. CCL 1994: 89-104

Andreas V. Hense, Gert Smolka: A Record Calculus with Principal Types. CCL 1994: 219-236

Christian Schulte, Gert Smolka, Jörg Würtz: Encapsulated Search and Constraint Programming in Oz. PPCP 1994: 134-150

Christian Schulte, Gert Smolka: Encapsulated Search for Higher-order Concurrent Constraint Programming. SLP 1994: 505-520

Gert Smolka: The Definition of Kernel Oz. Constraint Programming 1994: 251-292

Rolf Backofen, Gert Smolka: A Complete and Recursive Feature Theory. ACL 1993: 193-200

Martin Henz, Gert Smolka, Jörg Würtz: Oz - A Programming Language for Multi-Agent Systems. IJCAI 1993: 404-409

Gert Smolka, Martin Henz, Jörg Würtz: Object-Oriented Concurrent Constraint Programming in Oz. KI 1993: 44-59

Gert Smolka: Nebenläfige Objekte und Logische Programmierung. WLP 1993: 7-9

Gert Smolka: Feature-Constraint Logics for Unification Grammars. J. Log. Program. 12(1&2): 51-87 (1992)

Hassan Aït-Kaci, Andreas Podelski, Gert Smolka: A Feature-Based Constraint System for Logic Programming with Entailment. FGCS 1992: 1012-1021

Gert Smolka, Ralf Treinen: Records for Logic Programming. JICSLP 1992: 240-254

Andreas V. Hense, Gert Smolka: A Verification of Extensible Record Types. IWAR 1992: 137-164

Manfred Schmidt-Schauß, Gert Smolka: Attributive Concept Descriptions with Complements. Artif. Intell. 48(1): 1-26 (1991)

Gert Smolka: Residuation and Guarded Rules for Constraint Logic Programming. WCLP 1991: 405-419

Bernhard Nebel, Gert Smolka: Attribute Description Formalisms ... and the Rest of the World. Text Understanding in LILOG 1991: 439-452

Jürgen Müller, Franz Baader, Bernhard Nebel, Werner Nutt, Gert Smolka: Tutorial on Reasoning and Representation with Concept Languages. CADE 1990: 681

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

Werner Nutt, Pierre Réty, Gert Smolka: Basic Narrowing Revisited. J. Symb. Comput. 7(3/4): 295-317 (1989)

Gert Smolka, Hassan Aït-Kaci: Inheritance Hierarchies: Semantics and Unification. J. Symb. Comput. 7(3/4): 343-370 (1989)

Daniel Hernández, Bernhard Nebel, Gert Smolka, Ipke Wachsmuth: Fachseminar: Formale und kognitive Grundlagen von Wissensrepräsentationen. GWAI 1989: 476

Gert Smolka: Feature-Logik. GWAI 1989: 477-478

Bernhard Nebel, Gert Smolka: Representation and Reasoning with Attributive Descriptions. Sorts and Types in Artificial Intelligence 1989: 112-139

Manfred Schmidt-Schauß, Gert Smolka: Attributive Concept Descriptions with Unions and Complements. IWBS Report 68 (1989)

Bernhard Nebel, Gert Smolka: Representation and Reasoning with Attributive Descriptions. IWBS Report 81 (1989)

Gert Smolka: Feature Constraint Logics for Unification Grammars. IWBS Report 93 (1989)

Gert Smolka: Type Logic. ADT 1988

Gert Smolka: Logic Programming with Polymorphically Order-Sorted Types. ALP 1988: 53-70

Gert Smolka: A Feature Logic with Subsorts. LILOG-Report 33 (1988)

Markus Höhfeld, Gert Smolka: Definite Resolution over Constraint Languages. LILOG-Report 53 (1988)

Gert Smolka: FRESH: A Higher-Order Language With Unification and Multiple Results. Logic Programming: Functions, Relations, and Equations 1986: 469-524

Gert Smolka: Polymorphic Order-Sorted Algebra. ADT 1986

Gert Smolka: Making Control and Data Flow in Logic Programs Explicit. LISP and Functional Programming 1984: 311-322

Gert Smolka: Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets. GWAI 1982: 191-204

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

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

Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, E. Unvericht, Christoph Walther: Das Karlsruher Beweissystem. GI Jahrestagung 1980: 400-412