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

Direct link
Cite
Citation style
  • apa
  • 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
TALplanner: An empirical investigation of a temporal logic-based forward chaining planner
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.ORCID iD: 0000-0002-5500-8494
1999 (English)In: 6th International Workshop on Temporal Representation and Reasoning (TIME-99) / [ed] Clare Dixon, Michael Fisher, Los Alamitos, CA, USA: IEEE Computer Society , 1999, p. 47-Conference paper, Published paper (Refereed)
Abstract [en]

We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus and Kabanza, where domain-dependent search control knowledge represented as temporal formulas is used to effectively control forward chaining. Instead of using a linear modal tense logic as with Bacchus and Kabanza, we use TAL, a narrative-based linear temporal logic used for reasoning about action and change in incompletely specified dynamic environments. Two versions of TALplanner are considered, TALplan/modal which is based on the use of emulated modal formulas and a progression algorithm, and TALplan/non-modal which uses neither modal formulas nor a progression algorithm. For both versions of TALplanner and for all tested domains, TALplanner is shown to be considerably faster and requires less memory. The TAL versions also permit the representation of durative actions with internal state.

Place, publisher, year, edition, pages
Los Alamitos, CA, USA: IEEE Computer Society , 1999. p. 47-
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-41594Local ID: 58073ISBN: 0-7695-0173-7 (print)OAI: oai:DiVA.org:liu-41594DiVA, id: diva2:262448
Conference
Temporal Representation and Reasoning
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-13

Open Access in DiVA

No full text in DiVA

Authority records

Doherty, PatrickKvarnström, Jonas

Search in DiVA

By author/editor
Doherty, PatrickKvarnström, Jonas
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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