#### Filter Results:

#### Publication Year

1998

2004

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Steffen Hölldobler, Yvonne Kalinke, Hans-Peter Störr
- Appl. Intell.
- 1999

; Abstract. In 8] we have shown how to construct a 3{layer recurrent neural network that computes the iteration of the meaning function T P of a given propositional logic program, what corresponds to the computation of the semantics of the program. In this article we deene a notion of approximation for interpretations and prove that there exists a 3{layer… (More)

In this paper we present a fuzzy description logic ÄÄ À , where primitive concepts are modified by means of hedges. ÄÄ À is strictly more expressive than Fuzzy-ÄÄ defined in [8]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we… (More)

We present the fuzzy description logic ALC F H where primitive concepts are modified by means of hedges taken from hedge algebras. ALC F H is strictly more expressive than Fuzzy-ALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges.… (More)

- Steffen Hölldobler, Hans-Peter Störr
- Computational Logic
- 2000

It is rigorously shown how planning problems encoded as a class of entailment problems in the uent calculus can be mapped onto satissability problems for propositional formulas, which in turn can be mapped to the problem of nding models using binary decision diagrams (BDDs). The mapping is shown to be sound and complete. First experimental results of an… (More)

We present a new classification algorithm that combines three properties: It generates decision trees, which proved a valuable and intelligible tool for classification and generalization of data; it utilizes fuzzy logic, that provides for a fine grained description of classified items adequate for human reasoning; and it is incremental, allowing rapid… (More)

- Hans-Peter Störr
- 2002

We introduce a conservative fuzzy logic extension of the Naive Bayesian classification algorithm. The extension generalizes the algorithm such that the examples are described by a fuzzy set of attributes, instead of a classical set. Thus, an example possesses each attribute to a degree in [0, 1]. We present a new classification algorithm usable with fuzzy… (More)

- Steffen Hölldobler, Hans-Peter Störr, Dinh Khang Tran
- JACIII
- 2003

In this paper we present the fuzzy description logic ALC F H introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALC F H is strictly more expressive than Fuzzy-ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with… (More)

We propose a generic web shop system which adapts online to the preferences of a user by observing the user's behavior and applying machine learning algorithms. We specify the system architecture, identify basic research problems and discuss the current state of our system.

- Hans-Peter Störr, Michael Thielscher
- Computational Logic
- 2000

A new equational foundation is presented for the Fluent Calculus , an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a uent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of… (More)

- Hans-Peter Störr
- AI Magazine
- 2001

BDDPLAN was created to perform certain reasoning processes in the fluent calculus, a flexible framework for reasoning about action and change based on first-order logic with equality (plus some second order extensions in some cases). The reasoning is done by mapping the problems into propo-sitional logic, which, in turn, can be implemented as operations on… (More)