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: An LDS-based approach

På svenska

Author

Editor

  • B Tessem
  • P Ala-Siuru
  • Patrick Doherty
  • Brian Mayoh

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 inapropriate for this purpose as no guarantees regarding deadlines can be made. One of the more interesting approaches to address this problem is built around the concept of active logics. Although a step in the right direction, active logics still do not offer the ultimate solution.

Our work is based on the assumption that Labelled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have reformulated a pair of systems, namely the step logic and the memory model proposed by Elgot-Drapkin, as Labelled Deductive Systems. This paper presents our motivation behind this project and presents in some detail the first system.

Department/s

  • Computer Science

Publishing year

2003

Language

English

Pages

13-24

Publication/Series

Eight Scandinavian Conference on Artificial Intelligence

Document type

Conference paper

Publisher

IOS Press

Topic

  • Computer Science

Conference name

Eight Scandinavian Conference on Artificial Intelligence, SCAI'03

Conference date

2003-11-02 - 2003-11-04

Conference place

Bergen, Norway

Status

Published

ISBN/ISSN/Other

  • ISBN: 978-1-58603-390-3