liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A prototype system for logical reasoning about time and action
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
1990 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

This thesis presents the experience and results from the implementation of a prototype system for reasoning about time and action. Sandewall has defined syntax, semantics and preference relations on the interpretations of a temporal logic. The preference relations are so defined that the preferred interpretations will contain a minimal number of changes not explained by actions occurring in the world and also a minimal number of actions which do occur. An algorithm for a model-based decision procedure is also defined by Sandewall. The algorithm is given a partial description of a scenario and returns all the preferred models of the given description. The preferred models are calculated in two levels: the first searches the set of all sets of actions; the second calculates all the preferred models of the given description with respect to a given set of actions. In this work a proposed implementation of the second level is described and discussed. During the implementation of the system we discovered a flaw in the temporal logic, which lead to a modification of the logic. The implemented system is based on this modified logic.

A discussion about the termination of the first level suggests that the level only terminates under very strong conditions. However, if the condition of returning all preferred models is relaxed, then the first level will terminate for an arbitrary set of formulas under the condition that there exists a preferred model with a finite set of actions. The complexity of the proposed implementation of the second level is of the order faculty over the number of actions in the given plan.

Finally, the AI-planner TWEAK is reviewed and we discuss the similarities in the problem-solving behavior of TWEAK and the decision procedure.

Place, publisher, year, edition, pages
Linköping: Univ. , 1990. , p. 89
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 203
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-160718Local ID: LiU-Tek-Lic-1990:03ISBN: 91-7870-570-3 (print)OAI: oai:DiVA.org:liu-160718DiVA, id: diva2:1357569
Available from: 2019-10-04 Created: 2019-10-04 Last updated: 2019-10-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Hansson, Christer
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 3 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf