Boolean models and planning methods for parallel abstract programs

Authors:
G. A. Oparin;A. P. Novopashin
Affiliations:
Institute of System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, Irkutsk, Russia;Institute of System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, Irkutsk, Russia
Venue:
Automation and Remote Control
Year:
2008

Citing 1
Cited 0

Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the parallel computer systems, a new formulation of the problem of constructing parallel asynchronous abstract programs of the desired length was proposed. The conditions for the problem of planning were represented as a system of Boolean equations (constraints) whose solutions define the feasible plans for activation of the program modules specified in the planner's knowledge base. The constraints on the number of processors and time delays arising at execution of the program modules were taken into consideration.