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.

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

Författare

Redaktör

  • 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.

Avdelning/ar

  • Computer Science

Publiceringsår

2005

Språk

Engelska

Sidor

30-35

Publikation/Tidskrift/Serie

AAAI Spring Symposium - Technical Report

Volym

SS-05-04

Dokumenttyp

Konferensbidrag

Förlag

American Association for Artificial Intelligence

Ämne

  • Computer Science

Nyckelord

  • 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/Övrigt

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