The semantics of many bulk data models depends on user-defined attributes such as definitions of element equality, ordering, and other domain predicates. While these attributes are an intrinsic part of the data model, they are not normally treated as part of the static type description. This leads to the occurrence of data modelling errors which are not statically detectable, such as a union op...

The neats: proponents of formal-based, knowledge-intensive smart systems to revolutionize the requirements process. The eventual success of the neat approach is less certain. There are several opinions of the answer to: ‘Can the neats ever playa significant role in requirements engineering?’: a. Never – the extra effort of doing things the neat way will always exceed the payoff. b. Hardly ever ...

we introduce a new concept of general $g$-$eta$-monotone operator generalizing the general $(h,eta)$-monotone operator cite{arvar2, arvar1}, general $h-$ monotone operator cite{xiahuang} in banach spaces, and also generalizing $g$-$eta$-monotone operator cite{zhang}, $(a, eta)$-monotone operator cite{verma2}, $a$-monotone operator cite{verma0}, $(h, eta)$-monotone operator cite{fanghuang}, $h$-...

Many different approaches to game playing have been suggested including alpha-beta search, temporal difference learning, genetic algorithms, and coevolution. Here, a powerful new algorithm for neuroevolution, Neuro-Evolution for Augmenting Topologies (NEAT), is adapted to the game playing domain. Evolution and coevolution were used to try and develop neural networks capable of defeating an alph...

It is essential that the reasoning of an expert system can be ex-­ plained and justified. In the paper simple ideas for providing com-­ prehensive explanations of deductions are presented. The method is to transform the proof tree to a more comprehensive proof tree from which a neat explanation directly can be extracted. The transformation of proof trees is a way to view the problem of explaini...