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

Direct link
Tackling the qualification problem using fluent dependency constraints
1998 (English)In: Proceedings of the 5th International Workshop on Temporal Representation and Reasoning (TIME-98) / [ed] Lina Khatib, Robert Morris, IEEE Computer Society, 1998, 97-Conference paper (Refereed)
Abstract [en]

The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent dependency constraints together with the use of durational fluents can be used to deal with problems associated with action qualification. We provide both a \emph{weak} and \emph{strong} form of qualification and demonstrate the approach using an action scenario which combines solutions to the frame, ramification and qualification problems in the context of actions with duration, concurrent actions, non-deterministic actions and the use of both boolean and non-boolean fluents. The circumscription policy used for the combined problems is reducible to the 1st-order case. In addition, we demonstrate the use of a research tool VITAL, for querying and visualizing action scenarios.

National Category
Computer Science
URN: urn:nbn:se:liu:diva-41452Local ID: 56677ISBN: 0-8186-8473-9OAI: diva2:262304
Temporal Representation and Reasoning
Preliminary reportAvailable from2009-10-10 Created:2009-10-10 Last updated:2013-08-29

Open Access in DiVA

No full text

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link