scholarly journals Bounded-Resource Reasoning as (Strong or Classical) Planning

2009 ◽  
pp. 77-96
Author(s):  
Alexandre Albore ◽  
Natasha Alechina ◽  
Piergiorgio Bertoli ◽  
Chiara Ghidini ◽  
Brian Logan
Keyword(s):  
Resource Reasoning

RESOURCE-ORIENTED PARALLEL PLANNING

1992 ◽  
Vol 01 (01) ◽  
pp. 85-115 ◽  
Author(s):  
SUKHAN LEE ◽  
KYUSIK CHUNG
Keyword(s):  
Distributed Processing ◽  
New Paradigm ◽  
Optimal Plan ◽  
Flow Plan ◽  
Goal State ◽  
Parallel And Distributed Processing ◽  
State Subset ◽  
Resource Reasoning ◽  
Minimum Depth ◽  
Oriented Parallel

This paper presents a new paradigm for constructing a partially ordered plan network, referred to as "resource-oriented parallel planning (RP2)". In resource-oriented parallel planning, goal states are grouped into a collection of goal state subsets, each of which consists of those goal states associated with a particular resource. A subplan is generated for each goal state subset by planning the flow of the corresponding resource, and thus satisfying the constraints specified by each of the goal state subsets. A complete plan is then constructed by synthesizing individual subplans based on the synchronization among subplans. A distinctive feature of RP2 is that each subplanner generates a conflict-free subplan by controlling the flow of a particular resource while synthesizing a complete plan in cooperation with other subplanners. This can be compared with the conventional state-oriented parallel planning, where each subplanner generates a subplan achieving a goal state while resolving conflicts among subplans in cooperation with other subplanners. RP2 makes use of resource reasoning in distinguishing important and unimportant resources associated with a goal. This allows each subplanner to hierarchically construct a resource-flow plan and to dynamically coordinate among subplanners in achieving a goal associated with more than one resource. The proposed scheme not only makes it possible to generate an optimal plan in terms of the maximum parallelism or the minimum depth of a plan network, but also makes it easier to implement the concurrent generation of parallel plans in a parallel and distributed processing environment.

On-Line Reconfigurable Machines

AI Magazine ◽  
2013 ◽  
Vol 34 (3) ◽  
Author(s):  
Lara S. Crawford
Keyword(s):  
Manufacturing Systems ◽  
Reconfigurable Manufacturing ◽  
Planning And Scheduling ◽  
Model Based ◽  
Planning And Control ◽  
Resource Reasoning ◽  
On Line ◽  
Scheduling Heuristic ◽  
High Level ◽  
And Control

A recent trend in intelligent machines and manufacturing has been toward reconfigurable manufacturing systems, which move away from the idea of a fixed factory line executing an unchanging set of operations, and toward the goal of an adaptable factory structure. The logical next challenge in this area is that of on-line reconfigurability. With this capability, machines can reconfigure while running, enable or disable capabilities in real time, and respond quickly to changes in the system or the environment (including faults). We propose an approach to achieving on-line reconfigurability based on a high level of system modularity supported by integrated, model-based planning and control software. Our software capitalizes on many advanced techniques from the artificial intelligence research community, particularly in model-based domain-independent planning and scheduling, heuristic search, and temporal resource reasoning. We describe the implementation of this design in a prototype highly modular, parallel printing system.

On-Line Reconfigurable Machines

AI Magazine ◽  
2013 ◽  
Vol 34 (3) ◽  
pp. 73-88 ◽  
Author(s):  
Lara S. Crawford ◽  
Minh Binh Do ◽  
Wheeler S. Ruml ◽  
Haitham Hindi ◽  
Craig Eldershaw ◽  
...  
Keyword(s):  
Manufacturing Systems ◽  
Reconfigurable Manufacturing ◽  
Planning And Scheduling ◽  
Model Based ◽  
Planning And Control ◽  
Resource Reasoning ◽  
On Line ◽  
Scheduling Heuristic ◽  
High Level ◽  
And Control

A recent trend in intelligent machines and manufacturing has been toward reconfigurable manufacturing systems, which move away from the idea of a fixed factory line executing an unchanging set of operations, and toward the goal of an adaptable factory structure. The logical next challenge in this area is that of on-line reconfigurability. With this capability, machines can reconfigure while running, enable or disable capabilities in real time, and respond quickly to changes in the system or the environment (including faults). We propose an approach to achieving on-line reconfigurability based on a high level of system modularity supported by integrated, model-based planning and control software. Our software capitalizes on many advanced techniques from the artificial intelligence research community, particularly in model-based domain-independent planning and scheduling, heuristic search, and temporal resource reasoning. We describe the implementation of this design in a prototype highly modular, parallel printing system.

scholarly journals Fault-Tolerant Resource Reasoning

2015 ◽  
pp. 169-188 ◽  
Author(s):  
Gian Ntzik ◽  
Pedro da Rocha Pinto ◽  
Philippa Gardner
Keyword(s):  
Fault Tolerant ◽  
Resource Reasoning

scholarly journals A logic of hypothetical conjunction

2019 ◽  
Vol 29 (6) ◽  
pp. 975-1009
Author(s):  
Matthew Collinson
Keyword(s):  
Computer Science ◽  
Possible Worlds ◽  
Conditional Logic ◽  
Binary Relations ◽  
Ternary Relation ◽  
Relevant Logics ◽  
Resource Reasoning ◽  
State Of Affairs ◽  
Natural Way

Abstract A binary connective that can be read as a matching conjunction for conditional connectives found in many conditional logics is considered. The most natural way to read this connective is often as a conjunction and yet, hypothetically, considered to hold of a state of affairs that could be obtained under the hypothesis. The connective can be given an intensional semantics extending a standard semantics of conditional logic that uses propositionally indexed families of binary relations on possible worlds. This semantics is determined by an adjoint relationship between the operations supporting the semantics of the conditional and the new conjunction. The semantics of the hypothetical conjunction connective subsumes the semantics, supported by a ternary relation semantics, of the fusion connective that arises in connection with substructural and relevant logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including generalized forms of resource reasoning used in computer science applications.

scholarly journals A Formal Technique for Composing Cloud Services

2020 ◽  
Vol 49 (1) ◽  
pp. 5-27
Author(s):  
Masoud Barati
Keyword(s):  
Service Composition ◽  
Search Engines ◽  
Formal Method ◽  
Service Operations ◽  
Cloud Services ◽  
User Requirements ◽  
Resource Reasoning ◽  
Composite Services ◽  
Cloud User

Recent cloud search engines lack a formal method in their service composition mechanisms to automatically build composite services realizing user requirements. This paper prescribes behavior composition framework as a formal tools for the search engines. The framework automatically synthesizes a controller that delegates the service operations requested by a cloud user to the proper available cloud services whose operations satisfy the request. Since most cloud search engines support semantic and ontology to discover similar service operations, the paper extends the framework to be more adaptable with such search engines through the use of resource reasoning. Several experiments are provided to demonstrate how the extended framework outperforms the original one in terms of realizing users’ requirements.  

scholarly journals Chain programs for writing deterministic metainterpreters

2002 ◽  
Vol 2 (2) ◽  
pp. 203-232
Author(s):  
DAVID A. ROSENBLUETH
Keyword(s):  
Logic Programming ◽  
Search Strategies ◽  
Derivation Tree ◽  
Logic Programs ◽  
Language Implementation ◽  
Restricted Form ◽  
Resource Reasoning ◽  
Chain Form ◽  
Selection Of ◽  
Imperative Language

Many metainterpreters found in the logic programming literature are nondeterministic in the sense that the selection of program clauses is not determined. Examples are the familiar ‘demo’ and ‘vanilla’ metainterpreters. For some applications this nondeterminism is convenient. In some cases, however, a deterministic metainterpreter, having an explicit selection of clauses, is needed. Such cases include (1) conversion of OR parallelism into AND parallelism for ‘committed-choice’ processors, (2) logic-based, imperative-language implementation of search strategies, and (3) simulation of bounded-resource reasoning. Deterministic metainterpreters are difficult to write because the programmer must be concerned about the set of unifiers of the children of a node in the derivation tree. We argue that it is both possible and advantageous to write these metainterpreters by reasoning in terms of object programs converted into a syntactically restricted form that we call ‘chain’ form, where we can forget about unification, except for unit clauses. We give two transformations converting logic programs into chain form, one for ‘moded’ programs (implicit in two existing exhaustive-traversal methods for committed-choice execution), and one for arbitrary definite programs. As illustrations of our approach we show examples of the three applications mentioned above.

Sign in / Sign up

Export Citation Format

Share Document