We devise a calculus based on the resolution and paramodulation rules and operating on schemata of formulæ. These schemata are de ned inductively, using convergent rewrite systems encoding primitive recursive de nitions. The main original feature of this calculus is that the rules operate on formulæ or terms occurring at arbitrary deep positions inside the considered schemata, thus a ecting the...

This paper is aimed at proposing a new framework to predict decision performance, by investigating decision maker’s cognitive resonance. We assume that every decision maker has two kinds of schemaemotional schema and rational schema. Cognitive resonance is believed to have a close relationship with the two schemata and decision performance. In literature on decision performance there is no stud...

In this paper we investigate formally the relationship between the notion of abstract datatypes in an arbitrary institution, found in algebraic specification languages like Clear, ASL, and CASL; and the notion of schemata from the model-oriented specification language Z. To this end the institution S of the logic underlying Z is defined, and a translation of Z-schemata to abstract datatypes ove...

The computational complexity of reasoning on pure concept expressions has been characterized completely for all relevant description logics. On the contrary, reasoning in the presence of schema axioms is not so well understood and far from being settled completely. An important class of schemata is that of primitive schemata (in which the schema axioms express only necessary conditions) possibl...

E-Commerce applications require the exchange of data in an interoperable manner. XML enables syntactic interoperability but more sophisticated E-Commerce applications require semantic interoperability as well. RDF is an application of XML intended to exchange semantics between Web applications. RDF schemata can be used to describe the concepts and constraints of a specific application domain at...

We present Hoare-style axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The preand postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules a...

This paper relates the well-known formalism of Linear Temporal Logic [Pnu77] with the logic of propositional schemata introduced in [ACP09]. We prove that LTL is equivalent to a particular class of schemata in the sense that polynomial-time translation algorithms exist from one logic to the other. Some consequences about complexity are given. We report about first experiments and the consequenc...

This paper presents a set of schemata that support stepwise top-down design of logic programs using abstract data types (ADTs). There are thus three main components to this approach: top-down design, program schemata and ADTs, all of which are already well established notions. Our aim is to combine these ideas in a framework, amenable to support by design tools and allowing the use of existing ...

The conventional understanding of genetic algorithms depends upon analysis by schemata and the notion of intrinsic parallelism. For this reason, only k-ary string representations have had any formal basis and non-standard representations and operators have been regarded largely as heuristics, rather than principled algorithms. This paper extends the analysis to general representations through i...

In this paper, the Stochastic Schemata Exploiter (SSE) is evaluated by seven test problems. The results indicate that the convergence property of the SSE is better than that of the simple genetic algorithm. Next, the Extended Stochastic Schemata Exploiter (ESSE) is introduced and compared with the SSE by the knapsack problem. The results indicate that some of the ESSE algorithms have better con...