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

Direct link
Reasoning about action in polynomial time
1999 (English)In: Artificial Intelligence, ISSN 0004-3702, E-ISSN 0374-2539, Vol. 115, no 1, 1-24Article in journal (Refereed) Published
Abstract [en]

Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this article are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension for reasoning about action, and NP-completeness results for the unrestricted problems. Many interesting reasoning problems can be modelled, involving nondeterminism, concurrency and memory of actions. The reasoning process is proved to be sound and complete. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

Keyword [en]
reasoning about action, logic, computational complexity, temporal logic
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-49932 (URN)10.1016/S0004-3702(99)00065-X (DOI)oai:DiVA.org:liu-49932 (OAI)diva2:270828 (DiVA)
Available from2009-10-11 Created:2009-10-11 Last updated:2011-02-24

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Drakengren, ThomasBjäreland, Marcus
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
In the same journal
Artificial Intelligence
Engineering and Technology

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

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link