Project planning functions are to establish project activities, their logical relationships and interrelationships to each other, and the sequences in which they are to be accomplished. The process of assigning activities' duration and identifying the start and completion times of activities and project is considered as project scheduling. Project planning and scheduling is one of the most impo...

x implies x. Even in algorithm writing and in circuit design, lemmas play a key role: minus(minus(x)) = in the former and NOT(AND(x,y)) = OR(NOT(x),NOT(y)) in the latter. Whether the object is to s prove a theorem, write an algorithm, or design a circuit, and whether the assignment is given to a per on or (preferably) to an automated reasoning program, the judicious use of lemmas often spells t...

The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we explore the extent to which its representation can be used for probabilistic planning In particular we consider an MDP style framework in which the state of the world is known but actions are probabilistic and the objective is to produce a nite horizon contingent plan wit...

Recent domain-determinization techniques have been very successful in many probabilistic planning problems. We claim that traditional heuristic MDP algorithms have been unsuccessful due mostly to the lack of efficient heuristics in structured domains. Previous attempts like mGPT used classical planning heuristics to an all-outcome determinization of MDPs without discount factor ; yet, discounte...

This paper tackles the problem of understanding when and how a reasoning component of a distributed reasoning system is affected by the other components, and how it affects them. A number of relevant concepts which have a precise intuition in terms of cooperative reasoning systems are proposed thus providing a ground for defining a particular class of contexts importing context. The notion of i...

Automated reasoning about systems with infinite domains requires an extension of automata, and in particular, regular automata, to infinite alphabets. Existing formalisms of such automata cope with the infiniteness of the alphabet by adding to the automaton a set of registers or pebbles, or by attributing the alphabet by labels from an auxiliary finite alphabet that is read by an intermediate t...

As automated construction processes require large workspaces and high payloads, the use of cables is a reasonable approach to span wide distances share loads. Therefore, cable-driven parallel robot suitable choice for masonry construction. Another possible robotic system this task consists set cooperative drones, each connected end effector payload by cable. Because similarities between two sys...