Add to ORKGThe utility of including cyclic flows of control in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present an overview of recent results for determining the class of problems that a plan with loops can solve. These methods can be used to direct the construction of a rich new form of generalized plans that solve a desired class of problems
The plan method analyzes the structure of a program. The plan which results from applying the method...
CHR, short for Constraint Handling Rules, is a rule-based programming language, with similarities to...
Planning in nondeterministic domains yields both conceptual and practical difficulties. From the con...
The utility of including cyclic flows of control in plans has been long recognized by the planning c...
The utility of including loops in plans has been long recognized by the planning community. Loops ...
AbstractThe utility of including loops in plans has been long recognized by the planning community. ...
Research in the field of Automated Planning is largely focused on the problem of constructing plans ...
Research in the field of Automated Planning is largely focused on the problem of constructing plans ...
This thesis studies planning problems whose solution plans are program-like structures that contain ...
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rig...
Several realistic non-deterministic planning domains require plans that encode iterative trial-and-e...
We create a unified framework for analyzing and synthesizing plans with loops for solving problems ...
Loops with multiple-exits and flags detract from the quality of imperative programs. They tend to ma...
AbstractConstructing plans that can handle multiple problem instances is a longstanding open problem...
In AI planning, there has been an increasing interest in solving a class of problems, rather than in...
The plan method analyzes the structure of a program. The plan which results from applying the method...
CHR, short for Constraint Handling Rules, is a rule-based programming language, with similarities to...
Planning in nondeterministic domains yields both conceptual and practical difficulties. From the con...
The utility of including cyclic flows of control in plans has been long recognized by the planning c...
The utility of including loops in plans has been long recognized by the planning community. Loops ...
AbstractThe utility of including loops in plans has been long recognized by the planning community. ...
Research in the field of Automated Planning is largely focused on the problem of constructing plans ...
Research in the field of Automated Planning is largely focused on the problem of constructing plans ...
This thesis studies planning problems whose solution plans are program-like structures that contain ...
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rig...
Several realistic non-deterministic planning domains require plans that encode iterative trial-and-e...
We create a unified framework for analyzing and synthesizing plans with loops for solving problems ...
Loops with multiple-exits and flags detract from the quality of imperative programs. They tend to ma...
AbstractConstructing plans that can handle multiple problem instances is a longstanding open problem...
In AI planning, there has been an increasing interest in solving a class of problems, rather than in...
The plan method analyzes the structure of a program. The plan which results from applying the method...
CHR, short for Constraint Handling Rules, is a rule-based programming language, with similarities to...
Planning in nondeterministic domains yields both conceptual and practical difficulties. From the con...