#### Filter Results:

- Full text PDF available (111)

#### Publication Year

1971

2017

- This year (8)
- Last 5 years (26)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Manfred Schmidt-Schauß, Gert Smolka
- Artif. Intell.
- 1991

Schmidt-SchaulL M. and G. Smolka, Attributive concept descriptions with complements, Artificial Intelligence 48 (1991) 1-26. We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages. It is shown that deciding coherence and subsumption of such… (More)

- Gert Smolka
- JELIA
- 1995

The Oz Programming Model (OPM) is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model. This is particularly interesting for concurrent object-oriented programming, for which no comprehensive formal model existed until now. The model can be extended so that it can express encapsulated… (More)

- Gert Smolka
- LILOG-Report
- 1988

This paper presents a set description logic with subsorts, feature selection (the inverse of unary function application), agreement, intersection , union and complement. We deene a model theoretic open world semantics and show that sorted feature structures constitute a canon-ical model, that is, without loss of generality subsumption and consistency of set… (More)

- Gert Smolka, Ralf Treinen
- J. Log. Program.
- 1992

CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where ner-grained constraints are used, and where subtrees are identiied by keywords rather than by position. CFT is deened by a rst-order structure consisting of… (More)

- Markus Höhfeld, Gert Smolka
- LILOG-Report
- 1988

- Daniel Götzmann, Mark Kaminski, Gert Smolka
- Electr. Notes Theor. Comput. Sci.
- 2010

This thesis presents Spartacus, a tableau-based reasoner for hybrid logic with global modalities and reflexive and transitive relations. To obtain termination in the presence of global modalities and transitive relations, Spartacus uses pattern-based blocking. To achieve a competitive performance on practical problems, we employ a range of optimization… (More)

- Gert Smolka
- 1989

This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and… (More)

- Manfred Schmidt-Schauß, Gert Smolka
- IWBS Report
- 1989

The efficiency problem in parsing with large-scale unification grammars, including implementations in the Head-driven Phrase Structure grammar (HPSG) framework, used to be a serious obstacle to their application in research and commercial settings. Over the past few years, however, significant progress in efficient processing has been achieved. Still, many… (More)

- Gert Smolka
- J. Log. Program.
- 1989

This paper studies feature description languages that have been developed for use in uniication grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects. We show that feature description languages can be… (More)