LiU Electronic Press
Full-text not available in DiVA
Author:
Kvarnström, Jonas (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Doherty, Patrick (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Title:
Tackling the qualification problem using fluent dependency constraints
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: Blackwell Publishing
Status:
Published
In:
Computational intelligence(ISSN 0824-7935)(EISSN 1467-8640)
Volume:
16
Issue:
2
Pages:
169-209
Year of publ.:
2000
URI:
urn:nbn:se:liu:diva-41619
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-41619
Local ID:
58398
Subject category:
Computer Science
SVEP category:
Computer science
Abstract(en) :

In the area of formal reasoning about action and change, one of the fundamental representation problems is providing concise modular and incremental specifications of action types and world models, where instantiations of action types are invoked by agents such as mobile robots. Provided the preconditions to the action are true, their invocation results in changes to the world model concomitant with the goal-directed behavior of the agent. One particularly difficult class of related problems, collectively called the qualification problem, deals with the need to find a concise incremental and modular means of characterizing the plethora of exceptional conditions that might qualify an action, but generally do not, without having to explicitly enumerate them in the preconditions to an action. We show how fluent dependency constraints together with the use of durational fluents can be used to deal with problems associated with action qualification using a temporal logic for action and change called TAL-Q. We demonstrate the approach using action scenarios that combine solutions to the frame, ramification, and qualification problems in the context of actions with duration, concurrent actions, nondeterministic actions, and the use of both Boolean and non-Boolean fluents. The circumscription policy used for the combined problems is reducible to the first-order case.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2013-08-29
Statistics:
19 hits