The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Reasoning with Limited Resources: Active Logics Expressed as Labeled Deductive Systems

På svenska

Author

Summary, in English

Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in knowledge-intensive embedded systems. Classical logic is usually considered inappropriate for this purpose as no guarantees regarding deadlines can be made. One of the moreinteresting approaches to address this problem is built around the concept of active logics. Although a step in the right direction, active logics are just a preliminary attempt towards finding an acceptable solution.

Our work is based on the assumption that Labeled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have reformulated a pair of active logics systems, namely the memory model and its formalized simplification, the step logic, as Labeled Deductive Systems.

This paper presents our motivation behind this project, followed by an overview of the investigations on meta-reasoning relevant to this work, and introduces in some reasonable detail the MM system.

Department/s

  • Computer Science

Publishing year

2005

Language

English

Pages

69-78

Publication/Series

Bulletin of the Polish Academy of Sciences: Technical Sciences

Volume

53

Issue

1

Document type

Journal article

Publisher

Polish Academy of Sciences

Topic

  • Computer Science

Keywords

  • reasoning with limited resources
  • Active Logic
  • Labeled Deductive Systems

Status

Published

ISBN/ISSN/Other

  • ISSN: 0239-7528