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.

On reasoning and planning in real-time: An LDS-based approach

Author

Editor

  • Mike Anderson
  • Tim Oates

Summary, in English

Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in cognitive embedded systems. Classical logic is usually considered inappropriate 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 Labeled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have shown that the LDS-based approach is strictly more expressive than active logics. We have also implemented a prototype automatic theorem prover for LDS-based systems.

Department/s

  • Computer Science

Publishing year

2005

Language

English

Pages

30-35

Publication/Series

AAAI Spring Symposium - Technical Report

Volume

SS-05-04

Document type

Conference paper

Publisher

American Association for Artificial Intelligence

Topic

  • Computer Science

Keywords

  • Metamathematical methodology
  • LDS-based approach
  • Active logics

Conference name

2005 AAAI Spring Symposium

Conference date

2005-03-21 - 2005-03-23

Conference place

Stanford, CA, United States

Status

Published

ISBN/ISSN/Other

  • ISBN: 978-1-57735-230-3