Searching for authors named "Gert Smolka" – sorted by Relevance.
-
Completeness of the connection graph proof procedure for unitrefutable clause sets
- -unit-refutable clause sets. 1. INTRODUCTION Gert Smolka Institut rur Informatik I, Universität Karlsruhe 7500 Karlsruhe
- Cited by 1 (0 self) – Add To MetaCart
-
A Survey of Oz
- A Survey of Oz Gert Smolka Programming Systems Lab German Research Center for Artificial
- Cited by 5 (0 self) – Add To MetaCart
-
A Foundation for Higher-order Concurrent Constraint Programming
- Foundation for Higher-order Concurrent Constraint Programming Gert Smolka June 1994 Deutsches
- Cited by 62 (15 self) – Add To MetaCart
-
Concurrent Constraint Programming Based on Functional Programming (Extended Abstract)
- Concurrent Constraint Programming Based on Functional Programming (Extended Abstract) Gert Smolka
- Cited by 15 (3 self) – Add To MetaCart
-
TEL (Version 0.9) Report and User Manual
- .9) Report and User Manual Gert Smolka FB Informatik, Universit at Kaiserslautern 6750 Kaiserslautern, West
- Cited by 9 (0 self) – Add To MetaCart
-
Feature Constraint Logics for Unification Grammars
- Feature Constraint Logics for Unification Grammars Gert Smolka German Research Center
- Cited by 81 (10 self) – Add To MetaCart
-
A Feature Logic with Subsorts
- A Feature Logic with Subsorts Gert Smolka German Research Center for Artificial Intelligence
- Cited by 67 (4 self) – Add To MetaCart
-
Logic Programming over Polymorphically Order-Sorted Types
- Logic Programming over Polymorphically Order-Sorted Types Gert Smolka German Research Center
- Cited by 54 (0 self) – Add To MetaCart
-
The Oz Programming Model
- The Oz Programming Model Gert Smolka Programming Systems Lab German Research Center for Artificial
- Cited by 269 (13 self) – Add To MetaCart
-
Residuation and Guarded Rules for Constraint Logic Programming
- as DFKI Research Report RR-91-13 Constraint Logic Programming Gert Smolka German Research Center
- Cited by 24 (2 self) – Add To MetaCart

