Márcio Rillo

Case-Based Planning in Transaction Logic Framework

Abstract This work stands out the use of Transaction Logic (TR) in case-based planning. The TR provides a correct and complete logical theory based planner that can be computationally implemented keeping the formal theory semantic. The TR is efficient on states treatment besides to create a retriever and cases adaptation easier than others formalized systems. Transaction Logic provides a clean fashion in knowledge representation and its semantic based on path of states is next to planning necessities, making possible the formalization of whole case-based planning system without the existence of the semantic gap between theory and implementation.

Handling Cases and the Coverage in a Limited Quantity of Memory for Case-Based Planning Systems

The majority of case-based planning systems consider an infinite case memory to store their cases. However, the size of the case memory is limited and it can become a barrier for case-based systems efficiency when it is full. This paper presents a method that refines and abstracts cases in order to release memory space for a new case. However, in some situations, some cases must be chosen to be deleted, and the method incorporates a case-deletion policy that achieves a lower bound for coverage depletion. Besides this paper can deal with a limited quantity of memory to store cases, the case-deletion policy also reaches better results for coverage-preserving than the case-addition policy proposed by Zhu and Yang [11].

Releasing Memory Space through a Case-Deletion Policy with a Lower Bound for Residual Competence

The number of techniques that focuses on how to create compact casebase in case-base maintenance has been increasing over the last few years. However, while those techniques are concerned with choosing suitable cases to improve the system performance, they do not deal with the problem of a limited memory space, which may affect the performance as well. Even when a CBR system admits only a limited number of stored cases in memory, there will still exist the storage-space problem if it has cases that vary in size, as in most of case-based planning domains. This paper focuses on case-deletion policy to release space in the case memory, which can guarantee the competencepreserving property and establish a theoretical lower bound for residual competence.

Approaching the Plans are Programs Paradigm Using Transaction Logic

Transaction logic (TR) is a formalism that accounts for the specification and execution of update phenomena in arbitrary logical theory, specially logic programs and databases. In fact, from a theoretical standpoint, the planning activity could be seen as such a kind of phenomenon, where the execution of plan actions update a world model. This paper presents how a planning process can be specified and formally executed in TR. We define a formal planning problem description and show that goals for these problems may be represented not only as questions to a final database state, but also as the invocation of complex actions. The planning process in this framework can be considered as an executional deduction of a TR formula. As a highlight of this work we could mention that it provides a clean and declarative approach to bridging the gap between formal and real planning. The user not only “programs” his planning problem description, but also gains a better understanding of what is behind the semantics of the plan generation process.

On the Treatment of the Ramification Problem with Transaction Logic

Abstract In the planning area, the reasoning about action is important, because the plans are made by a sequence of actions. Each action has its effects that need to be treated and fonnalized in some logical framework.The use of Transaction Logic (TR) makes possible a perfect definition of fluents to treat the effects of the ramification problem, because the TR works with database controlled by transition and data oracles. The TR has a powerful set of inference rules that makes possible its implementation in PROLOG, like SLD-resolution, allowing the application of effects in a computational way.

Planejamento de ações para automação inteligente da manufatura

This paper investigates the use of the FAR-OFF system in the Manufacturing Automation field. The FAR-OFF system has the feature of heuristic search based systems, which have been presenting excellent results over the last years in the planning area. However, instead of being a generative planning system, the FAR-OFF system is a case-based planner that can guarantee stability to solve problems in a reasonable amount of time. The results presented by its application in the logistic domain show that it is a promising system for intelligent automation.

Managing External Events in Planning

Abstract This work describes a planning system that deals with external events. Concepts related to external events are described and a planning algorithm is presented. Also, a mechanism for integrating planning and execution is considered.