We introduce a new deductive approach to planning which is based on Horn clauses. Plans as well as situations are represented as terms and, thus, are first-class objects. We do neither need frame… (More)

If logic programs are interpreted over a three-valued logic, then often Kleene’s strong three-valued logic with complete equivalence and Fitting’s associated immediate consequence operator is used.… (More)

In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry,… (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… (More)

One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networks… (More)

We present the fuzzy linguistic description logic ALCFL, an instance of the description logic framework L−ALC with the certainty lattice characterized by a hedge algebra. Beside constructors of… (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… (More)

Many different encodings for pseudo-Boolean constraints to the Boolean satisfiability problem have been proposed in the past. In this work we present a novel small sized and simple to implement… (More)

Inspired by the work of Elman and Wiles 15] and based on the notions developed within the theory of dynamical systems it is shown how a simple recurrent connectionist network with a single hidden… (More)