Hans-Peter Störr

Learn More
; 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)
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)
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)
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)