In this paper, we consider planning for multi-agents situations in STRIPS-like domains with planning graph. Three possible relationships between agents’ goals are considered in order to evaluate plans: the agents may be collaborative, adversarial or indifferent entities. We propose algorithms to deal with each situation. The collaborative situations can be easily dealt with the original Graphpl...

A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a general Least Fixpoint operator that operates on meta rules. Each set of meta rules represents a different strategy, and this allows an easy comparison. We first consider Deductive Databases with Horn clauses and we prese...

A novel Genetic Programming (GP) paradigm called Coevolutionary Rule-Chaining Genetic Programming (CRGP) has been proposed to learn the relationships among attributes represented by a set of classification rules for multi-class problems. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. Its main advantages are: 1) it can handle more than ...

This paper investigates how information systems design professionals use principles (extracted from a prior science research project) in new situation. We do this by capturing think-aloud protocols experienced who are given access to potentially useful principles. Our analysis identifies two dimensions of use: behaviors (what designers do) and application modes (how apply the principles). Mappi...

We present a formal description of the planning algorithm used in the Prodigy4.0 system. The algorithm is based on an interesting combination of backward-chaining planning and simulation of plan execution. The backward-chainer selects goal-relevant operators, and then Prodigy simulates their application to the current state of the world. The system can use di erent backward-chaining procedures,...

There is a large literature concerning rule engines (forward chaining or backward chaining). During the last thirty years there were various proposals such as RETE, TREAT and the derived Gator algorithm. Significantly, RETE was embedded into various expert systems such as Clips and its successor Jess, and Drools including in a number of commercial rule engines and was extended various times inc...