The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gert Smolka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  60. Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse. [Citation Graph (, )][DBLP]


  61. Terminating Tableaux for Hybrid Logic with Eventualities. [Citation Graph (, )][DBLP]


  62. Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles. [Citation Graph (, )][DBLP]


  63. Terminating Tableaux for the Basic Fragment of Simple Type Theory. [Citation Graph (, )][DBLP]


  64. Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies. [Citation Graph (, )][DBLP]


  65. Extended First-Order Logic. [Citation Graph (, )][DBLP]


  66. A Minimal Propositional Type Theory [Citation Graph (, )][DBLP]


  67. Analytic Tableaux for Simple Type Theory and its First-Order Fragment [Citation Graph (, )][DBLP]


  68. Hybrid Tableaux for the Difference Modality. [Citation Graph (, )][DBLP]


  69. Spartacus: A Tableau Prover for Hybrid Logic. [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002