Hans-Peter Störr

Learn More
In [1] we have shown how to construct a 3-layered recurrent neural network that computes the fixed point of the meaning function TP of a given propositional logic program P, which corresponds to the computation of the semantics of P. In this article we consider the first order case. We define a notion of approximation for interpretations and prove that(More)
In this paper we present a fuzzy description logic , where primitive concepts are modified by means of hedges. is strictly more expressive than Fuzzydefined 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 define a(More)
We present the fuzzy description logic ALCFH where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH 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)
In this paper we present the fuzzy description logic ALCFH introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH 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)
The paper is an exercise in formal program development. We rigorously show how planning problems encoded as entailment problems in the uent calculus can be mapped onto satissability problems for propositional formulas, which in turn can be mapped to the problem to nd models using binary decision diagrams. The mapping is shown to be sound and complete.(More)
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 fluent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of(More)