Gert Smolka - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid LogicsMark Kaminski, Thomas Schneider 0002, Gert Smolka. tableaux 2011: 196-210 [doi]

2010

2009

2008

Terminating Tableaux for Hybrid Logic with the Difference Modality and ConverseMark Kaminski, Gert Smolka. cade 2008: 210-225 [doi]

Programmierung - eine Einführung in die Informatik mit Standard MLGert Smolka. Oldenbourg, 2008. [doi]

2007

Higher-Order Syntax and Saturation Algorithms for Hybrid LogicMoritz Hardt, Gert Smolka. ENTCS, 174(6):15-27, 2007. [doi]

2006

2005

A Concurrent Lambda Calculus with FuturesJoachim Niehren, Jan Schwinghammer, Gert Smolka. frocos 2005: 248-263 [doi]

2004

Alice through the looking glassAndreas Rossberg, Didier Le Botlan, Guido Tack, Thorsten Brunklaus, Gert Smolka. sfp 2006: 79-95

The Development of Oz and MozartGert Smolka. moz 2005: 1 [doi]

2000

Guest Editor s ForewordGert Smolka. njc, 7(4):257, 2000.

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, ProceedingsGert Smolka, editor, Volume 1782 of Lecture Notes in Computer Science, Springer, 2000.

IntroductionGert Smolka. constraints, 5(1/2):5, 2000.

1999

Efficient logic variables for distributed computingSeif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, Gert Smolka. TOPLAS, 21(3):569-626, 1999. [doi]

1998

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

1997

An overview of the design of Distributed OzSeif Haridi, Peter Van Roy, Gert Smolka. cap 1997: 176-187 [doi]

Situated SimplificationAndreas Podelski, Gert Smolka. TCS, 173(1):235-252, 1997. [doi]

Mobile Objects in Distributed OzPeter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, Ralf Scheidhauer. TOPLAS, 19(5):804-851, 1997. [doi]

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

Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, ProceedingsGert Smolka, editor, Volume 1330 of Lecture Notes in Computer Science, Springer, 1997.

1996

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

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

Constraints in OZGert Smolka. ACM Comput. Surv., 28(4es):75, 1996.

The Oz Programming ModelGert Smolka. jelia 1996: 251

1995

A Complete and Recursive Feature TheoryRolf Backofen, Gert Smolka. TCS, 146(1&2):243-268, 1995. [doi]

Situated SimplificationAndreas Podelski, Gert Smolka. ICLP 1995: 826

Situated SimplificationAndreas Podelski, Gert Smolka. cp 1995: 328-344

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

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

Oz: Concurrent Constraint Programming for RealGert Smolka. ICLP 1995: 13

The Oz Programming ModelGert Smolka. In Jan van Leeuwen, editor, Computer Science Today: Recent Trends and Developments. Volume 1000 of Lecture Notes in Computer Science, pages 324-343, Springer, 1995.

Objects in a higher-order concurrent constraint model with stateGert Smolka. lmo 1995: 69-74

1994

A Feature Constraint System for Logic Programming with EntailmentHassan Aït-Kaci, Andreas Podelski, Gert Smolka. TCS, 122(1&2):263-283, 1994.

A Record Calculus with Principal TypesAndreas V. Hense, Gert Smolka. iccl 1994: 219-236

A Confluent Relational Calculus for Higher-Order Programming with ConstraintsJoachim Niehren, Gert Smolka. iccl 1994: 89-104

Encapsulated Search for Higher-order Concurrent Constraint ProgrammingChristian Schulte, Gert Smolka. slp 1994: 505-520

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

The Definition of Kernel OzGert Smolka. Constraint Programming: Basics and Trends, Châtillon Spring School, Châtillon-sur-Seine, France, May 16 - 20, 1994, Selected Papers 1995: 251-292

Records for Logic ProgrammingGert Smolka, Ralf Treinen. jlp, 18(3):229-258, 1994.

A Foundation for Higher-order Concurrent Constraint ProgrammingGert Smolka. iccl 1994: 50-72

1993

A Complete and Recursive Feature TheoryRolf Backofen, Gert Smolka. acl 1993: 193-200

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

Nebenläfige Objekte und Logische ProgrammierungGert Smolka. wlp 1993: 7-9

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

1992

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

A Verification of Extensible Record TypesAndreas V. Hense, Gert Smolka. iwar 1992: 137-164

Records for Logic ProgrammingGert Smolka, Ralf Treinen. ICLP 1992: 240-254

Feature-Constraint Logics for Unification GrammarsGert Smolka. jlp, 12(1&2):51-87, 1992.

1991

Attribute Description Formalisms ... and the Rest of the WorldBernhard Nebel, Gert Smolka. Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project 1991: 439-452

Attributive Concept Descriptions with ComplementsManfred Schmidt-Schauß, Gert Smolka. ai, 48(1):1-26, 1991.

Residuation and Guarded Rules for Constraint Logic ProgrammingGert Smolka. wclp 1991: 405-419

1990

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

1989

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

Representation and Reasoning with Attributive DescriptionsBernhard Nebel, Gert Smolka. lilog 1989: 112-139

Basic Narrowing RevisitedWerner Nutt, Pierre Réty, Gert Smolka. JSC, 7(3/4):295-317, 1989.

Feature-LogikGert Smolka. ki 1989: 477-478

Inheritance Hierarchies: Semantics and UnificationGert Smolka, Hassan Aït-Kaci. JSC, 7(3/4):343-370, 1989.

Logic Programming over Polymorphically Order-Sorted TypesGert Smolka. PhD thesis, Universität Kaiserslautern, 1989.

1988

Type LogicGert Smolka. WADT 1988:

Logic Programming with Polymorphically Order-Sorted TypesGert Smolka. icalp 1988: 53-70

1986

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

Polymorphic Order-Sorted AlgebraGert Smolka. adt 1986:

1984

Making Control and Data Flow in Logic Programs ExplicitGert Smolka. lfp 1984: 311-322

1982

Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause SetsGert Smolka. ki 1982: 191-204

1981

The Markgraf Karl Refutation ProcedureKarl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, Christoph Walther. IJCAI 1981: 511-518

Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof ProcedureJörg H. Siekmann, Gert Smolka. ki 1981: 199-200

1980

Das Karlsruher BeweissystemNorbert Eisinger, Jörg H. Siekmann, Gert Smolka, E. Unvericht, Christoph Walther. gi 1980: 400-412