#### Filter Results:

- Full text PDF available (85)

#### Publication Year

1985

2017

- This year (1)
- Last 5 years (30)
- Last 10 years (72)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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)

- Manfred Schmidt-Schauß
- KR
- 1989

- Manfred Schmidt-Schauß
- Lecture Notes in Computer Science
- 1988

Find loads of the computational aspects of an order sorted logic with term declarations lecture notes in artificial intelligence vol 395 book catalogues in this site as the choice of you visiting this page. You can also join to the website book library that will show you numerous books from any types. Literature, science, politics, and many more catalogues… (More)

We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to… (More)

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

- Manfred Schmidt-Schauß
- Inf. Comput.
- 2004

- Manfred Schmidt-Schauß
- CADE
- 1988

- Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz
- Theor. Comput. Sci.
- 1995

A modular property of term rewriting systems is one that holds for the direct sum of two disjoint term rewriting systems iff it holds for every involved term rewriting system. A term rewriting system is r-consistent iff there is no term that can be rewritten to two different variables. We show that the subclass of left-linear and r-consistent term rewriting… (More)

reduction e e0 if e!# e0 Approximation C[e] C[Ti] j e Ti is a new variable. Argument saturation e e Ti where Ti is a new variable. If e is a HNF where the head is a supercombinator Branching C[caseA T1 e1 : : : em] fT1 7! (cA;1 T1;1 : : : T1;n1)gC[e1 T1;1 : : : T1;n1 ] j : : : j fT1 7! (cA;m Tm;1 : : : Tm;nm)gC[em Tm;1 : : : Tm;nm ] Where Ti;j are new… (More)

- Manfred Schmidt-Schauß
- J. Log. Comput.
- 2002

Context uniication is a variant of second order uniication and also a generalization of string uniication. Currently it is not known whether context uniication is decidable. A specialization of context uniication is stratiied context uniication. Recently, it turned out that stratiied context uniication and one-step rewrite constraints are equivalent. This… (More)