Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

We introduce an algorithm to decide isomorphism between tensors. The uses the Lie algebra of derivations a tensor compress space in which search takes place so-called densor space. To make method practicable we give polynomial-time solve generalization module for common class modules. As consequence, show that testing is polynomial time tensors whose derivation algebras are classical and spaces...

using fixed pointmethods, we investigate approximately higher ternary jordan derivations in banach ternaty algebras via the cauchy functional equation$$f(lambda_{1}x+lambda_{2}y+lambda_3z)=lambda_1f(x)+lambda_2f(y)+lambda_3f(z)~.$$

The basic Schema Theorem for genetic algorithms is modiied for a grammatically-based learning system. A context-free grammar is used to deene a language in which each sentence is mapped to a tness value. The derivation trees associated with these sentences are used to deene the structure of schemata. The eeect of crossover and mutation on schemata is described. A schema theorem is developed whi...

Definition 1.1. A curved L∞ algebra over A consists of a locally free finitely generated graded A]-module V, together with a cohomological degree 1 and square zero derivation d : Ŝym(V∨[−1])→ Ŝym(V∨[−1]) where V∨ is the A]-linear dual and the completed symmetric algebra is also over A]. There are two additional requirements on the derivation d: (1) The derivation d makes Ŝym(V∨[−1]) into a dga ...

Given an algebraA over a differential fieldK, we study derivations on A that are compatible with the derivation on K. There is a universal object, which is a twisted version of the usual module of differentials, and we establish some of its basic properties. In the context of differential algebraic geometry, one gets a sheaf of these τ -differentials which can be interpreted as certain natural ...

When a text in any language is submitted to a morphological analysis, there always rest some unrecognized words. We can lower their number by adding new words into the dictionary used by the morphological analyzer but we can never gather the whole of the language. The system described in this paper (we call it "derivation module") deals with the unknown derived words. It aims not only at analyz...

We describe a number of experiments that demonstrate the usefulness of prosodic information for a processing module which parses spoken utterances with a feature-based grammar employing empty categories. We show that by requiring certain prosodic properties from those positions in the input, where the presence of an empty category has to be hypothesized, a derivation can be accomplished more e ...

1. The construction of T(A) is motivated by dualizing the fundamental group 7Ti(X) of a differentiable manifold X with a base point Xo. Let A be the -R-algebra of C functions on X equipped with the derivation d, which is the usual differentiation from A into the Amodule M = ÛA of C 1-forms on X. Recall that the shuffle algebra Sh(M) consists of the i£-module of the tensor algebra TR(M) and the ...