Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Publiceringsår: 2005
Språk: Engelska
Sidor: 69-78
Publikation/Tidskrift/Serie: Bulletin of the Polish Academy of Sciences: Technical Sciences
Volym: 53
Nummer: 1
Dokumenttyp: Artikel i tidskrift
Förlag: Polish Academy of Sciences


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.


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


  • ISSN: 0239-7528

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen