Conference Paper

Modelling adaptive controllers with evolving logic programs.

Conference: ICINCO 2006, Proceedings of the Third International Conference on Informatics in Control, Automation and Robotics, Intelligent Control Systems and Optimization, Setúbal, Portugal, August 1-5, 2006
Source: DBLP

ABSTRACT The paper presents the use of Evolving Logic Programming to model adaptive controllers. The advantage of using well-defined, self-evolving logic-based controllers is that it is possible to model dynamic environments, and to formally prove systems' requirements.

0 Bookmarks
 · 
60 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Many applications (such as system and user monitoring, runtime verification, diagnosis, observation-based decision making, intention recognition) all require to detect the occurrence of an event in a system, which entails the ability to observe the system. Observation can be costly, so it makes sense to try and reduce the number of observations, without losing full certainty about the event’s actual occurrence. In this paper, we propose a formalization of this problem. We formally show that, whenever the event to be detected follows a discrete spatial or temporal pattern, then it is possible to reduce the number of observations. We discuss exact and approximate algorithms to solve the problem, and provide an experimental evaluation of them. We apply the resulting algorithms to verification of linear temporal logics formulæ. Finally, we discuss possible generalizations and extensions, and, in particular, how event detection can benefit from logic programming techniques. KeywordsEvent detection–Runtime verification–Temporal logic–Logic programming–Complexity
    Annals of Mathematics and Artificial Intelligence 07/2011; 62(3):161-186. · 0.20 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Runtime verification is an alternative to static verification, applicable when the latter is impossible (e.g., for lack of the specification of the system to be verified) or computationally too costly. Runtime verification usually requires observability of the system to be verified, that is, complete knowledge of the execution trace being dis-cussed. However, such a requirement might not be met. Even when it is, observation or sampling can be costly, so as to make it worth reasoning about incomplete execution traces. In this paper, we consider the problem of reasoning on incomplete exe-cution traces to verify properties expressed in linear temporal logic. We show how, with suitable hypotheses on the properties to be checked and on the structure of the partial trace, it is possible to reason about the complete trace by observing only the partial trace.
    01/2010;

Full-text (4 Sources)

Download
52 Downloads
Available from
Jun 1, 2014