Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Avdelning/ar

  • Computer Science

Publiceringsår

2005

Språk

Engelska

Sidor

69-78

Publikation/Tidskrift/Serie

Bulletin of the Polish Academy of Sciences: Technical Sciences

Volym

53

Issue

1

Dokumenttyp

Artikel i tidskrift

Förlag

Polish Academy of Sciences

Ämne

  • Computer Science

Nyckelord

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

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0239-7528